Meta-programming with names and necessity

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2002, Pages 206-217

  Nanevski, Aleksandar ^a  

^a Carnegie Mellon University   (United States)

Author keywords

Higher order abstract syntax; Modal lambda calculus

Indexed keywords

CODES (SYMBOLS); MODAL ANALYSIS; OBJECT ORIENTED PROGRAMMING; PATTERN MATCHING; SEMANTICS;

META PROGRAMMING LANGUAGES; MODAL TYPE CONSTRUTOR;

LOGIC PROGRAMMING;

EID: 0036957923     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/581478.581498     Document Type: Conference Paper

References (24)

1. C. Calcagno, E. Moggi, and T. Sheard. Closed types for a safe imperative MetaML. Journal of Functional Programming, 2001, to appear.
2. R. Davies. A temporal logic approach to binding-time analysis. In E. Clarke, editor, Proceedings of the Eleventh Annual Symposium on Logic in Computer Science, pages 184-195. New Brunswick, New Jersey, July 1996. IEEE Computer Society Press.
3. R. Davies and F. Pfenning. A modal analysis of staged computation. In Conf. Record 23rd ACM SIGPLAN/SIGACT Symp. on Principles of Programming Languages, POPL '96, St. Petersburg Beach, FL, USA, 21-24 Jan 1996, pages 258-270. ACM Press, New York, 1996.
4. J. Despeyroux, F. Pfenning, and C. Schürmann. Primitive recursion for higher-order abstract syntax. In R. Hindley, editor. Proceedings of the Third International Conference on Typed Lambda Calculus and Applications (TLCA '97), pages 147-163, Nancy, France, Apr. 1997. Springer-Verlag LNCS. An extended version is available as Technical Report CMU-CS-96-172, Carnegie Mellon University.
5. M. Fitting and R. L. Mendelsohn. First-Order Modal Logic. Kluwer Academic Publishers, 1999.
6. M. J. Gabbay. A Theory of Inductive Definitions with α-Equivalence. PhD thesis, Cambridge University, August 2000.
7. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 2001. Special issue in honour of Rod Burstall. To appear.
8. A. Griewank. On Automatic Differentiation. In M Iri and K. Tanabe, editors. Mathematical Programming: Recent Developments and Applications, pages 83-108. Kluwer Academic Publishers, 1989.
9. S. A. Kripke. Naming and Necessity. Harvard University Press, 1980.
10. D. Miller. An extension to ML to handle bound variables in data structures. In Proceedings of the Logical Frameworks BRA Workshop, May 1990.
11. E. Moggi, W. Taha, Z.-E.-A. Benaissa, and T. Sheard. An idealized MetaML: Simpler, and more expressive. In European Symposium on Programming, pages 193-207, 1999.
12. A. Nanevski. Meta-programming with names and necessity. Technical Report CMU-CS-02-123, School of Computer Science, Carnegie Mellon University, April 2002.
13. M. F. Nielsen. Combining close and open code. Unpublished, 2001.
14. M. Odersky. A functional theory of local names. In Proceedings of 21st Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL), pages 48-59, New York, NY, USA, 1994, ACM Press.
15. F. Pfenning and R. Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511-540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
16. A. M. Pitts. Nominal logic: A first order theory of names and binding. In N. Kobayashi and B. C. Pierce, editors, TACS, pages 219-242, Springer, 2001.
17. A. M. Pitts and M. J. Gabbay. A metalanguage for programming with bound names modulo renaming. In R. Backhoue and J. N. Oliveira, editors, Mathematics of Program Construction, MPC2000, Proceedings, Ponte de Lima, Portugal, July 2000, Volume 1837 of Lecture Notes in Computer Science, pages 230-255. Springer-Verlag, Heidelberg, 2000.
18. N. Ramsey and A. Pfeffer. Stochastic lambda calculus and monads of probability distributions. In Conf. Record 29th ACM SIGPLAN/SIGACT Symp. on Principles of Programming Languages, POPL'02, Portland, OR, USA, pages 154-165, New York, 2002. ACM Press.
19. G. J. Rozas. Translucent procedures, abstraction without opacity. Technical Report AITR-1427, Massachusetts Institute of Technology Artificial Intelligence Laboratory, 1993.
20. T. Sheard. Accomplishments and research challenges in meta-programming. In W. Taha, editor, SAIG, Volume 2196 of Lecture Notes in Computer Science, pages 2-44. Springer, 2001.
21. W. Taha. A sound reduction semantics for untyped CBN multi-stage computation, or, the theory of MetaML is non-trival. ACM SIGPLAN Notices, 34(11):34-43, 1999.
22. W. Taha. Multi-Stage Programming: Its Theory and Applications. PhD thesis, Oregon Graduate Institute of Science and Technology, 1999.
23. P. Wickline, P. Lee, and F. Pfenning. Run-time code generation and Modal-ML. In SIGPLAN Conference on Programming Language Design and Implementation, pages 224-235, 1998.
24. P. Wickline, P. Lee, F. Pfenning, and R. Davies. Modal types as staging specifications for run-time code generation. ACM Computing Surveys, 30(3es), 1998.