Singleton, union and intersection types for program extraction
- 1 January 1991
- book chapter
- Published by Springer Nature
- p. 701-730
- https://doi.org/10.1007/3-540-54415-1_71
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Refinement types for MLPublished by Association for Computing Machinery (ACM) ,1991
- Intersection and union typesPublished by Springer Nature ,1991
- The semantics of second-order lambda calculusInformation and Computation, 1990
- Type Systems for Programming LanguagesPublished by Elsevier ,1990
- Constructive Mathematics and Computer-Assisted Reasoning SystemsPublished by Springer Nature ,1990
- The calculus of constructionsInformation and Computation, 1988
- Programming with proofs: A second order type theoryPublished by Springer Nature ,1988
- Polymorphism is set theoretic, constructivelyPublished by Springer Nature ,1987
- Typing and computational properties of lambda expressionsTheoretical Computer Science, 1986
- An ideal model for recursive polymorphic typesInformation and Control, 1986