Greedy bidirectional polymorphism

Dunfield, Jana

doi:10.1145/1596627.1596631

Cited by 16 publications

(20 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is based on Stardust, a typechecker for a subset of core Standard ML with support for inductive datatypes, products, intersections, unions, refinement types and indexed types (Dunfield 2007), extended with support for (first-class) polymorphism (Dunfield 2009). We do not yet support all these features; support for first-class polymorphism looks hardest, since Standard ML compilers cannot even handle higher-rank predicative polymorphism.…”

Section: Methodsmentioning

confidence: 99%

“…Our implementation uses bidirectional typechecking (Pierce and Turner 2000; Dunfield and Pfenning 2004;Dunfield 2009), an increasingly common technique in advanced type systems; see Dunfield (2009) for references. This technique offers two major benefits over Damas-Milner type inference: it works for many type systems where annotation-free inference is undecidable, and it seems to produce more localized error messages.…”

Section: Bidirectional Typecheckingmentioning

confidence: 99%

“…Except for merge k , our typing rules can all be found in Dunfield and Pfenning (2004), who argued that introduction rules should check and elimination rules should synthesize. (Parametric polymorphism muddies this picture, but see Dunfield (2009) for an approach used by our implementation.) For functions, this leads to the bidirectional rules…”

Section: Bidirectional Typecheckingmentioning

confidence: 99%

See 2 more Smart Citations

Elaborating intersection and union types

Dunfield¹

2014

J. Funct. Prog.

Self Cite

View full text Add to dashboard Cite

Designing and implementing typed programming languages is hard. Every new type system feature requires extending the metatheory and implementation, which are often complicated and fragile. To ease this process, we would like to provide general mechanisms that subsume many different features.In modern type systems, parametric polymorphism is fundamental, but intersection polymorphism has gained little traction in programming languages. Most practical intersection type systems have supported only refinement intersections, which increase the expressiveness of types (more precise properties can be checked) without altering the expressiveness of terms; refinement intersections can simply be erased during compilation. In contrast, unrestricted intersections increase the expressiveness of terms, and can be used to encode diverse language features, promising an economy of both theory and implementation.We describe a foundation for compiling unrestricted intersection and union types: an elaboration type system that generates ordinary λ-calculus terms. The key feature is a Forsythe-like merge construct. With this construct, not all reductions of the source program preserve types; however, we prove that ordinary call-byvalue evaluation of the elaborated program corresponds to a typepreserving evaluation of the source program.We also describe a prototype implementation and applications of unrestricted intersections and unions: records, operator overloading, and simulating dynamic typing.

show abstract

Section: Methodsmentioning

confidence: 99%

Section: Bidirectional Typecheckingmentioning

confidence: 99%

Section: Bidirectional Typecheckingmentioning

confidence: 99%

See 1 more Smart Citation

Elaborating intersection and union types

Dunfield¹

2014

J. Funct. Prog.

Self Cite

View full text Add to dashboard Cite

show abstract

“…is is reminiscent of greedy type-argument inference for type systems with subtyping [1,4], which is known to cause unintuitive type inference failures due to sub-optimal type arguments (i.e. less general wrt to the subtyping relation) being inferred.…”

Section: Type Inference Specificationmentioning

confidence: 99%

Spine-local Type Inference

Jenkins

Stump

2018

Proceedings of the 30th Symposium on Implementation and Application of Functional Languages

View full text Add to dashboard Cite

We present spine-local type inference, a partial type inference system for inferring omi ed type annotations for System F terms based on local type inference. Local type inference relies on bidirectional inference rules to propagate type information into and out of adjacent nodes of the AST and restricts type-argument inference to occur only within a single node. Spine-local inference relaxes the restriction on type-argument inference by allowing it to occur only within an application spine and improves upon it by using contextual type-argument inference. As our goal is to explore the design space of local type inference, we show that, relative to other variants, spine-local type inference enables desirable features such as first-class curried applications, partial type applications, and the ability to infer types for some terms not otherwise possible. Our approach enjoys usual properties of a bidirectional system of having a specification for our inference algorithm and predictable requirements for typing annotations, and in particular maintains some the advantages of local type inference such as a relatively simple implementation and a tendency to produce good-quality error messages when type inference fails. CCS CONCEPTS•So ware and its engineering → Language features; KEYWORDS bidirectional typechecking, polymorphism, type errors

show abstract

“…Dunfield [71] and others studies more precise subtyping rules for first-class polymorphic types. Recursive Types.…”

Section: Subtyping and Kindingmentioning

confidence: 99%

Union, intersection and refinement types and reasoning about type disjointness for secure protocol implementations

Backes

Hriţcu

Maffei

2014

JCS

View full text Add to dashboard Cite

We present a new type system for verifying the security of reference implementations of cryptographic protocols written in a core functional programming language.The type system combines prior work on refinement types, with union, intersection, and polymorphic types, and with the novel ability to reason statically about the disjointness of types. The increased expressivity enables the analysis of important protocol classes that were previously out of scope for the type-based analyses of reference protocol implementations. In particular, our types can statically characterize:(i) more usages of asymmetric cryptography, such as signatures of private data and encryptions of authenticated data; (ii) authenticity and integrity properties achieved by showing knowledge of secret data; (iii) applications based on zero-knowledge proofs. The type system comes with a mechanized proof of correctness and an efficient type-checker.

show abstract

Greedy bidirectional polymorphism

Cited by 16 publications

References 23 publications

Elaborating intersection and union types

Elaborating intersection and union types

Spine-local Type Inference

Union, intersection and refinement types and reasoning about type disjointness for secure protocol implementations

Contact Info

Product

Resources

About