Nominal Equational Logic

Electronic Notes in Theoretical Computer Science

Volumn 172, Issue , 2007, Pages 223-257

  Clouston, Ranald A ^a   Pitts, Andrew M ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Equational logic; nominal sets; permutation actions; universal algebra

Indexed keywords

ALGEBRA; FORMAL LANGUAGES; MATHEMATICAL MODELS; SET THEORY;

NOMINAL EQUATIONAL LOGIC; NOMINAL SETS; PERMUTATION ACTIONS;

FORMAL LOGIC;

EID: 33847636768     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.02.009     Document Type: Article

References (34)

1. Abramsky, S., D.R. Ghica, A.S. Murowski, C.-H.L. Ong and I.D.B. Stark, Nominal games and full abstraction for the nu-calculus, in: 19th Annual Symposium on Logic in Computer Science (2004), pp. 150-159
2. Barendregt H.P. The Lambda Calculus: Its Syntax and Semantics. revised edition (1984), North-Holland
3. Berger, U. and H. Schwichtenberg, An inverse of the evaluation functional for typed λ-calculus, in: 6th Annual Symposium on Logic in Computer Science (1991), pp. 203-211
4. Cheney, J., "Nominal Logic Programming," Ph.D. thesis, Cornell University (2004)
5. Cheney J. Completeness and Herbrand theorems for nominal logic. Journal of Symbolic Logic 71 (2006) 299-320
6. Cheney J., and Urban C. αProlog: A logic programming language with names, binding and α-equivalence. In: Demoen B.B., and Lifschitz V. (Eds). Logic Programming, 20th International Conference, Proceedings. ICLP 2004, Saint-Malo, France, September 2004. Lecture Notes in Computer Science 3132 (2004) 269-283
7. Dybjer P., and Filinski A. Normalization and partial evaluation. In: Barthe G., Dybjer P., and Saraiva J. (Eds). Applied Semantics, Advanced Lectures. Lecture Notes in Computer Science, Tutorial 2395 (2002), Springer-Verlag 137-192 International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000
8. Fernandez, M., M. Gabbay and I. Mackie, Nominal rewriting systems, in: Proc. 6th ACM-SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP'04) (2004), pp. 108-119
9. Fiore, M.P., G.D. Plotkin and D. Turi, Abstract syntax and variable binding, in: 14th Annual Symposium on Logic in Computer Science (1999), pp. 193-202
10. Fiore, M.P. and S. Staton, A congruence rule format for name-passing process calculi from mathematical operational semantics, in: 21st Annual Symposium on Logic in Computer Science, Seattle, USA (2006), pp. 49-58
11. Gabbay, M.J., "A Theory of Inductive Definitions with α-Equivalence: Semantics, Implementation, Programming Language," Ph.D. thesis, University of Cambridge (2000)
12. Gabbay, M.J., FM-HOL, a higher-order theory of names, in: F. Kamareddine, editor, Workshop on Thirty Five years of Automath, Informal Proceedings, Heriot-Watt University, Edinburgh, Scotland, 2002
13. Gabbay, M.J., Fresh logic, Journal of Logic and Computation (200X), to appear
14. Gabbay, M.J. and J. Cheney, A sequent calculus for nominal logic, in: 19th IEEE Symposium on Logic in Computer Science (LICS'04) (2004), pp. 139-148
15. Gabbay, M.J. and A. Mathijssen, Nominal algebra (2006), preprint
16. Gabbay, M.J. and A. Mathijssen, One-and-a-halfth-order logic, in: 8th ACM-SIGPLAN International Symposium on Principles and Practice of Declarative Programming (PPDP'06), Venice, Italy (2006), pp. 189-200
17. Gabbay M.J., and Pitts A.M. A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13 (2002) 341-363
18. Kelly G.M., and Power A.J. Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads. Journal of Pure and Applied Algebra 89 (1993) 163-179
19. MacLane S., and Moerdijk I. Sheaves in Geometry and Logic. A First Introduction to Topos Theory (1992), Springer-Verlag, New York
20. Meinke K., and Tucker J.V. Universal algebra. In: Abramsky S., Gabbay D.M., and Maibaum T.S.E. (Eds). Handbook of Logic in Computer Science Volume 1 (1992), Oxford University Press 189-411
21. Milner R., Parrow J., and Walker D. A calculus of mobile processes (parts I and II). Information and Computation 100 (1992) 1-77
22. Norrish M. Recursive function definition for types with binders. Theorem Proving in Higher Order Logics, 17th International Conference. Lecture Notes in Computer Science 3223 (2004) 241-256
23. Pigozzi D., and Salibra A. Lambda abstraction algebras: Representation theorems. Theoretical Computer Science 140 (1995) 5-52
24. Pitts A.M. Nominal logic, a first order theory of names and binding. Information and Computation 186 (2003) 165-193
25. Pitts A.M. Alpha-structural recursion and induction. Journal of the ACM 53 (2006) 459-506
26. Pottier F. An overview of Cαml. ACM SIGPLAN Workshop on ML. (ML 2005), Tallinn, Estonia. Electronic Notes in Theoretical Computer Science (2005) 27-52
27. Robinson E.P. Variations on algebra: monadicity and generalisations of equational theories. Formal Aspects of Computing 13 (2002) 308-326
28. Salibra A. On the algebraic models of lambda calculus. Theoretical Computer Science 249 (2000) 197-240
29. Schöpp U., and Stark I.D.B. A dependent type theory with names and binding. Computer Science Logic. CSL04, Karpacz, Poland. Lecture notes in Computer Science 3210 (2004) 235-249
30. Shinwell, M.R., A.M. Pitts and M.J. Gabbay, FreshML: Programming with binders made simple, in: Eighth ACM SIGPLAN International Conference on Functional Programming (ICFP 2003), Uppsala, Sweden (2003), pp. 263-274
31. Stark I.D.B. Free-algebra models for the π-calculus. Foundations of Software Science and Computation Structures: Proceedings of FOSSACS 2005. Lecture Notes in Computer Science 3441 (2005) 155-169
32. Stoughton A. Substitution revisited. Theoretical Computer Science 59 (1988) 317-325
33. Urban C., and Berghofer S. A recursion combinator for nominal datatypes implemented in Isabelle/HOL. 3rd International Joint Conference on Automated Reasoning. (IJCAR 2006), Seattle, USA. Lecture Notes in Computer Science 4130 (2006) 498-512
34. Urban C., Pitts A.M., and Gabbay M.J. Nominal unification. Theoretical Computer Science 323 (2004) 473-497