A multi-stage language with intensional analysis

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A multi-stage language with intensional analysis

Full text

Pdf (195 KB)

Source

Generative Programming And Component Engineering archive
Proceedings of the 5th international conference on Generative programming and component engineering table of contents

Portland, Oregon, USA

SESSION: Staging table of contents

Pages: 11 - 20

Year of Publication: 2006

ISBN:1-59593-237-2

Authors

Marcos Viera	Universidad de la República, Montevideo, Uruguay
Alberto Pardo	Universidad de la República, Montevideo, Uruguay

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages
ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

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

ABSTRACT

This paper presents the definition of a language with reflection primitives. The language is a homogeneous multi-stage language that provides the capacity of code analysis by the inclusion of a pattern matching mechanism that permits inspection of the structure of quoted expressions and their destruction into component subparts. Quoted expressions include an explicit annotation of their context which is used for dynamic inference of type, where a dynamic typing discipline based on Hinze and Cheney's approach is used for typing quoted expressions.This paper follows the approach of Sheard and Pasalic about the use of the meta-language Ωmega as a tool for language design. In this sense, it is shown how to represent the syntax, the static as well as the dynamic semantics of the proposed language in terms of Ωmega constructs.

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	H. P. Barendregt, Lambda calculi with types, Handbook of logic in computer science (vol. 2): background: computational structures, Oxford University Press, Inc., New York, NY, 1993
	2	Arthur I. Baars , S. Doaitse Swierstra, Typing dynamic typing, Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, p.157-166, October 04-06, 2002, Pittsburgh, PA, USA
	3	Zine-El-Abidine Benaissa, Daniel Briaud, Pierre Lescanne, and Jocelyne Rouyer-Degli. λν, a calculus of explicit substitutions which preserves strong normalisation. Journal of Functional Programming, 6(5):699--722, 1996.
	4	Cristiano Calcagno, Eugenio Moggi, and Walid Taha. ML-like inference for classifiers. In David A. Schmidt, editor, Programming Languages and Systems, 13th European Symposium on Programming, ESOP 2004, volume 2986 of Lecture Notes in Computer Science, pages 79--93. Springer, 2004.
	5	James Cheney , Ralf Hinze, A lightweight implementation of generics and dynamics, Proceedings of the 2002 ACM SIGPLAN workshop on Haskell, p.90-104, October 03, 2002, Pittsburgh, Pennsylvania [doi>10.1145/581690.581698]
	6	N. G. de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation. Indagationes Mathematicae, 34:381--392, 1972.
	7	Daniel P. Friedman , Mitchell Wand, Reification: Reflection without metaphysics, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.348-355, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802051]
	8	Jim Grundy, Tom Melham, and John O'Leary. A reflective functional language for hardware design and theorem proving. Technical Report PRG-RR-03-16, Programming Research Group, Oxford University Computing Laboratory, October 2003.
	9	Sava Krstić , John Matthews, Semantics of the reFL^ect language, Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming, p.32-42, August 24-26, 2004, Verona, Italy [doi>10.1145/1013963.1013971]
	10	Eugenio Moggi , Walid Taha , Zine-El-Abidine Benaissa , Tim Sheard, An Idealized MetaML: Simpler, and More Expressive, Proceedings of the 8th European Symposium on Programming Languages and Systems, p.193-207, March 22-28, 1999
	11	Aleksandar Nanevski, Meta-programming with names and necessity, Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, p.206-217, October 04-06, 2002, Pittsburgh, PA, USA
	12	Aleksandar Nanevski , Frank Pfenning, Functional programming with names and necessity, 2004
	13	Aleksandar Nanevski , Frank Pfenning, Staged computation with names and necessity, Journal of Functional Programming, v.15 n.6, p.893-939, November 2005 [doi>10.1017/S095679680500568X]
	14	Emir Pasalic , Timothy E. Sheard, The role of type equality in meta-programming, OGI School of Science & Engineering, 2004
	15	Emir Pasalic and Nathan Linger. Meta-programming with typed object-language representations. In Generative Programming and Component Engineering: Third International Conference, GPCE 2004, pages 136--167. Springer, 2004.
	16	T. Sheard, Z. Benaissa, and M. Martel. Introduction to Multistage Programming Using MetaML. Pacific Software Research Center, Oregon Graduate Institute, 2 edition, 2000.
	17	Tim Sheard, Accomplishments and Research Challenges in Meta-programming, Proceedings of the Second International Workshop on Semantics, Applications, and Implementation of Program Generation, p.2-44, September 06, 2001
	18	Tim Sheard. Playing with type systems. Presented at GPCE 05 MetaOCaml Workshop, 2005.
	19	Tim Sheard, Putting curry-howard to work, Proceedings of the 2005 ACM SIGPLAN workshop on Haskell, p.74-85, September 30-30, 2005, Tallinn, Estonia [doi>10.1145/1088348.1088356]
	20	Tim Sheard , Simon Peyton Jones, Template meta-programming for Haskell, Proceedings of the 2002 ACM SIGPLAN workshop on Haskell, p.1-16, October 03, 2002, Pittsburgh, Pennsylvania [doi>10.1145/581690.581691]
	21	Tim Sheard and Emir Pasalic. Meta-programming with built-in type equality. In Workshop on Logical Frameworks and Meta-Languages (LFM'04), pages 106--124, jul 2004.
	22	Mark Shields , Tim Sheard , Simon Peyton Jones, Dynamic typing as staged type inference, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.289-302, January 19-21, 1998, San Diego, California, United States [doi>10.1145/268946.268970]
	23	Walid Mohamed Taha , Tim Sheard, Multistage programming: its theory and applications, 1999
	24	Walid Taha, A sound reduction semantics for untyped CBN mutli-stage computation. Or, the theory of MetaML is non-trival (extended abstract), Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation, p.34-43, January 22-23, 2000, Boston, Massachusetts, United States
	25	Walid Taha. A gentle introduction to multi-stage programming. In Domain-Specific Program Generation, pages 30--50, 2003.
	26	Walid Taha , Michael Florentin Nielsen, Environment classifiers, Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.26-37, January 15-17, 2003, New Orleans, Louisiana, USA
	27	Walid Taha , Tim Sheard, MetaML and multi-stage programming with explicit annotations, Theoretical Computer Science, v.248 n.1-2, p.211-242, October 2000 [doi>10.1016/S0304-3975(00)00053-0]