Toward a general theory of names, binding and scope

MERLIN'05 - Proceedings of the Third ACM SIGPLAN Workshop in Mechanized Reasoning about Languages with varIable biNding

Volumn , Issue , 2005, Pages 33-40

  Cheney, James ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Abstract syntax; Names; Nominal logic; Scope

Indexed keywords

AUTOMATA THEORY; LOGIC PROGRAMMING; SYNTACTICS; XML;

ABSTRACT SYNTAX; NAMES; NOMINAL LOGIC; SCOPE;

FORMAL LOGIC;

EID: 32044448094     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1088454.1088459     Document Type: Conference Paper

References (29)

1. Tim Bray, Jean Paoli, C. M. Sperberg-McQueen, and Eve Maler. Extensible Markup Language (XML) 1.0 (Second Edition). W3C Recommendation, October 2000. http://www.w3.org/TR/-2000/REC-xml-20001006.
2. J. Cheney and C. Urban. Alpha-Prolog: A logic programming language with names, binding and alpha-equivalence. In Proc. 20th Int. Conf. on Logic Programming (ICLP 2004), number 3132 in LNCS, pages 269-283, 2004.
3. James Cheney. Scrap your nameplate (functional pearl). In Benjamin Pierce, editor, Proceedings of the 10th International Conference on Functional Programming (ICFP 2005), Tallinn, Estonia, 2005. To appear.
4. James Cheney. A simpler proof theory for nominal logic. In Proceedings of the 2005 Conference on Foundations of Software Science and Computation Structures (FOSSACS 2005), number 3441 in LNCS, pages 379-394. Springer-Verlag, 2005.
5. Horatiu Cirstea, Luigi Liquori, and Benjamin Wack. Rewriting calculus with fixpoints: Untyped and first-order systems. In Post-procededings of TYPES, 2003.
6. William F. Clocksin and Christopher S. Mellish. Programming in Prolog. Springer-Verlag, fifth edition, 2003.
7. N. G. de Bruijn. Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation. Indagationes Mathematicae, 34(5):381-392, 1972.
8. Joëlle Despeyroux, Amy Felty, and André Hirschowitz. Higher-order abstract syntax in Coq. In M. Dezani-Ciancaglini and G. Plotkin, editors, Proc. Int. Conf. on Typed Lambda Calculi and Applications, pages 124-138, Edinburgh, Scotland, 1995. Springer-Verlag LNCS 902.
9. M. J. Gabbay and J. Cheney. A sequent calculus for nominal logic. In Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004), pages 139-148, Turku, Finland, 2004.
10. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13:341-363, 2002.
11. Furio Honsell, Marino Miculan, and Ivan Scagnetto. The theory of contexts for first order and higher order abstract syntax. In TOSCA 2001 - Theory of Concurrency, Higher Order Languages and Types, volume 62 of Electronic Notes on Theoretical Computer Science, 2001.
12. John E. Hopcroft and Jeffrey D. Ullmann. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
13. Dale Miller. The pi-calculus as a theory in linear logic: Preliminary results. In E. Lamma and P. Mello, editors, Proceedings of the 1992 Workshop on Extensions to Logic Programming, number 660 in LNCS, pages 242-265. Springer-Verlag, 1992.
14. Dale Miller. Abstract syntax for variable binders: an overview. In John Lloyd et al., editor, Computational Logic - CL 2000, number 186 lin LNAI. Springer, 2000.
15. Dale Miller. Encoding generic judgments: Preliminary results. In S.J. Ambler, R.L. Crole, and A. Momigliano, editors, MERLIN 2001: Mechanized Reasoning about Languages with Variable Binding, volume 58(1) of Electronic Notes in Theoretical Computer Science. Elsevier, 2001.
16. Dale Miller and Alwen Tiu. A proof theory for generic judgments: extended abstract. In Proc. 18th Symp. on Logic in Computer Science (LICS 2003), pages 118-127. IEEE Press, 2003.
17. Robin Milner, Mads Tofte, Robert Harper, and David MacQueen. The Definition of Standard ML - Revised. MIT Press, 1997.
18. A. Momigliano and Simon Ambler. Multi-level meta-reasoning with higher order abstract syntax. In FOSSACS 2003, pages 375-391. Springer-Verlag, 2003.
19. P. O'Hearn and D. J. Pym. The logic of bunched implications. Bulletin of Symbolic Logic, 5(2):215-244, June 1999.
20. Frank Pfenning and Conal Elliott. Higher-order abstract syntax. In Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI'89), pages 199-208. ACM Press, 1989.
21. A. M. Pitts. Nominal logic, a first order theory of names and binding. Information and Computation, 183:165-193, 2003.
22. François Pottier. An overview of Caml, June 2005. Available at http://cristal.inria.fr/~fpottier/publis/fpottier-alphacaml.pdf.
23. John C. Reynolds. Separation Logic: A Logic for Shared Mutable Data Structures. In Proc. IEEE Symposium on Logic in Computer Science, pages 55-74, Los Alamitos, CA, USA, July 22-25 2002. IEEE Computer Society.
24. Ulrich Schöpp and Ian Stark. A dependent type theory with names and binding. In Proceedings of the 2004 Computer Science Logic Conference, number 3210 in Lecture notes in Computer Science, pages 235-249, Karpacz, Poland, 2004.
25. M. R. Shinwell, A. M. Pitts, and M. J. Gabbay. FreshML: Programmming with binders made simple. In Proc. 8th ACM SIGPLAN Int. Conf. on Functional Programming (ICFP 2003), pages 263-274, Uppsala, Sweden, 2003. ACM Press.
26. M.R. Shinwell and A.M. Pitts. Fresh objective caml user manual. Technical Report 621, Cambridge University Computer Laboratory, February 2005.
27. Alwen Tiu and Dale Miller. A proof search specification of the π-calculus. In Proceedings of the 3rd EATCS Workshop in the Foundations of Global Computing (FGUC 2004), 2004. To appear in ENTCS.
28. C. Urban, A. M. Pitts, and M. J. Gabbay. Nominal unification. Theoretical Computer Science, 323(1-3):473-497, 2004.
29. J. B. Wells and R. Vestergaard. Equational reasoning for linking with first-class primitive modules. In Proceedings of the 2000 European Symposium on Programming, number 1782 in LNCS. Springer-Verlag, 2000.