Propositions and specifications of programs in Martin-Löf's type theory
- 1 September 1984
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 24 (3) , 288-301
- https://doi.org/10.1007/bf02136027
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Constructions, proofs and the meaning of logical constantsJournal of Philosophical Logic, 1983
- The identification of propositions and types in Martin-Löf's type theory: A programming exampleLecture Notes in Computer Science, 1983
- A critique of the foundations of Hoare style programming logicsCommunications of the ACM, 1982
- Program SpecificationLecture Notes in Computer Science, 1982
- Can programming be liberated from the von Neumann style?Communications of the ACM, 1978
- A Transformation System for Developing Recursive ProgramsJournal of the ACM, 1977
- Constructive validityPublished by Springer Nature ,1970
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTESDialectica, 1958
- On the interpretation of intuitionistic number theoryThe Journal of Symbolic Logic, 1945
- Zur Deutung der intuitionistischen LogikMathematische Zeitschrift, 1932