A confluent calculus of Macro expansion and evaluation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A confluent calculus of Macro expansion and evaluation

Full text

Pdf (802 KB)

Source

Conference on LISP and Functional Programming archive
Proceedings of the 1992 ACM conference on LISP and functional programming table of contents

San Francisco, California, United States

Pages: 278 - 287

Year of Publication: 1992

ISBN:0-89791-481-3

Also published in ...

Authors

Ana Bove
Laura Arbilla

Sponsors

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

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

abstract 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/141471.141562 What is a DOI?

ABSTRACT

Syntactic abbreviations or macros provide a powerful tool to increase the syntactic expressiveness of programming languages. The expansion of these abbreviations can be modeled with substitutions. This paper presents an operational semantics of macro expansions and evaluation where substitutions are handled explicitly. The semantics is defined in terms of a confluent, simple, and intuitive set of rewriting rules. The resulting semantics is also a basis for developing correct implementations.

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	M. Abadi, L. Cardelli, P.L. Curien, and J.J. L~vy. Explicit Substitutions. Technical Report SRC 54, Digital Equipment Corporation, Palo Alto, California, 1990.
	3	H. Barendregt. The Lambda Calculus, Its Syntax and Semantics. North-Holland, Amsterdam, 1981.
	4	A. Bore and L. Arbilla. A Confluent calculus of macro expansion and evaluation. Technical Report INCO-91-01, Instituto de Computaci6n, Universidad de la Repfiblica, Montevideo, Uruguay, 1991.
	5	N. De Bruijn. Lambda-calculus Notation with Nameless Dummies, a Tool for Automatic Formula Manipulation. Indag. Mat., 34:381-392, 1972.
	6	William Clinger , Jonathan Rees, Macros that work, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.155-162, January 21-23, 1991, Orlando, Florida, United States [doi>10.1145/99583.99607]
	7	R. Kent Dybvig , Daniel P. Friedman , Christopher T. Haynes, Expansion-passing style: beyond conventional macros, Proceedings of the 1986 ACM conference on LISP and functional programming, p.143-150, August 1986, Cambridge, Massachusetts, United States [doi>10.1145/319838.319858]
	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	T. Griffin. Notational definition - A formal account. In Proc. Syrup. Logic in Computer Science, pages 372-383, 1988.
	10	T. G. Griffin, Notational definition and top-down refinement for interactive proof development systems, Cornell University, Ithaca, NY, 1989
	11	T. Hardin and J.J. L6vy. A Confluent Calculus of Substitutions. In Japan Artificial Intelligence and Computer Science Symposium, Izu, December 1989.
	12	J. Roger Hindley , Jonathan P. Seldin, Introduction to combinators and &lgr;-calculus, Cambridge University Press, New York, NY, 1986
	13	Gérard Huet, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems, Journal of the ACM (JACM), v.27 n.4, p.797-821, Oct. 1980 [doi>10.1145/322217.322230]
	14	G. Huet and D. C. Oppen. Equations and Rewrite Rules: A Survey. In R. V. Book, editor, Formal Language Theory: Perspectives and Open Problems. Academic Press, 1980.
	15	B. W. Kernighan , D. M. Ritchie, The C programming language, Prentice-Hall, Inc., Upper Saddle River, NJ, 1978
	16	E E Kohlbecker, Syntactic extensions in the programming language LISP, Indiana University, Bloomington, IN, 1986
	17	Eugene Kohlbecker , Daniel P. Friedman , Matthias Felleisen , Bruce Duba, Hygienic macro expansion, Proceedings of the 1986 ACM conference on LISP and functional programming, p.151-161, August 1986, Cambridge, Massachusetts, United States [doi>10.1145/319838.319859]
	18	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 [doi>10.1145/41625.41632]
	19	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]
	20	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]