Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 118-135
- https://doi.org/10.1007/3-540-60360-3_36
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- Polymorphic binding-time analysisPublished by Springer Nature ,1994
- Program derivation by fixed point computationScience of Computer Programming, 1989
- Automatic binding time analysis for a typed λ-calculusScience of Computer Programming, 1988
- Polymorphic type schemes and recursive definitionsPublished by Springer Nature ,1984
- Principal type-schemes for functional programsPublished by Association for Computing Machinery (ACM) ,1982