Call-by-value, call-by-name, and strong normalization for the classical sequent calculus

Electronic Notes in Theoretical Computer Science

Volumn 86, Issue 4, 2003, Pages 714-730

  Lengrand, Stéphane ^a,b  

^a UNIVERSITÉ DE LYON   (France)

^b UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING; ENCODING (SYMBOLS); EVALUATION; SYNTACTICS;

CLASSICAL LOGIC; CLASSICAL SEQUENT CALCULUS; CUT-ELIMINATION PROCEDURE; ELIMINATION RULES;

COMPUTER SCIENCE;

EID: 11244294207     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)82619-2     Document Type: Conference Paper

References (9)

1. Bloo R., Rose K.H. Preservation of strong normalisation in named lambda calculi with explicit substitution and garbage collection. CSN '95-Computing Science in the Netherlands. November 1995;62-72 Koninklijke Jaarbeurs, Utrecht
2. Curien P.-L., Herbelin H. The duality of computation. Proceedings of the 5th ACM SIGPLAN International Conference on Functional Programming (ICFP'OO). 2000;233-243 ACM Press
3. Filinski Andrzej. Declarative continuations and categorical duality. Master's thesis, DIKU, Computer Science Department. August 1989;University of Copenhagen. DIKU Rapport 89/11
4. Gentzen G. Investigations into logical deduction. Szabo M.E. Gentzen collected works. 1969;North Holland. 68ff (1969), 1935.
5. Herbelin H. Sequents qu'on calcule. PhD thesis. 7:1995;Universite Paris
6. Hofmann M., Streicher T. Continuation models are universal for X m̈ calculus. In Proc. of Logic in Computer Science (LICS). 1997;387-397
7. M. Parigot. A m̈ -calculus: An algorithmic interpretation of classical natural deduction. In Proc. of the International Conference on Logic Programming and Automated Reasoning (LPAR). Lecture Notes in Computer Science 1, 1992.
8. Selinger P. Control categories and duality: on the categorical semantics of the A m̈ -calculus. Mathematical Structures in Computer Science. 1999
9. C. Urban. Classical Logic and Computation. PhD thesis, University of Cambridge, 2000.