The logical abstract machine: A Curry-Howard isomorphism for machine code

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

Volumn 1722, Issue , 1999, Pages 300-318

  Ohori, Atsushi ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; CODES (SYMBOLS); COMPUTER CIRCUITS; DIFFERENTIATION (CALCULUS); FORMAL LOGIC; FUNCTIONAL PROGRAMMING; LOGIC PROGRAMMING; SET THEORY;

CODE GENERATION ALGORITHM; CURRY-HOWARD ISOMORPHISM; EQUIVALENCE THEOREM; FUNCTIONAL LANGUAGES; IMPLEMENTATION PROCESS; INTUITIONISTIC PROPOSITIONAL LOGIC; MACHINE INSTRUCTIONS; SEQUENTIAL EXECUTION;

SEQUENTIAL MACHINES;

EID: 84957631403     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10705424_20     Document Type: Conference Paper

References (20)

1. Andrew W. Appel. Compiling with Continuations. Cambridge University Press, 1992. 314
2. G. Cousineau, P-L. Curien, and M. Mauny. The categorical abstract machine. Science of Computer Programming, 8 (2), 1987. 302, 302
3. H. B. Curry and R. Feys. Combinatory Logic, volume 1. North-Holland, Amsterdam, 1968. 302, 302, 302, 305
4. 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. 301
5. 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. 317
6. C.A. Gunter. Semantics of Programming Languages - Structures and Techniques. The MIT Press, 1992. 300
7. 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. 302, 305
8. S. Katsumata, 1999. Personal communication. 316
9. S. Kleene. Introduction to Metamathematics. North-Holland, 1952. 7th edition. 301
10. J. Lambek. From A-calculus to cartesian closed categories. In To H. B. Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism, pages 375-402. Academic Press, 1980. 302
11. P. J. Landin. The mechanical evaluation of expressions. Computer Journal, 6:308-320, 1964. 302
12. X. Leroy. The ZINC experiment: an economical implementation of the ML language. Technical Report 117, INRIA, 1992. 301
13. T. Lindholm and F. Yellin. The Java virtual machine specification. Addison-Wesley, 1996. 301
14. J.C. Mitchell. Foundations for Programming Languages. MIT Press, 1996. 300
15. G. Morrisett, K. Crary, N. Glew, and D. Walker. Stack-based typed assembly language. In Proc. International Workshop on Types in Compilation, Springer LNCS 1478, 1998. 302
16. G. Morrisett, D. Walker, K. Crary, and N. Glew. From system F to typed assembly language. In Proc. ACM Symposium on Principles of Programming Languages, 1998. 302
17. A Ohori. A Curry-Howard isomorphism for compilation and program execution. In Proc. Typed Lambda Calculi and Applications, Springer LNCS 1581, pages 258179, 1999. 301, 314
18. Simon L. Peyton Jones. The Implementation of Functional Programming Languages. Series in Computer Science. Prentice-Hall, 1987. 314, 314
19. B. Stata and M. Abadi. A type system for java bytecode subroutines. In Proc. ACM Symposium on Principles of Programming Languages, pages 149-160, 1998. 302
20. D.A. Turner. A new implementation technique for applicative languages. Software Practice and Experience, 9:31-49, 1979. 302, 302