αrolog: A logic programming language with names, binding and α-Equivalence

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

Volumn 3132, Issue , 2004, Pages 269-283

  Cheney, James ^a   Urban, Christian ^b  

^a Department of Obstetrics Gynecology   (United States)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; COMPUTATIONAL LINGUISTICS; COMPUTER CIRCUITS; COMPUTER PROGRAMMING LANGUAGES; ENCODING (SYMBOLS); LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE; SEMANTICS;

ABSTRACT SYNTAX; ALPHA-EQUIVALENCE; FIRST-ORDER LANGUAGE; HIGHER-ORDER LANGUAGES; NEW APPROACHES; OPERATIONAL SEMANTICS; PRIMITIVE OPERATIONS; REASONING ABOUT PROGRAMS;

PROLOG (PROGRAMMING LANGUAGE);

EID: 35048857790     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (26)

1. Andreas Abel. A third-order representation of the λμ-calculus. 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.
2. James Cheney. The complexity of equivariant unification. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), 2004. To appear.
3. N. G. de Bruijn. Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation. Indag. Mat., 34(5):381-392, 1972.
4. 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.
5. M. P. Fiore, G. D. Plotkin, and D. Turi. Abstract syntax and variable binding. In Proc. 14th Symp. on Logic in Computer Science (LICS 1999), pages 193-202. IEEE, 1999.
6. M. J. Gabbay. The π-calculus in FM. In Fairouz Kamareddine, editor, Thirty-five years of Automath. Kluwer, 2003.
7. M. J. Gabbay and J. Cheney. A proof theory for nominal logic. In Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS S004), 2004. To appear.
8. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13:341-363, 2002.
9. Makoto Hamana. A logic programming language based on binding algebras. In Proc. Theoretical Aspects of Computer Science (TACS 2001), number 2215 in Lecture Notes in Computer Science, pages 243-262. Springer-Verlag, 2001.
10. Martin Hofmann. Semantical analysis of higher-order abstract syntax. In Proc. 14th Symp. on Logic in Computer Science, pages 204-213. IEEE, July 1999.
11. Joxan Jaffar, Michael J. Maher, Kim Marriott, and Peter J. Stuckey. The semantics of constraint logic programs. Journal of Logic Programming, 37(1-3):1-46, 1998.
12. Dale Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. J. Logic and Computation, 1(4):497-536, 1991.
13. Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125-157, 1991.
14. Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, I-II. Information and Computation, 100(1):1-77, September 1992.
15. A. Momigliano, S. J. Ambler, and R. L. Croie. A comparison of formalizations of the meta-theory of a language with variable bindings in Isabelle. In Informatics Research Report EDI-INF-RR-0046, Supplemental Proceedings of TPHOLs 2001, pages 267-282. University of Edinburgh, 2001.
16. G. Nadathur and D. Miller. Higher-order logic programming. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 5, chapter 8, pages 499-590. Oxford University Press, 1998.
17. Michel Parigot. Lambda-mu-calculus: An algorithmic interpretation of classical natural deduction. In A. Voronkov, editor, Proceedings of the 1992 International Conference on Logic Programming and Automated Reasoning (LPAR '92), number 624 in LNAI, pages 190-201, 1992.
18. 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.
19. A. M. Pitts. Nominal logic, a first order theory of names and binding. Information and Computation, 183:165-193, 2003.
20. Christine Röckl. A first-order syntax for the pi-calculus in isabelle/hol using permutations. In S.J. Ambler, R.L. Croie, 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.
21. C. Schürmann, R. Fontana, and Y. Liao. Delphin: Functional programming with deductive systems. Available at http://cs-www.cs.yale.edu/ homes/carsten/, 2002.
22. 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.
23. Zoltan Somogyi, Fergus Henderson, and Thomas Conway. The execution algorithm of Mercury: an efficient purely declarative logic programming language. J. Logic Programming, 29(1-3):17-64, October-December 1996.
24. J. Staples, P. J. Robinson, R. A. Paterson, R. A. Hagen, A. J. Craddock, and P. C. Wallis. Qu-prolog: An extended prolog for meta level programming. In Harvey Abramson and M. H. Rogers, editors, Meta-Programming in Logic Programming, chapter 23. MIT Press, 1996.
25. C. Urban, A. M. Pitts, and M. J. Gabbay. Nominal unification. In M. Baaz, editor, Computer Science Logic and 8th Kurt Gödel Colloquium (CSL'03 KGC), volume 2803 of Lecture Notes in Computer Science, pages 513-527, Vienna, Austria, 2003. Springer-Verlag.
26. Christian Urban and James Cheney. Avoiding equivariant unification. Submitted.