On computational open-endedness in Martin-Lof's type theory
- 10 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Constructive Mathematics and Computer ProgrammingPublished by Elsevier ,2014
- Natural semanticsPublished by Springer Nature ,2005
- Equality in lazy computation systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Full Abstraction in the Lazy Lambda CalculusInformation and Computation, 1993
- Can LCF be topped? Flat lattice models of typed λ-calculusInformation and Computation, 1990
- Deriving mixed evaluation from standard evaluation for a simple functional languagePublished by Springer Nature ,1989
- Towards a computation system based on set theoryTheoretical Computer Science, 1988
- Foundations of Constructive MathematicsPublished by Springer Nature ,1985
- A language and axioms for explicit mathematicsPublished by Springer Nature ,1975