Deriving Target Code as a Representation of Continuation Semantics

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Deriving Target Code as a Representation of Continuation Semantics

Full text

Pdf (1.03 MB)

Source

ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 4 , Issue 3 (July 1982) table of contents

Pages: 496 - 517

Year of Publication: 1982

ISSN:0164-0925

Author

Mitchell Wand

Computer Science Department, Indiana University, Bloomington, IN

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 35, Citation Count: 32

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/357172.357179 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	John Backus, Programming language semantics and closed applicative languages, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.71-86, October 01-03, 1973, Boston, Massachusetts [doi>10.1145/512927.512934]
	2	The Vienna Development Method: The Meta-Language, January 1978
	3	R. M. Burstall , John Darlington, A Transformation System for Developing Recursive Programs, Journal of the ACM (JACM), v.24 n.1, p.44-67, Jan. 1977 [doi>10.1145/321992.321996]
	4	BURSTALL, R.M., AND LANmN, P.J. Programs and their proofs: An algebraic approach. In Machine Intelligence, vol. 4, B. Meltzer and D. Michie (Eds.). Elsevier North-Holland, New York, 1969, pp. 17-44.
	5	J. A. Goguen , J. W. Thatcher , E. G. Wagner , J. B. Wright, Initial Algebra Semantics and Continuous Algebras, Journal of the ACM (JACM), v.24 n.1, p.68-95, Jan. 1977 [doi>10.1145/321992.321997]
	6	HOARE, C.A.R. Proving correctness of data representations. Acta Inf. 1, 4 (1972), 271-281.
	7	Neil D. Jones , David A. Schmidt, Compiler generation from denotational semantics, Semantics-Directed Compiler Generation, Proceedings of a Workshop, p.70-93, January 14-18, 1980
	8	Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
	9	LANDIN, P.J. The mechanical evaluation of expressions. Computer J. 6, 4 (Jan. 1964), 308-320.
	10	MCCARTHY, J. Towards a mathematical science of computation. Information Processing 62, C.M. PoppleweU (Ed.) Elsevier North-Holland, New York, 1963, pp. 21-28.
	11	MCCARTHY, J., ANO PAINTER, J. Correctness of a compiler for arithmetic expressions. In Mathematical Aspects of Computer Science, vol. 19: Proceedings of Symposium in Applied Mathematics, J.T. Schwartz (Ed.) American Mathematical Society, Providence, R.I., 1967, pp. 33-41.
	12	Robert Milne , C. Strachey, A Theory of Programming Language Semantics, Halsted Press, New York, NY, 1977
	13	MILNER, R., AND WEYHRAUCH, R. Proving compiler correctness in a mechanized logic. In Machine Intelligence, vol. 7, B. Meltzer and D. Michie (Eds.). Edinburgh University Press, Edinburgh, Scotland, 1972, pp. 51-72.
	14	James H. Morris, Jr. , Ben Wegbreit, Subgoal induction, Communications of the ACM, v.20 n.4, p.209-222, April 1977 [doi>10.1145/359461.359466]
	15	F. Lockwood Morris, Advice on structuring compilers and proving them correct, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.144-152, October 01-03, 1973, Boston, Massachusetts [doi>10.1145/512927.512941]
	16	Peter D. Mosses, A Constructive Approach to Compiler Correctness, Proceedings of the 7th Colloquium on Automata, Languages and Programming, p.449-469, July 14-18, 1980
	17	PLOTKIN, G.D. LCF considered as a programming language. Theor. Comput. Sci. 5, 3 (Dec. 1977), 223-255.
	18	T. W. Pratt, Programming languages: design and implementation (2nd ed.), Prentice-Hall, Inc., Upper Saddle River, NJ, 1983
	19	QUlNE, W.V.O. Word and Object. M.I.T. Press, Cambridge, Mass., 1960.
	20	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
	21	John C. Reynolds, Definitional interpreters for higher-order programming languages, Proceedings of the ACM annual conference, p.717-740, August 01-01, 1972, Boston, Massachusetts, United States [doi>10.1145/800194.805852]
	22	SETm, R. Circular expressions: A progress report on semantics-directed compiler generation. In Lecture Notes in Computer Science, vol. 115: Automata, Languages, and Programming, 8th Colloquium, Acre, Israel, July 13-17, 1981, S. Even and O. Kariv (Eds.). Springer-Verlag, New York, 1981.
	23	Ravi Sethi , Adrian Tang, Constructing Call-by-Value Continuation Semantics, Journal of the ACM (JACM), v.27 n.3, p.580-597, July 1980 [doi>10.1145/322203.322216]
	24	Guy Lewis Steele, Jr. , Gerald Jay Sussman, The dream of a lifetime: A lazy variable extent mechanism, Proceedings of the 1980 ACM conference on LISP and functional programming, p.163-172, August 25-27, 1980, Stanford University, California, United States [doi>10.1145/800087.802802]
	25	Guy Lewis Steele, Jr. , Gerald Jay Sussman, Design of a LISP-based microprocessor, Communications of the ACM, v.23 n.11, p.628-645, Nov. 1980 [doi>10.1145/359024.359031]
	26	STOY, J.E. The congruence of two programming language definitions. Theor. Comput. Sci. 13 (1981), 151-174.
	27	Joseph E. Stoy, Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, MIT Press, Cambridge, MA, 1977
	28	Gerald J. Sussman , Guy L. Steele, Jr., An Interpreter for Extended Lambda Calculus, Massachusetts Institute of Technology, Cambridge, MA, 1975
	29	Andrew S. Tanenbaum, Structured computer organization (3rd ed.), Prentice-Hall, Inc., Upper Saddle River, NJ, 1989
	30	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]
	31	James W. Thatcher , Eric G. Wagner , Jesse B. Wright, More on Advice on Structuring Compilers and Proving Them Correct, Proceedings of the 6th Colloquium, on Automata, Languages and Programming, p.596-615, July 16-20, 1979
	32	TURNER, D.A. A new implementation technique for applicative languages. Softw. Pract. Exper. 9 (1979), 31-49.
	33	Mitchell Wand, Semantics-directed machine architecture, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.234-241, January 25-27, 1982, Albuquerque, Mexico [doi>10.1145/582153.582179]
	34	WANO, M. First-order identities as a defining language. Acta Inf. 14 (1980), 337-357.
	35	WANI), M. SCHEME version 3.1 reference manual. Tech. Rep. 93, Computer Science Dep., Indiana Univ., June 1980.
	36	Mitchell Wand, Continuation-Based Program Transformation Strategies, Journal of the ACM (JACM), v.27 n.1, p.164-180, Jan. 1980 [doi>10.1145/322169.322183]

