Games and weak-head reduction for classical PCF
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 214-230
- https://doi.org/10.1007/3-540-62688-3_38
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- λμ-Calculus: An algorithmic interpretation of classical natural deductionPublished by Springer Nature ,2005
- Game semantics and abstract machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Functional back-ends within the lambda-sigma calculusPublished by Association for Computing Machinery (ACM) ,1996
- A semantics of evidence for classical arithmeticThe Journal of Symbolic Logic, 1995
- Explicit substitutionsJournal of Functional Programming, 1991
- Dialogues as a Foundation for Intuitionistic LogicPublished by Springer Nature ,1986
- On the Original Gentzen Consistency Proof for Number TheoryPublished by Elsevier ,1970