Parameter-passing and the lambda calculus

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Parameter-passing and the lambda calculus

Full text

Pdf (1.16 MB)

Source

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

Orlando, Florida, United States

Pages: 233 - 244

Year of Publication: 1991

ISBN:0-89791-419-8

Authors

Erik Crank	Department of Computer Science, Rice University, Houston, TX
Matthias Felleisen	Department of Computer Science, Rice University, Houston, TX

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 25, Citation Count: 9

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/99583.99616 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	BAR.ENDREGT, H.P. The Lambda Calculus: Its Syntax and Semantics. Revised Edition. Studies in Logic and the Foundations of Mathematics 103. North-Holland, Amsterdam, 1984.
	2	CARTWRIGHT, R. AND D. OPPEN. The logic of aliasing. Acta Inf. 15, 1981, 365-384.
	3	Alonzo Church, The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies), Princeton University Press, Princeton, NJ, 1985
	4	CRANK, E. Parameter-passing and the lambdacalculus. Master's Thesis, Rice University, August 1990.
	5	Alan Demers , James Donahue, Making variables abstract: an equational theory for Russell, Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.59-72, January 24-26, 1983, Austin, Texas [doi>10.1145/567067.567075]
	6	James Edward Donahue, Complementary Definitions of Programming Language Semantics, Springer-Verlag New York, Inc., Secaucus, NJ, 1976
	7	R. Kent Dybvig, The SCHEME programming language, Prentice-Hall, Inc., Upper Saddle River, NJ, 1987
	8	M. Felleisen, On the expressive power of programming languages, Proceedings of the third European symposium on programming on ESOP '90, p.134-151, May 1990, Copenhagen, Denmark
	9	M. Felleisen , D. P. Friedman, A syntactic theory of sequential state, Theoretical Computer Science, v.69 n.3, p.243-287, Dec. 18, 1989 [doi>10.1016/0304-3975(89)90069-8]
	10	FELLEISEN, M. AND R. HIEB. The revised report on the syntactic theories of sequential control and state. Technical Report 100, Rice University, June 1989.
	11	Michael J. C. Gordon, The Denotational Description of Programming Languages: An Introduction, Springer-Verlag New York, Inc., Secaucus, NJ, 1979
	12	David Gries , Gary Levin, Assignment and Procedure Call Proof Rules, ACM Transactions on Programming Languages and Systems (TOPLAS), v.2 n.4, p.564-579, Oct. 1980 [doi>10.1145/357114.357119]
	13	C. A. R. Hoare, An axiomatic basis for computer programming, Communications of the ACM, v.12 n.10, p.576-580, Oct. 1969 [doi>10.1145/363235.363259]
	14	HOARE, C.A.R. Procedures and parameters: An axiomatic approach. In Symposium on Semantics of Algorithmic Languages, E. Engeler (Ed.). Lecture Notes in Mathematics 188. Springer-Verlag, Berlin, 1971, 102-116.
	15	P. J. Landin, The next 700 programming languages, Communications of the ACM, v.9 n.3, p.157-166, March 1966 [doi>10.1145/365230.365257]
	16	I. Mason , C. Talcott, A sound and complete axiomatization of operational equivalence of programs with memory, Proceedings of the Fourth Annual Symposium on Logic in computer science, p.284-293, June 1989, Pacific Grove, California, United States
	17	MULLER., R. The operational semantics and equational logic of eval and fexprs. Unpublished manuscript. Harvard University, 1990.
	18	J. W. Backus , F. L. Bauer , J. Green , C. Katz , J. McCarthy , A. J. Perlis , H. Rutishauser , K. Samelson , B. Vauquois , J. H. Wegstein , A. van Wijngaarden , M. Woodger , P. Naur, Revised report on the algorithm language ALGOL 60, Communications of the ACM, v.6 n.1, p.1-17, Jan. 1963 [doi>10.1145/366193.366201]
	19	OLDEROG, E. Sound and complete Hoare-like calculi based on copy rules. Acta Inf. 16, 1981, 161-197.
	20	PLOTKIN, G.D. Call-by-name, call-by-value, and the A-calculus. Theor. Comput. Sci. 1, 1975, 125-159.
	21	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]
	22	David A. Schmidt, Denotational semantics: a methodology for language development, William C. Brown Publishers, Dubuque, IA, 1986
	23	US DEPARTMENT OF DEFENSE. The Programming Language Ada--Reference Manual, Lecture Notes in Computer Science 106, Springer-Verlag, 1981.
	24	Niklaus Wirth , C. A. R. Hoare, A contribution to the development of ALGOL, Communications of the ACM, v.9 n.6, p.413-432, June 1966 [doi>10.1145/365696.365702]

CITED BY 9

	Zena M. Ariola , Amr Sabry, Correctness of monadic state: an imperative call-by-need calculus, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.62-74, January 19-21, 1998, San Diego, California, United States
	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
	Jawahar Chirimar , Carl A. Gunter , Jon G. Riecke, Proving memory management invariants for a language based on linear logic, ACM SIGPLAN Lisp Pointers, v.V n.1, p.139-150, Jan. 1992
	Martin Odersky , Dan Rabin , Paul Hudak, Call by name, assignment, and the lambda calculus, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.43-56, March 1993, Charleston, South Carolina, United States
	Martin Odersky, Programming with variable functions, ACM SIGPLAN Notices, v.34 n.1, p.105-116, Jan. 1999
	Stephen Weeks , Matthias Felleisen, On the orthogonality of assignments and procedures in Algol, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.57-70, March 1993, Charleston, South Carolina, United States
	Zena M. Ariola , John Maraist , Martin Odersky , Matthias Felleisen , Philip Wadler, A call-by-need lambda calculus, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.233-246, January 23-25, 1995, San Francisco, California, United States
	John Launchbury , Amr Sabry, Monadic state: axiomatization and type safety, ACM SIGPLAN Notices, v.32 n.8, p.227-238, Aug. 1997
	Zena M. Ariola , Matthias Felleisen, The call-by-need lambda calculus, Journal of Functional Programming, v.7 n.3, p.265-301, May 1997