Denotational semantics using an operationally-based term model

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Denotational semantics using an operationally-based term model

Full text

Pdf (1.00 MB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents

Paris, France

Pages: 386 - 399

Year of Publication: 1997

ISBN:0-89791-853-3

Authors

Mitchell Wand	College of Computer Science, Northeastern University, 360 Huntington Avenue, 161CN, Boston, MA
Gregory T. Sullivan	Fulton 414, Computer Science Department, Boston College, Chestnut Hill, MA and College of Computer Science, Northeastern University, 360, Huntington Avenue, 161CN, Boston, MA

Sponsors

L'Ecole des Mines de Paris : L'Ecole des Mines de Paris
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Ctr Natl de la Recherche Sci :
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 17, Citation Count: 3

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/263699.263755 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.

	Abr90	Samson Abramsky, The lazy lambda calculus, Research topics in functional programming, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	App92	Andrew W. Appel, Compiling with continuations, Cambridge University Press, New York, NY, 1992
	CG95	Roy L. Crole , Andrew D. Gordon, A Sound Metalogical Semantics for Input/Output Effects, Selected Papers from the 8th International Workshop on Computer Science Logic, p.339-353, September 25-30, 1994
	CH94	William D. Clinger , Lars Thomas Hansen, Lambda, the ultimate label or a simple optimizing compiler for Scheme, Proceedings of the 1994 ACM conference on LISP and functional programming, p.128-139, June 27-29, 1994, Orlando, Florida, United States
	Fel87	Matthias Felleisen, The calculi of lambda-nu-cs conversion: a syntactic theory of control and state in imperative higher-order programming languages, 1987
	Gor94	Andrew D. Gordon, Functional programming and input/output, Cambridge University Press, New York, NY, 1994
	Gor95	Andrew D. Gordon. Bisimilarity as a theory of functional programming. In Proceedings of 11th Conference on Mathematical Foundations of Programming Semantics, 1995.
	GSR95	Joshua D. Guttman , John D. Ramsdell , Vipin Swarup, The VLISP verified Scheme system, Lisp and Symbolic Computation, v.8 n.1-2, p.33-110, March 1995 [doi>10.1007/BF01128407]
	Gun92	Carl A. Gunter, Semantics of programming languages: structures and techniques, MIT Press, Cambridge, MA, 1992
	KH89	R. Kelsey , P. Hudak, Realistic compilation by program transformation (detailed summary), Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.281-292, January 11-13, 1989, Austin, Texas, United States [doi>10.1145/75277.75302]
	KKsR+86	David Kranz , Norman Adams , Richard Kelsey , Jonathan Rees , Paul Hudak , James Philbin, ORBIT: an optimizing compiler for scheme, ACM SIGPLAN Notices, v.21 n.7, p.219-233, July 1986
	Mil77	Robin Milner. Fully abstract models of typed lambda-calculi. Theoretical Computer Science, 4:1-22, 1977.
	Mor68	James H. Morris, Jr. Lambda Calculus Models of Programming Languages. P hD thesis, MIT, Cambridge, MA, 1968.
	MS88	A. R. Meyer , K. Sieber, Towards fully abstract semantics for local variables, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.191-203, January 10-13, 1988, San Diego, California, United States [doi>10.1145/73560.73577]
	MT91	Ian A. Mason and Carolyn L. Talcott. Equivalence in functional languages with effects. Journal of Functional Programming, 1:287-327, 1991.
	Ode94	Martin Odersky, A functional theory of local names, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.48-59, January 16-19, 1994, Portland, Oregon, United States [doi>10.1145/174675.175187]
	Ole85	F J Oles, Type algebras, functor categories and block structure, Algebraic methods in semantics, Cambridge University Press, New York, NY, 1986
	ORW95	Dino P. Oliva , John D. Ramsdell , Mitchell Wand, The VLISP verified PreScheme compiler, Lisp and Symbolic Computation, v.8 n.1-2, p.111-182, March 1995 [doi>10.1007/BF01128408]
	OT95	P. W. O'Hearn , R. D. Tennent, Parametricity and local variables, Journal of the ACM (JACM), v.42 n.3, p.658-709, May 1995 [doi>10.1145/210346.210425]
	Par81	David Park, Concurrency and Automata on Infinite Sequences, Proceedings of the 5th GI-Conference on Theoretical Computer Science, p.167-183, March 23-25, 1981
	Plo75	Gordon D. Plotkin. Call-by-name, call-byvalue and the )#-calculus. Theoretical Computer Science, 1:125-159, 1975.
	Plo77	Gordon D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223-255, 1977.
	PS93	Andrew M. Pitts , Ian D. B. Stark, Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?, Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science, p.122-141, August 30-September 03, 1993
	Ram96	John D. Ramsdell. personal communication, July 1996.
	RC+86	J Rees , W Clinger, Revised report on the algorithmic language scheme, ACM SIGPLAN Notices, v.21 n.12, p.37-79, Dec. 1986 [doi>10.1145/15042.15043]
	Sta94	Ian Stark. Names and Higher-Order Functions. PhD thesis, University of Cambridge, December 1994. Also published as Technical Report 363, University of Cambridge Computer Laboratory.
	TW96	Jerzy Tiuryn , Mitchell Wand, Untyped Lambda-Calculus with Input-Output, Proceedings of the 21st International Colloquium on Trees in Algebra and Programming, p.317-329, April 22-24, 1996
	WO92	Mitchell Wand , Dino P. Oliva, Proving the correctness of storage representations, Proceedings of the 1992 ACM conference on LISP and functional programming, p.151-160, June 22-24, 1992, San Francisco, California, United States

CITED BY 3

	Vasileios Koutavas , Mitchell Wand, Small bisimulations for reasoning about higher-order imperative programs, ACM SIGPLAN Notices, v.41 n.1, p.141-152, January 2006
	Kristian Støvring , Soren B. Lassen, A complete, co-inductive syntactic theory of sequential control and state, ACM SIGPLAN Notices, v.42 n.1, January 2007
	Mitchell Wand , William D. Clinger, Optimizing memory usage in higher-order programming languages: theoretical and experimental studies, ACM SIGSOFT Software Engineering Notes, v.25 n.1, p.92, Jan 2000