Optimal reduction in weak-&lgr;-calculus with shared environments

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Optimal reduction in weak-&lgr;-calculus with shared environments

Full text

Pdf (942 KB)

Source

Functional Programming Languages and Computer Architecture archive
Proceedings of the conference on Functional programming languages and computer architecture table of contents

Copenhagen, Denmark

Pages: 243 - 252

Year of Publication: 1993

ISBN:0-89791-595-X

Author

Nobuko Yoshida

Sponsors

SIGARCH: ACM Special Interest Group on Computer Architecture
IFIP WG 2.8 : IFIP WG 2.8
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 15, Citation Count: 8

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/165180.165217 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	M. Abadi , P. L. Curien , J. J. Levy, Explicit substitutions, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.31-46, December 1989, San Francisco, California, United States [doi>10.1145/96709.96712]
	2	H. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North Holland, 1984.
	3	H P Barendregt , M C J D Eekelen , J R W Glauert , J R Kennaway , M J Plasmeijer , M R Sleep, Term graph rewriting, Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe, p.141-158, March 1987, Eindhoven, The Netherlands
	4	John Field, On laziness and optimality in lambda interpreters: tools for specification and analysis, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.1-15, December 1989, San Francisco, California, United States [doi>10.1145/96709.96710]
	5	G. S. Frandsen and C. Sturtivant. What is an efficient implimentation of the )~-calculus? FPCA, 1993.
	6	John Lamping, An algorithm for optimal lambda calculus reduction, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.16-30, December 1989, San Francisco, California, United States [doi>10.1145/96709.96711]
	7	J.-J. L~vy. Optimal reductions in the lambda-calculus. To H.B.C~rry: Essays on Combinatory Logic, Lambda Calculus and Formalism. Academic Press, 1980.
	8	Luc Maranget, Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.255-269, January 21-23, 1991, Orlando, Florida, United States [doi>10.1145/99583.99618]
	9	R. Milner. Function as processes. Rapports de Recherche, INRIA-Sopkia Antipolis, 1154, 1990.
	10	C-H.L. Ong. The lazy lambda calculus: an investigation into the foundation of functional programming. Pkd thesis in Imperial College, May 31 1988.
	11	Masako Takahashi, Parallel reductions in &lgr;-calculus, Journal of Symbolic Computation, v.7 n.2, p.113-123, Feb. 1989 [doi>10.1016/S0747-7171(89)80045-8]
	12	N. Yoshida. Optimal Reduction in Weak. A.calculus with Shared Environments, Technical Reprot 93/001 of Compurer Science at Keio University, April 1993.

CITED BY 8

	Joachim Niehren, Functional computation as concurrent computation, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.333-343, January 21-24, 1996, St. Petersburg Beach, Florida, United States
	Arne Kutzner , Manfred Schmidt-Schauß, A non-deterministic call-by-need lambda calculus, ACM SIGPLAN Notices, v.34 n.1, p.324-335, Jan. 1999
	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
	Andrew Moran , David Sands, Improvement in a lazy context: an operational theory for call-by-need, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.43-56, January 20-22, 1999, San Antonio, Texas, United States
	Davide Sangiorgi, From λ to π; or, Rediscovering continuations, Mathematical Structures in Computer Science, v.9 n.4, p.367-401, August 1999
	Zena M. Ariola , Matthias Felleisen, The call-by-need lambda calculus, Journal of Functional Programming, v.7 n.3, p.265-301, May 1997
	John Maraist , Martin Odersky , Philip Wadler, The call-by-need lambda calculus, Journal of Functional Programming, v.8 n.3, p.275-317, May 1998
	Joachim Niehren, Uniform confluence in concurrent computation, Journal of Functional Programming, v.10 n.5, p.453-499, September 2000