Staged notational definitions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2830, Issue , 2003, Pages 97-116

  Taha, Walid ^a   Johann, Patricia ^b  

^a Rice University   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; SEMANTICS;

BOUND VARIABLES; EQUATIONAL REASONING; EQUATIONAL THEORY; MACRO LANGUAGES; MULTI STAGE; RENAMING PROBLEM; TYPE SYSTEMS; TYPECHECKING;

CALCULATIONS;

EID: 35248898281     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39815-8_6     Document Type: Article

References (19)

1. BARENDREGT, H. P. The Lambda Calculus: Its Syntax and Semantics, revised ed. North-Holland, Amsterdam, 1984.
2. BENAISSA, Z. E.-A., MOGGI, E., TAHA, W., AND SHEARD, T. Logical modalities and multi-stage programming. In Federated Logic Conference Satellite Workshop on Intuitionistic Modal Logics and Applications (1999).
3. CARDELLI, L. Phase distinctions in type theory. (Unpublished manuscript.) Available online from http://www.luca.demon.co.uk/Bibliography.html, 1988.
4. DAVIES, R. A temporal-logic approach to binding-time analysis. In Symposium on Logic in Computer Science (1996), IEEE Computer Society Press, pp. 184-195.
5. FILINSKI, A. A semantic account of type-directed partial evaluation. In Principles and Practice of Declarative Programming (1999), vol. 1702 of LNCS, pp. 378-395.
6. FILINSKI, A. Normalization by evaluation for the computational lambda-calculus. In Typed Lambda Calculi and Applications: 5th International Conference (2001), vol. 2044 of LNCS, pp. 151-165.
7. GANZ, S., SABRY, A., AND TAHA, W. Macros as multi-stage computations: Type-safe, generative, binding macros in MacroML. In International Conference on Functional Programming (2001), ACM.
8. GRIFFIN, T. G. Notational definitions - a formal account. In Proceedings of the Third Symposium on Logic in Computer Science (1988).
9. MICHAYLOV, S., AND PFENNING, F. Natural semantics and some of its meta-theory in Elf. In Extensions of Logic Programming (1992), L. Hallnäs, Ed., LNCS.
10. MOGGI, E. Functor categories and two-level languages. In Foundations of Software Science and Computation Structures (1998), vol. 1378 of LNCS.
11. MOGGI, E. A monadic multi-stage metalanguage. In Foundations of Software Science and Computation Structures (2003), vol. 2620 of LNCS.
12. MOGGI, E., TAHA, W., BENAISSA, Z. E.-A., AND SHEARD, T. An idealized MetaML: Simpler, and more expressive. In European Symposium on Programming (1999), vol. 1576 of LNCS, pp. 193-207.
13. Oregon Graduate Institute Technical Reports. P.O. Box 91000, Portland, OR 97291-1000,USA. Available online from ftp://cse.ogi.edu/pub/tech-reports/README.html.
14. SHEARD, T., AND PEYTON-JONES, S. Template meta-programming for Haskell. In Proc. of the Workshop on Haskell (2002), ACM, pp. 1-16.
15. STEELE, JR., G. L., AND GABRIEL, R. P. The evolution of LISP. In Proceedings of the Conference on History of Programming Languages (1993), R. L. Wexelblat, Ed., vol. 28(3) of ACM Sigplan Notices, ACM Press, pp. 231-270.
16. TAHA, W. Multi-Stage Programming: Its Theory and Applications. PhD thesis, Oregon Graduate Institute of Science and Technology, 1999. Available from [13].
17. TAHA, W. A sound reduction semantics for untyped CBN multi-stage computation. Or, the theory of MetaML is non-trivial. In Proceedings of the Workshop on Partial Evaluation and Semantics-Based Program Maniplation (2000), ACM Press.
18. TAHA, W., BENAISSA, Z.-E.-A., AND SHEARD, T. Multi-stage programming: Axiomatization and type-safety. In 25th International Colloquium on Automata, Languages, and Programming (1998), vol. 1443 of LNCS, pp. 918-929.
19. TAHA, W., AND NIELSEN, M. F. Environment classifiers. In The Symposium on Principles of Programming Languages (POPL '03) (New Orleans, 2003).