CITED BY 32

	Pascal Fradet , Daniel Le Métayer, Compilation of functional languages by program transformation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.1, p.21-51, Jan. 1991
	Mitchell Wand, Loops in combinator-based compilers, Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.190-196, January 24-26, 1983, Austin, Texas
	Mitchell Wand, Compiler correctness for parallel languages, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.120-134, June 26-28, 1995, La Jolla, California, United States
	E. Cartwright , M. Felleisen, The semantics of program dependence, ACM SIGPLAN Notices, v.24 n.7, p.13-27, July 1989
	David A. Schmidt, Detecting global variables in denotational specifications, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.2, p.299-310, April 1985
	Tim Nicholson , Norman Foo, A denotational semantics for Prolog, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.4, p.650-665, Oct. 1989
	John Hannan, Operational semantics-directed compilers and machine architectures, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.4, p.1215-1247, July 1994
	Uwe F. Pleban, Compiler prototyping using formal semantics, ACM SIGPLAN Notices, v.19 n.6, p.94-105, June 1984
	Rémi Douence , Pascal Fradet, A systematic study of functional language implementations, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.2, p.344-387, March 1998
	Mitchell Wand, A semantic prototyping system, ACM SIGPLAN Notices, v.19 n.6, p.213-221, June 1984
	Jean-Claude Raoult , Ravi Sethi, Properties of a Notation for Combining Functions, Journal of the ACM (JACM), v.30 n.3, p.595-611, July 1983
	Hanne R. Nielson , Flemming Neilson, Semantics directed compiling for functional languages, Proceedings of the 1986 ACM conference on LISP and functional programming, p.249-257, August 1986, Cambridge, Massachusetts, United States
	John C. Reynolds, Using functor categories to generate intermediate code, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.25-36, January 23-25, 1995, San Francisco, California, United States
	William Clinger, The scheme 311 compiler an exercise in denotational semantics, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.356-364, August 06-08, 1984, Austin, Texas, United States
	Veronique Royer, Transformations of denotational semantics in semantics directed compiler generation, ACM SIGPLAN Notices, v.21 n.7, p.68-73, July 1986
	David A. Gudeman, Denotational semantics of a goal-directed language, ACM Transactions on Programming Languages and Systems (TOPLAS), v.14 n.1, p.107-125, Jan. 1992
	M. Montenyohl , M. Wand, Correct flow analysis in continuation semantics, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.204-218, January 10-13, 1988, San Diego, California, United States
	Charles Consel , Olivier Danvy, Static and dynamic semantics processing, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.14-24, January 21-23, 1991, Orlando, Florida, United States
	J. F. Giorgi , D. Le Métayer, Continuation-based parallel implementation of functional programming languages, Proceedings of the 1990 ACM conference on LISP and functional programming, p.209-217, June 27-29, 1990, Nice, France
	Ulrik Jørring , William L. Scherlis, Compilers and staging transformations, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.86-96, January 01, 1986, St. Petersburg Beach, Florida
	Mads Sig Ager , Olivier Danvy , Mayer Goldberg, A symmetric approach to compilation and decompilation, The essence of computation: complexity, analysis, transformation, Springer-Verlag New York, Inc., New York, NY, 2002
	Ravi Sethi, Control Flow Aspects of Semantics-Directed Compiling, ACM Transactions on Programming Languages and Systems (TOPLAS), v.5 n.4, p.554-595, Oct. 1983
	John Hannan, Staging transformations for abstract machines, ACM SIGPLAN Notices, v.26 n.9, p.130-141, Sept. 1991
	P. Lee , U. Pleban, A realistic compiler generator based on high-level semantics: another progress report, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.284-295, January 21-23, 1987, Munich, West Germany
	E. E. Kohlbecker , M. Wand, Macro-by-example: Deriving syntactic transformations from their specifications, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.77-84, January 21-23, 1987, Munich, West Germany
	Mitchell Wand, Semantics-directed machine architecture, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.234-241, January 25-27, 1982, Albuquerque, Mexico
	Andrew W. Appel, Semantics-directed code generation, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.315-324, January 14-16, 1985, New Orleans, Louisiana, United States
	Mitchell Wand, Embedding type structure in semantics, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.1-6, January 14-16, 1985, New Orleans, Louisiana, United States
	M. Y. Zhu, Transformational programming: the derivation of a Prolog interpretation algorithm, ACM SIGPLAN Notices, v.24 n.9, p.92-111, Sept. 1989
	Peter Sestoft, Deriving a lazy abstract machine, Journal of Functional Programming, v.7 n.3, p.231-264, May 1997
	Peter Thiemann, Combinators for program generation, Journal of Functional Programming, v.9 n.5, p.483-525, September 1999
	Olivier Danvy, Defunctionalized interpreters for programming languages, ACM SIGPLAN Notices, v.43 n.9, p.131-142, September 2008