Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Felleisen, D. Friedman, E. Kohlbecker, and B. Duba, A syntactic theory of sequential control, Theoretical Computer Science 52 (1987) 205–237.
T. G. Griffin, A formulae-as-types notion of control, Conf. Rec. ACM Symp. on Principles of Programming Languages (1990) 47–58.
C. R. Murthy, An evaluation semantics for classical proofs, Proc. the 6th Annual IEEE Symp. on Logic in Computer Science (1991) 96–107.
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.
G. D. Plotkin, Call-by-name, call-by-value and the λ-calculus, Theoretical Computer Science 1 (1975) 125–159.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nakano, H. (1994). The non-deterministic catch and throw mechanism and its subject reduction property. In: Jones, N.D., Hagiya, M., Sato, M. (eds) Logic, Language and Computation. Lecture Notes in Computer Science, vol 792. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032394
Download citation
DOI: https://doi.org/10.1007/BFb0032394
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57935-9
Online ISBN: 978-3-540-48391-5
eBook Packages: Springer Book Archive