A Notion of Classical Pure Type System (Preliminary version)
Open Access
- 1 January 1997
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 6, 4-59
- https://doi.org/10.1016/s1571-0661(05)80170-7
Abstract
No abstract availableKeywords
This publication has 43 references indexed in Scilit:
- λμ-Calculus: An algorithmic interpretation of classical natural deductionPublished by Springer Nature ,2005
- Sound and complete axiomatisations of call-by-value control operatorsMathematical Structures in Computer Science, 1995
- A-translation and looping combinators in pure type systemsJournal of Functional Programming, 1994
- Polymorphic type assignment and CPS conversionHigher-Order and Symbolic Computation, 1993
- The discoveries of continuationsHigher-Order and Symbolic Computation, 1993
- Finding computational content in classical proofsPublished by Cambridge University Press (CUP) ,1991
- On the proof theory of the intermediate logic MHThe Journal of Symbolic Logic, 1986
- Consent FormsBMJ, 1971
- Deductive systems and categoriesTheory of Computing Systems, 1968
- Zur Deutung der intuitionistischen LogikMathematische Zeitschrift, 1932