Classical brouwer-heyting-kolmogorov interpretation

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

Volumn 1316, Issue , 1997, Pages 176-196

  Sato, Masahiko ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ASSOCIATED SETS; CLASSICAL THEORY; FIRST ORDER THEORIES; KOLMOGOROV; LOGICAL OPERATIONS; LOGICAL OPERATORS; MATHEMATICAL ENTITIES;

CALCULATIONS;

EID: 21944431531     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63577-7_43     Document Type: Conference Paper

References (12)

1. Barbanera, F. and Berardi, S., A symmetric lambda calculus for "classical" program extraction, pp. 495-515, in Theoretical Aspects of Computer Software, Lecture Note in Computer Science 789, Hagiya, M. and Mitchell, J.C. (eds.), Springer- Verlag, 1994.
2. Griffin, T., A formulae-as-types notion of control, pp. 47-58, in Proc. 17th ACM Syrup. on Principle of Programmin 9 Languages, ACM Press, 1990.
3. Kameyama, Y., A New Formulation of the Catch/Throw Mechanism, pp. 106-122, in Second Fuji International Workshop on Functional and Logic Programming, Ida, T., Ohori, A. and Takeichi, M. (eds.), World Scientific, 1997.
4. Murthy, C., An evaluation semantics for classical proofs, pp. 96-107, Proc. 5th IEEE Svmp. Logic in Computer Science, IEEE Computer Society Press, 1991.
5. Nakano, H., A constructive formalization of the catch and throw mechanism, pp. 82-89, in Proc. 7th Ann. IEEE Syrup. on Logic in Computer Science, 1992.
6. Nakano, H., The non-deterministic catch and throw mechanism and its subject reduction property, pp. 61-72, in Logic, Language and Computation, Lecture Notes in Computer Science 792, Jones, N. D., Hagiya, M. and Sato, M. (eds.), Springer- Verlag, 1994.
7. Ong, C.-H.L., A semantic view of clazsical proofs, pp. 230-241, in Proc. 11th IEEE Ann. Syrup. Of Logic in Computer Science, Computer Science Press, 1996.
8. Ong, C.-I-I.L. and Stewart C.A., A Curry-Howard foundation for functional computation with control, pp. 215-227. in Proc. 24th Ann. ACM Syrup. on Principles of Programmin 9 Languages, ACM Press, 1997.
9. Pafigot, M., An algorithmic interpretation of classical natural deduction, pp. 190-210, in Proc. International Conf. on Logic Programming and Automated Reasoning, Lecture Notes in Artificial Intelligence 624, Springer-Verlag, 1992.
10. Rehof, N. J. and Sorensen, pp. 516-542, in Theoretical Aspects of Computer Software, Lecture Note in Computer Science 789, Hagiya, M. and Mitchell, J.C. (eds.), Springer-Verlag, 1994.
11. Sato, M., Intuitionistic and dassical natural deduction systems with the catch and the throw rules, pp. 75-92, in Theoretical Computer Science 175, 1997.
12. Troelstra, A.S. and van Dalen, D., Gonstructivism in Mathematics, An Introduction, Studies in Logic and the Foundation of Mathematics 121, North-Holland, 1988.