The non-deterministic catch and throw mechanism and its subject reduction property

  • Hiroshi Nakano
Part of the Lecture Notes in Computer Science book series (LNCS, volume 792)


A simple programming language and its typing system is introduced to capture the catch and throw mechanism with its non-deterministic feature. The subject reduction property of the system, which compensates for the unpleasant feature of the non-determinism, is shown.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Felleisen, D. Friedman, E. Kohlbecker, and B. Duba, A syntactic theory of sequential control, Theoretical Computer Science 52 (1987) 205–237.Google Scholar
  2. 2.
    T. G. Griffin, A formulae-as-types notion of control, Conf. Rec. ACM Symp. on Principles of Programming Languages (1990) 47–58.Google Scholar
  3. 3.
    C. R. Murthy, An evaluation semantics for classical proofs, Proc. the 6th Annual IEEE Symp. on Logic in Computer Science (1991) 96–107.Google Scholar
  4. 4.
    H. Nakano, A Constructive Formalization of the Catch and Throw Mechanism, Proc. the 7th Annual IEEE Symp. on Logic in Computer Science (1992) 82–89.Google Scholar
  5. 5.
    G. D. Plotkin, Call-by-name, call-by-value and the λ-calculus, Theoretical Computer Science 1 (1975) 125–159.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Hiroshi Nakano
    • 1
  1. 1.Department of Applied Mathematics and InformaticsRyukoku UniversityOtsuJapan

Personalised recommendations