A type-theoretical alternative to ISWIM, CUCH, OWHY
- 1 December 1993
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 121 (1-2) , 411-440
- https://doi.org/10.1016/0304-3975(93)90095-b
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Definable operations in general algebras, and the theory of automata and flowchartsPublished by Springer Nature ,2006
- Relational properties of recursively defined domainsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The fixed point property in synthetic domain theoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A co-induction principle for recursively defined domainsTheoretical Computer Science, 1994
- LCF considered as a programming languageTheoretical Computer Science, 1977
- The next 700 programming languagesCommunications of the ACM, 1966
- A formulation of the simple theory of typesThe Journal of Symbolic Logic, 1940