Discrete polymorphism
- 1 May 1990
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 288-297
- https://doi.org/10.1145/91556.91675
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A characterization of lambda definable tree operationsInformation and Computation, 1990
- Automatic synthesis of typed Λ-programs on term algebrasTheoretical Computer Science, 1985
- Syntactic translations and provably recursive functionsThe Journal of Symbolic Logic, 1985
- Polymorphism is not set-theoreticPublished by Springer Nature ,1984
- Principal type schemes for an extended type theoryTheoretical Computer Science, 1983
- A filter lambda model and the completeness of type assignmentThe Journal of Symbolic Logic, 1983
- The Expressiveness of Simple and Second-Order Type StructuresJournal of the ACM, 1983
- An extension of the basic functionality theory for the $\lambda$-calculus.Notre Dame Journal of Formal Logic, 1980
- Finite investigations of transfinite derivationsJournal of Mathematical Sciences, 1978
- Nested recursionMathematische Annalen, 1961