Static name control for FreshML

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2007, Pages 356-365

  Pottier, François ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT SYNTAX TREES; AUTOMATIC DECISION PROCEDURES; FRESH NAMES; NON-TRIVIAL; PROOF SYSTEM; SIDE EFFECT;

SPECIFICATION LANGUAGES; SYNTACTICS; TREES (MATHEMATICS);

COMPUTATION THEORY;

EID: 82755188155     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2007.44     Document Type: Conference Paper

References (17)

1. C. Calcagno, E. Moggi, and T. Sheard. Closed types for a safe imperative MetaML. Journal of Functional Programming, 13(3):545-571, May 2003. (Pubitemid 36601126)
2. K. Donnelly and H. Xi. Combining higher-order abstract syntax with first-order abstract syntax in ATS. In ACM Workshop on Mechanized Reasoning about Languages with Variable Binding, pages 58-63, 2005. (Pubitemid 43196480)
3. C. Flanagan, A. Sabry, B. F. Duba, and M. Felleisen. The essence of compiling with continuations. In ACM Conference on Programming Language Design and Implementation (PLDI), pages 237-247, 1993.
4. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13(3-5):341-363, July 2002. (Pubitemid 41204157)
5. K. Marriott and M. Odersky. Negative Boolean constraints. Technical Report 94/203, Monash University, Aug. 1994.
6. A. Nanevski. Meta-programming with names and necessity. Technical Report CMU-CS-02-123R, School of Computer Science, Carnegie Mellon University, Nov. 2002.
7. Pašalić and N. Linger. Meta-programming with typed object-language representations. In International Conference on Generative Programming and Component Engineering (GPCE), pages 136-167, Oct. 2004. (Pubitemid 39745353)
8. A. M. Pitts. Alpha-structural recursion and induction. Journal of the ACM, 53:459-506, 2006. (Pubitemid 44191879)
9. A. M. Pitts and M. J. Gabbay. A metalanguage for programming with bound names modulo renaming. In International Conference on Mathematics of Program Construction (MPC), volume 1837 of Lecture Notes in Computer Science, pages 230-255. Springer Verlag, 2000.
10. F. Pottier. An overview of Caml. In ACM Workshop on ML, volume 148(2) of Electronic Notes in Theoretical Computer Science, pages 27-52, Mar. 2006.
11. F. Pottier. Prototype implementation of Pure FreshML, Jan. 2007.
12. F. Pottier. Static name control for FreshML, full version, Jan. 2007.
13. C. Schürmann, A. Poswolsky, and J. Sarnat. The ▽-calculus: Functional programming with higher-order encodings. Technical Report YALEU/DCS/TR-1272, Yale University, Nov. 2004.
14. T. Sheard. Using MetaML: A staged programming language. In Advanced Functional Programming, volume 1608 of Lecture Notes in Computer Science, pages 207-239. Springer Verlag, Sept. 1998.
15. M. R. Shinwell and A. M. Pitts. On a monadic semantics for freshness. Theoretical Computer Science, 342:28-55, 2005. (Pubitemid 41162454)
16. M. R. Shinwell, A. M. Pitts, and M. J. Gabbay. FreshML: Programming with binders made simple. In ACM International Conference on Functional Programming (ICFP), pages 263-274, Aug. 2003.
17. W. Taha and M. F. Nielsen. Environment classifiers. In ACM Symposium on Principles of Programming Languages (POPL), pages 26-37, Jan. 2003.