FreshML: Programming with Binders Made Simple

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

Volumn 8, Issue , 2003, Pages 263-274

  Shinwell, Mark R ^a   Pitts, Andrew M ^a   Gabbay, Murdoch J ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Alpha conversion; Metaprogramming; Variable binding

Indexed keywords

ALGEBRA; INFORMATION ANALYSIS; MATHEMATICAL MODELS; PROBLEM SOLVING; RECURSIVE FUNCTIONS; SEMANTICS; TREES (MATHEMATICS);

METAPROGRAMMING; OPERATIONAL SEMANTICS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 1142275468     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. S. Abramsky and A. Jung. Domain theory. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, Volume 3. Semantic Structures, chapter 1. Oxford University Press, 1994.
2. M. S. Ager, D. Biernacki, O. Danvy, and J. Midtgaard. From interpreter to compiler and virtual machine: A functional derivation. Technical Report BRICS RS-03-14, BRICS, Department of Computer Science, University of Aarhus, March 2003.
3. H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, revised edition, 1984.
4. G. Barthe. Type-checking injective pure type systems. Journal of Functional Programming, 9(6):675-698, 1999.
5. L. Caires and L. Cardelli. A spatial logic for concurrency (part II). In CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002. Proceedings, volume 2421 of Lecture Notes in Computer Science, pages 209-225. Springer-Verlag, Berlin, 2002.
6. L. Cardelli, P. Gardner, and G. Ghelli. Manipulating trees with hidden labels. In Foundations of Software Science and Computation Structures, 6th International Conference, FOSSACS 2003, Warsaw, Poland. Proceedings, volume 2620 of Lecture Notes in Computer Science, pages 216-232. Springer-Verlag, Berlin, 2003.
7. K. Claessen and D. Sands. Observable sharing for functional circuit description. In Advances in Computing Science ASIAN'99, 5th Asian Computing Science Conference, volume 1742 of Lecture Notes in Computer Science, pages 62-73. Springer-Verlag, 1999.
8. N. G. de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indag. Math., 34:381-392, 1972.
9. M. P. Fiore, E. Moggi, and D. Sangiorgi. A fully abstract model for the π-calculus (extended abstract). In Eleventh Annual Symposium on Logic in Computer Science, pages 43-54. IEEE Computer Society Press, Washington, 1996.
10. M. J. Gabbay. A Theory of Inductive Definitions with α-Equivalence: Semantics, Implementation, Programming Language. PhD thesis, University of Cambridge, 2000.
11. M. J. Gabbay. The π-calculus in FM. Submitted, September 2002.
12. M. J. Gabbay. FM for process calculi that generate fresh names. Submitted, June 2003.
13. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13:341-363, 2002.
14. F. Honsell, M. Miculan, and I. Scagnetto. An axiomatic approach to metareasoning on nominal algebras in HOAS. In 28th International Colloquium on Automata, Languages and Programming, ICALP 2001, Crete, Greece, July 2001. Proceedings, volume 2076 of Lecture Notes in Computer Science, pages 963-978. Springer-Verlag, Heidelberg, 2001.
15. R. Laemmel and S. L. Peyton Jones. Scrap your boilerplate: A practical approach to generic programming. In ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI 2003), New Orleans, pages 26-37. ACM Press, 2003.
16. D. A. Miller. An extension to ML to handle bound variables in data structures: Preliminary report. In Proceedings of the Logical Frameworks BRA Workshop, 1990.
17. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes (parts I and II). Information and Computation, 100:1-77, 1992.
18. R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). MIT Press, 1997.
19. E. Moggi. Notions of computation and monads. Information and Computation, 93(1):55-92, 1991.
20. A. Nanevski. Meta-programming with names and necessity. In Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming, ICFP 2002, Pittsburgh, Pennsylvania, pages 206-217. ACM Press, New York, 2002.
21. M. Odersky. A functional theory of local names. In Conference Record of the 21st Annual ACM Symposium on Principles of Programming Languages, pages 48-59. ACM Press, 1994.
22. F. Pfenning and C. Elliott. Higher-order abstract syntax. In Proc. ACM-SIGPLAN Conference on Programming Language Design and Implementation, pages 199-208. ACM Press, 1988.
23. A. M. Pitts. Relational properties of domains. Information and Computation, 127:66-90, 1996.
24. A. M. Pitts. Nominal logic, a first order theory of names and binding. Information and Computation, to appear. (A preliminary version appeared in the Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software (TACS 2001), LNCS 2215, Springer-Verlag, 2001, pp 219-242.).
25. A. M. Pitts and M. J. Gabbay. A metalanguage for programming with bound names modulo renaming. In Mathematics of Program Construction. 5th International Conference, MPC2000, Ponte de Lima, Portugal, July 2000. Proceedings, volume 1837 of Lecture Notes in Computer Science, pages 230-255. Springer-Verlag, Heidelberg, 2000.
26. A. M. Pitts and I. D. B. Stark. Observable properties of higher order functions that dynamically create local names, or: What's new? In Mathematical Foundations of Computer Science, Proc. 18th Int. Symp., Gdańsk, 1993, volume 711 of Lecture Notes in Computer Science, pages 122-141. Springer-Verlag, Berlin, 1993.
27. T. Sheard. Accomplishments and research challenges in meta-programming. In Semantics, Applications, and Implementation of Program Generation, Second International Workshop, SAIG 2001, Florence, Italy, September 6, 2001, Proceedings., volume 2196 of Lecture Notes in Computer Science, pages 2-44. Springer, 2001.
28. M. R. Shinwell. Swapping the atom: Programming with binders in Fresh O'Caml. Submitted, June 2003.
29. M. R. Shinwell and A. M. Pitts. FreshML User Manual. Cambridge University Computer Laboratory, November 2002. Available at 〈http://www.freshml.org/docs/〉.
30. I. D. B. Stark. Categorical models for local names. Lisp and Symbolic Computation, 9(1):77-107, 1996.
31. I. D. B. Stark. A fully abstract domain model for the π-calculus. In 11th Annual Symposium on Logic in Computer Science, pages 36-42. IEEE Computer Society Press, Washington, 1996.
32. C. Urban, A. M. Pitts, and M. J. Gabbay. Nominal unification. In Computer Science Logic and 8th Kurt Gödel Colloquium (CSL'03 & KGC), Vienna, Austria. Proceedings, Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2003.