Languages with reducing reflexive types
Authors:
- 1 January 1980
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 38-50
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Functional characterization of some semantic equalities inside λ-calculusLecture Notes in Computer Science, 1979
- Stable models of typed λ-calculi1978
- LCF considered as a programming languageTheoretical Computer Science, 1977
- Fully abstract models of typed λ-calculiTheoretical Computer Science, 1977
- Initial Algebra Semantics and Continuous AlgebrasJournal of the ACM, 1977
- Data Types as LatticesSIAM Journal on Computing, 1976
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-CalculusSIAM Journal on Computing, 1976
- Algorithmes d’Equivalence et de Reduction a des Expressions Minimales dans Une Classe d’Equations Recursives SimplesLecture Notes in Computer Science, 1974
- Ten Mini-Languages: A Study of Topical Issues in Programming LanguagesACM Computing Surveys, 1971