Extending the type checker of Standard ML by polymorphic recursion

Emms, Martin; Leiß, Hans

doi:10.1016/s0304-3975(98)00139-x

Cited by 7 publications

(5 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They show that type inference is reducible to semi-unification, which is undecidable [13]. However, the undecidability of this problem apparently does not matter much in practice [6].…”

Section: Type Inferencementioning

confidence: 99%

Global Type Inference for Featherweight Generic Java

Stadelmeier¹,

Plümicke²,

Thiemann³

2022

Preprint

View full text Add to dashboard Cite

Java's type system mostly relies on type checking augmented with local type inference to improve programmer convenience.We study global type inference for Featherweight Generic Java (FGJ), a functional Java core language. Given generic class headers and field specifications, our inference algorithm infers all method types if classes do not make use of polymorphic recursion. The algorithm is constraint-based and improves on prior work in several respects. Despite the restricted setting, global type inference for FGJ is NP-complete.

show abstract

“…They show that type inference is reducible to semi-unification, which is undecidable [13]. However, the undecidability of this problem apparently does not matter much in practice [6].…”

Section: Type Inferencementioning

confidence: 99%

Global Type Inference for Featherweight Generic Java

Stadelmeier¹,

Plümicke²,

Thiemann³

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…The use of expansion [17] instead of type schemes can avoid the complex proofs involving arguments about free and bound type variables [4,12] and immediately lends itself to new applications as in the instantiation of vector size information as discussed in Sect. 5.…”

Section: Related Workmentioning

confidence: 99%

Deriving a complete type inference for hindley-milner and vector sizes using expansion

Simon¹

2013

Proceedings of the ACM SIGPLAN 2013 Workshop on Partial Evaluation and Program Manipulation

View full text Add to dashboard Cite

Type inference and program analysis both infer static properties about a program. Yet, they are constructed using very different techniques. We reconcile both approaches by deriving a type inference from a denotational semantics using abstract interpretation. We observe that completeness results in the abstract interpretation literature can be used to derive type inferences that are backward complete, a property akin to the inference of principal typings. The resulting algorithm is similar to that of Milner-Mycroft, that is, it infers Hindley-Milner types while allowing for polymorphic recursion. Instead of type schemes, it uses expansion to instantiate types. Since our expansion operator is agnostic to the abstract domain, we are able to apply it not only to types. We illustrate this by inferring the size of vector types using systems of linear equalities.

show abstract

“…So we plan to integrate explicit type and term abstraction at let bindings into this type inference algorithm to obtain a single pass split algorithm. To deal with polymorphic recursion as well, the type inference algorithm of Emms and Leiß, which integrates semiunification into the Damas-Milner algorithm, may provide a good basis [EL99].…”

Section: Summary and Future Workmentioning

confidence: 99%

Type-Inference Based Short Cut Deforestation (Nearly) without Inlining

Chitil

2000

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. In [Chi99] we presented a type-inference based deforestation algorithm which performs extensive inlining. However, across module boundaries only limited inlining is practically feasible. Furthermore, inlining is a non-trivial transformation which is therefore best implemented as a separate optimisation pass. To perform short cut deforestation (nearly) without inlining, Gill suggested to split definitions into workers and wrappers and inline only the small wrappers, which transfer the information needed for deforestation. We show that Gill's use of a function build limits deforestation and note that his reasons for using build do not apply to our approach. Hence we develop a more general worker/wrapper scheme without build. We give a type-inference based algorithm which splits definitions into workers and wrappers. Finally, we show that we can deforest more expressions with the worker/wrapper scheme than the algorithm with inlining.

show abstract

Extending the type checker of Standard ML by polymorphic recursion

Cited by 7 publications

References 5 publications

Global Type Inference for Featherweight Generic Java

Global Type Inference for Featherweight Generic Java

Deriving a complete type inference for hindley-milner and vector sizes using expansion

Type-Inference Based Short Cut Deforestation (Nearly) without Inlining

Contact Info

Product

Resources

About