Constructing Call-by-Value Continuation Semantics

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Constructing Call-by-Value Continuation Semantics

Full text

Pdf (1.12 MB)

Source

Journal of the ACM (JACM) archive
Volume 27 , Issue 3 (July 1980) table of contents

Pages: 580 - 597

Year of Publication: 1980

ISSN:0004-5411

Authors

Ravi Sethi	Bell Laboratories, Murray Hill, N.J.
Adrian Tang	Department of Computer Science, University of Kansas, Lawrence, Kansas

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 30, Citation Count: 7

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/322203.322216 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	ABDALI, S.K. A lambda-calculus model of programming languages: 1. Simple constructs; II. Jumps and procedures. J. Comptr. Languages 1, 4 (1976), 287-301; 303-320.
	2	HUET, G. Confluent reductions: abstract properties and applications to term rewriting systems. Proc. 18th Annual IEEE Symp. on Foundations of Comptr. Sci., Providence, R.I., Oct. 1977, pp. 30-45.
	3	Cliff B. Jones, Denotational Semantics of GOTO: An Exit Formulation and Its Relation to Continuations, The Vienna Development Method: The Meta-Language, p.278-304, January 1978
	4	Robert Milne , C. Strachey, A Theory of Programming Language Semantics, Halsted Press, New York, NY, 1977
	5	MORRIS, F.L. The next 700 programming language descriptions. Unpublished manuscript, 1970.
	6	John C. Reynolds, On the Relation between Direct and Continuation Semantics, Proceedings of the 2nd Colloquium on Automata, Languages and Programming, p.141-156, July 29-August 02, 1974
	7	John C. Reynolds, Semantics of the Domain of Flow Diagrams, Journal of the ACM (JACM), v.24 n.3, p.484-503, July 1977 [doi>10.1145/322017.322028]
	8	Barry K. Rosen, Tree-Manipulating Systems and Church-Rosser Theorems, Journal of the ACM (JACM), v.20 n.1, p.160-187, Jan. 1973 [doi>10.1145/321738.321750]
	9	Barry K. Rosen, Applications of high level control flow, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.38-47, January 17-19, 1977, Los Angeles, California [doi>10.1145/512950.512955]
	10	SCOTT, D., AND STRACHEY, C. Towards a mathematical semantics for computer languages. In Proc. Syrup. on Computers and Automata, Polytechnic Press, Brooklyn, N.Y., 1971, pp. 19--46.
	11	Ravi Sethi, Testing for the Church-Rosser Property, Journal of the ACM (JACM), v.21 n.4, p.671-679, Oct. 1974 [doi>10.1145/321850.321862]
	12	SETHI, R...,,r,'D TANG, A. Transforming direct into continuation semantics for a simple imperative language. Unpublished manuscript, Bell Laboratories, Murray Hill, N.J., 1978.
	13	Joseph E. Stoy, Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, MIT Press, Cambridge, MA, 1977
	14	STOY, J.E. The congruence of two programming language definitions. Unpublished manuscript, 1976.
	15	STRACHEY. C., AND WADSWORTH, C. Continuations: a mathematical semantics which can deal with full jumps. Tech. Monog. PRG-I 1, Programming Research Group, Oxford University, Oxford, 1974.
	16	R. D. Tennent, The denotational semantics of programming languages, Communications of the ACM, v.19 n.8, p.437-453, Aug. 1976 [doi>10.1145/360303.360308]

CITED BY 7

	Jakov Kučan, Retraction Approach to CPS Transform, Higher-Order and Symbolic Computation, v.11 n.2, p.145-175, September 1998
	Steven D. Johnson, Applicative programming and digital design, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.218-227, January 15-18, 1984, Salt Lake City, Utah, United States
	Olivier Danvy , Andrzej Filinski, Abstracting control, Proceedings of the 1990 ACM conference on LISP and functional programming, p.151-160, June 27-29, 1990, Nice, France
	Dorai Sitaram , Matthias Felleisen, Models of continuations without continuations, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.185-196, January 21-23, 1991, Orlando, Florida, United States
	Mitchell Wand, Deriving Target Code as a Representation of Continuation Semantics, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.3, p.496-517, July 1982
	Andrzej Filinski, Representing monads, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.446-457, January 16-19, 1994, Portland, Oregon, United States
	Albert Meyer , Jon G. Riecke, Continuations may be unreasonable, Proceedings of the 1988 ACM conference on LISP and functional programming, p.63-71, July 25-27, 1988, Snowbird, Utah, United States