Singleton, union and intersection types for program extraction
Author:
- 1 January 1991
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 701-730
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Refinement types for ML1991
- Intersection and union types1991
- The semantics of second-order lambda calculusInformation and Computation, 1990
- Type Systems for Programming Languages1990
- Constructive Mathematics and Computer-Assisted Reasoning Systems1990
- The calculus of constructionsInformation and Computation, 1988
- Programming with proofs: A second order type theory1988
- Polymorphism is set theoretic, constructively1987
- Typing and computational properties of lambda expressionsTheoretical Computer Science, 1986
- An ideal model for recursive polymorphic typesInformation and Control, 1986