A curry-howard isomorphism for compilation and program execution

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1581, Issue , 1999, Pages 280-294

  Ohori, Atsushi ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; DIFFERENTIATION (CALCULUS); PATHOLOGY; SET THEORY;

CURRY-HOWARD ISOMORPHISM; CUT ELIMINATION; INTERMEDIATE LANGUAGES; INTUITIONISTIC SEQUENT CALCULUS; NATURAL DEDUCTION; PROGRAM EXECUTION; PROOF TRANSFORMATION; SEQUENT CALCULUS;

CALCULATIONS;

EID: 84949188939     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48959-2_20     Document Type: Conference Paper

References (21)

1. S. Abramsky. Computational interpretation of linear logic. Theoretical Computer Science, 3(57), 1993.
2. B. Breazu-Tannen, D. Kesner, and L. Puel. A typed pattern calculus. In Proc. IEEE Symposium on Logic in Computer Science, pages 262-274, 1993.
3. H. B. Curry and R. Feys. Combinatory Logic, volume 1. North-Holland, Amsterdam, 1968.
4. V. Danos, J-B. Jointe, and H. Schellinx. A new deconstructive logic: linear logic. Journal of Symbolic Logic, 63 (3):755-807, 1997.
5. O. Danvy. Back to direct style. In Proc. European Symposium on Programming, volume 582 of Lecture Notes in Computer Science, pages 130-150, 1992.
6. C. Flanagan, A. Sabry, B.F. Duba, and M. Felleisen. The essence of compiling with continuation. In Proc. ACM PLDI Conference, pages 237-247, 1993.
7. J. Gallier. Constructive logics part I: A tutorial on proof systems and typed λ- calculi. Theoretical Computer Science, 110:249-339, 1993.
8. G. Gentzen. Investigation into logical deduction. In M.E. Szabo, editor, The Collected Papers of Gerhard Gentzen. North-Holland, 1969.
9. T. Griffin. A formulae-as-types notion of control. In Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, pages 47-58, 1990.
10. H. Herbelin. A λ-calculus structure isomorphic to Gentzen-style sequent calculus structure. In Proc. European Association for Computer Science Logic, Lecture Notes in Computer Science 933, pages 61-74, 1994.
11. W. Howard. The formulae-as-types notion of construction. In To H. B. Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism,, pages 476-490. Academic Press, 1980.
12. G. Kahn. Natural semantics. In Proc. Symposium on Theoretical Aspects of Computer Science, pages 22-39. Springer Verlag, 1987.
13. S. Kleene. Introduction to Metamathematics. North-Holland, 1952. 7th edition.
14. S. Kobayashi. Monads as modality. Theoretical Computer Science, 175 (1):29-74, 1997.
15. E. Moggi. Computational lambda-calculus and monads. In Proceedings of the Symposium on Logic in Computer Science, 1989.
16. I. Ogata. Cut elimination for classical proofs as continuation passing style computation. In Proc. ASIAN Computing Science Conference, LNCS 1538, 1998.
17. G. Pottinger. Normalization as a homomorphic image of cut-elimination. Ann. Math. Logic, 12:323-357, 1977.
18. D. Prawitz. Natural Deduction. Almqvist & Wiksell, 1965.
19. A. Sabry and M. Felleisen. Reasoning about programs in continuation-passing style. J. Lisp and Symbolic Computation, 6 (3):287-358, 1993.
20. W. Tait. Intensional interpretations of functionals of finite type i. Journal of Symbolic Logic, 32(2), 1966.
21. J. Zucker. The correspondence between cut-elimination and normalization. Ann. Math. Logic, 7:1-112, 1974.