Intensional polymorphism in type-erasure semantics

CraryKarl,; WeirichStephanie,; MorrisettGreg,

doi:10.1145/291251.289459

Cited by 36 publications

(43 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Overloaded functions can be expressed using • type reflection: This is the approach we have used in the main bulk of this article. Its origins can be traced back to the work on intensional type analysis (ITA) [16,13,12,49,51]. ITA is intensively used in typed intermediate languages, in particular, for optimising purely polymorphic functions.…”

Section: Related Workmentioning

confidence: 99%

Generic programming in 3D

Hinze

Löh

2009

Science of Computer Programming

View full text Add to dashboard Cite

a b s t r a c t Support for generic programming consists of three essential ingredients: support for overloaded functions, a run-time type representation, and a generic view on data. Different approaches to datatype-generic programming occupy different points in this design space. In this article, we revisit the ''Scrap your boilerplate'' approach and identify its location within the three-dimensional design space. The characteristic features of ''Scrap your boilerplate'' are its two generic views, the 'spine' view for consuming and transforming data, and the 'type-spine' view for producing data. We show how to combine these views with different overloading mechanisms and type representations.

show abstract

Section: Related Workmentioning

confidence: 99%

Generic programming in 3D

Hinze

Löh

2009

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…Generic programming within an intermediate language of a typed compiler has been studied under the names intensional polymorphism and intensional type analysis by Harper and Morrisett [17] and Crary, Weirich, and Morrisett [14]. The gist of this approach is to have a type case construct on the level of programs, in later developments even also on the level of types.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

Type-based termination of generic programs

Abel

2009

Science of Computer Programming

View full text Add to dashboard Cite

a b s t r a c tInstances of a polytypic or generic program for a concrete recursive type often exhibit a recursion scheme that is derived from the recursion scheme of the instantiation type. In practice, the programs obtained from a generic program are usually terminating, but the proof of termination cannot be carried out with traditional methods as term orderings alone, since termination often crucially relies on the program type. In this article, it is demonstrated that type-based termination using sized types handles such programs very well. A framework for sized polytypic programming is developed which ensures (typebased) termination of all instances.

show abstract

“…With sufficiently expressive intensional type analysis [9,39] one could define type-safe marshalling within the language itself, but there is a tension here: if the language is this expressive, allowing abstract types to be analysed, then abstraction boundaries are not enforced even within a single program.…”

Section: Related Workmentioning

confidence: 99%

Type-safe distributed programming for OCaml

Billings

Sewell

Shinwell

et al. 2006

Proceedings of the 2006 Workshop on ML

View full text Add to dashboard Cite

Existing ML-like languages guarantee type-safety, ensuring memory safety and protecting the invariants of abstract types, but only within single executions of single programs. Distributed programming is becoming ever more important, and should benefit even more from such guarantees. In previous work on theoretical calculi and the Acute prototype language we outlined techniques to provide them for simple languages.In this paper we put these ideas into practice, describing the HashCaml extension to the OCaml bytecode compiler, which supports type-safe and abstraction-safe marshalling, together with related naming constructs. Our contribution is threefold: (1) We show how to define globally meaningful runtime type names for key OCaml type constructs that were not covered in our previous work, dealing with the generativity issues involved: user-defined variant and record types, substructures, functors, arbitrary ascription, separate compilation, and external C functions. (2) We support marshalling within polymorphic functions by type-passing, requiring us to build compositional runtime type names and revisit the OCaml relaxed value restriction. We show that with typed marshalling one must fall back to the SML97 value restriction. (3) We show how the above can be implemented with reasonable performance as an unintrusive modification to the existing OCaml language, implementation, and standard libraries. An alpha release of HashCaml, capable of bootstrapping itself, is available, along with an example type-safe distributed communication library written in the language.

show abstract

Intensional polymorphism in type-erasure semantics

Cited by 36 publications

References 26 publications

Generic programming in 3D

Generic programming in 3D

Type-based termination of generic programs

Type-safe distributed programming for OCaml

Contact Info

Product

Resources

About