Foundations of nominal techniques: Logic and semantics of variables in abstract syntax

Bulletin of Symbolic Logic

Volumn 17, Issue 2, 2011, Pages 161-229

  Gabbay, Murdoch J ^a  

^a NONE

Author keywords

Alpha equivalence; Atoms abstraction; Inductive syntax up to binding; Logic and set theory; Names; Nominal abstract syntax; Nominal techniques; Variable binding

Indexed keywords

EID: 79959327937     PISSN: 10798986     EISSN: None     Source Type: Journal    
DOI: 10.2178/bsl/1305810911     Document Type: Article

References (73)

1. SAMSON ABRAMSKY, DAN R. GHICA, ANDRZEJ S. MURAWSKI, C.-H. LUKE ONG, and IAN D. B. STARK, Nominal games and full abstraction for the nu-calculus, Proceedings of the 19th IEEE symposium on Logic in Computer Science (LICS 2004), IEEE Computer Society Press, 2004, pp. 150-159.
2. BRIAN AYDEMIR, AARON BOHANNON, and STEPHANIE WEIRICH, Nominal reasoning techniques in Coq, Electronic Notes in Theoretical Computer Science, vol. 174 (2007), no. 5, pp. 69-77.
3. HENK P. BARENDREGT, The lambda calculus: its syntax and semantics, revised ed., North-Holland, 1984.
4. STEFAN BERGHOFER and CHRISTIAN URBAN, A head-to-head comparison of de Bruijn indices and names. Electronic Notes in Theoretical Computer Science, vol. 174 (2007), no. 5, pp. 53-67. (Pubitemid 46783722)
5. NICOLAS BOURBAKI, Théorie des ensembles, Hermann, Paris, 1970.
6. NORBERT BRUNNER, 75 years of independence proofs by Fraenkel-Mostowski permutation models, Mathematica Japonica, vol. 43 (1996), pp. 177-199. (Pubitemid 126049018)
7. LUÍS CAIRES and LUCA CARDELLI, A spatial logic for concurrency (part II), Theoretical Computer Science, vol. 322 (2004), no. 3, pp. 517-565.
8. GEORG CANTOR, Beiträge zur Begründung der transfiniten Mengenlehre II, Mathematische Annalen, vol. 2 (1897), no. 49, pp. 481-512.
9. JAMES CHENEY, A simpler prooftheoryfor nominal logic. Foundations of software science and computation structures (Vladimiro Sassone, editor), Lecture Notes in Computer Science, vol. 3441, Springer, 2005, pp. 379-394.
10. - , Completeness and Herbrand theorems for nominal logic, The Journal of Symbolic Logic, vol. 71 (2006), pp. 299-320.
11. JAMES CHENEY and CHRISTIAN URBAN, System description: Alpha-Prolog, a fresh approach to logic programming modulo alpha-equivalence, Technical Report DSIC-II/12/03, Departamento de Sistemas Informáticos y Computatión, Universidad Politécnica de Valencia, 2003.
12. RANALD CLOUSTON, Equational logic for names and binding, Ph.D. thesis, University of Cambridge, UK, 2010, pending graduation.
13. PAUL J. COHEN, The independence of the continuum hypothesis, Proceedings of the National Academy of Sciences of the United States of America, vol. 50(1963), no. 6, pp. 1143-1148.
14. NICOLAAS G. DE BRUIJN, Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem, Indagationes Mathematicae vol. 5 (1972), no. 34, pp. 381-392.
15. JOËLLE DESPEYROUX and ANDRÉ HIRSCHOWITZ, Higher-order abstract syntax with induction in COQ, Logic for Programming, Artificial intelligence, and Reasoning (LPAR'94) (Frank Pfenning, editor), Lecture Notes in Computer Science, vol. 822, Springer, 1994, pp. 159-173.
16. GILLES DOWEK and MURDOCH J. GABBAY, Permissive nominal logic, Principles and Practice of Declarative Programming (Temur Kutsia, Wolfgang Schreiner, and Maribel Fernández, editors), 2010, pp. 165-176.
17. HEINZ-DIETER EBBINGHAUS, JÖRG FLUM, and WOLFGANG THOMAS, Mathematical logic, second ed., Springer, 1994.
18. MARCELO FIORE and DANIELE TURI, Semantics of name and value passing, Proceedings of the 16th IEEE symposium on Logic in Computer Science (LICS 2001), IEEE Computer Society Press, 2001, pp. 93-104. (Pubitemid 32795621)
19. MARCELO P. FIORE, GORDON D. PLOTKIN, and DANIELE TURI, Abstract syntax and variable binding. Proceedings of the 14th IEEE symposium on Logic in Computer Science (LICS 1999), IEEE Computer Society Press, 1999, pp. 193-202.
20. MARCELO P. FIORE and SAM STATON, A congruence rule format for name-passing process calculi from mathematical structural operational semantics, Proceedings of the 21st IEEE symposium on Logic in Computer Science [LICS 2006), IEEE Computer Society Press, 2006, pp. 49-58. (Pubitemid 47130351)
21. ABRAHAM FRAENKEL, Der Begriff"definit" und die Unabhängigkeit des Auswahlsaxioms, Sitzungsberichte der Preussischen Akademie der Wissenschaften, Physikalisch-mathematische Klasse, 1922,
22. reprinted in English translation in From Frege to Gödel: A source book in mathematical logic 1879-1931, Harvard University Press, second edition, 1971, pp. 253-257.
23. DOV GABBAY, Elementary logics: A procedural perspective, Prentice Hall, 1998.
24. MURDOCH J. GABBAY, A theory of inductive definitions with alpha-equivalence, Ph.D. thesis, University of Cambridge, UK, 2000.
25. - , FM-HOL, a higher-order theory of names, 35 years of Automath (F. Kamareddine, editor), Kluwer, 2002, pp. 247-270.
26. - , Fresh logic. Journal of Applied Logic, vol. 5 (2007), no. 2, pp. 356-387.
27. - , A general mathematics of names. Information and Computation, vol. 205 (2007), no. 7, pp. 982-1011.
28. - , Nominal algebra and the HSP theorem, Journal of Logic and Computation, vol. 19 (2009), no. 2, pp. 341-367.
29. - , A study of substitution, using nominal techniques and Fraenkel-Mostowski sets, Theoretical Computer Science, vol. 410 (2009), no. 12-13, pp. 1159-1189.
30. MURDOCH J. GABBAY and JAMES CHENEY, A sequent calculus for nominal logic, Proceedings of the 19th IEEE symposium on Logic in Computer Science (LICS 2004), IEEE Computer Society, 2004, pp. 139-148.
31. MURDOCH J. GABBAY and MICHAEL GABBAY, Substitution for Fraenkel-Mostowski foundations, Proceedings of the 2008 AISB symposium on computing and philosophy, 2008, pp. 65-72.
32. MURDOCH J. GABBAY and MARTIN HOFMANN, Nominal renaming sets, Logic for Programming, Artificial intelligence, and Reasoning (LPAR 2008), Springer, 2008, pp. 158-173.
33. MURDOCH J. GABBAY and STEPHANE LENGRAND, The lambda-context calculus, Electronic Notes in Theoretical Computer Science, vol. 196 (2008), pp. 19-35.
34. MURDOCH J. GABBAY and AAD MATHUSSEN, Capture-avoiding substitution as a nominal algebra, Formal Aspects of Computing, vol. 20 (2008), no. 4-5, pp. 451-479.
35. - , One-and-a-halfth-order logic, Journal of Logic and Computation, vol. 18 (2008), no. 4, pp. 521-562.
36. MURDOCH J. GABBAY and DOMINIC P. MULLIGAN, One-and-a-halfth order terms: Curry-Howard for incomplete derivations, Workshop on Logic, Language and Information in Computation (WoLLIC 2008), Lecture Notes in Artificial Intelligence, vol. 5110, 2008, pp. 180-194.
37. MURDOCH J. GABBAY and ANDREW M. PITTS, A new approach to abstract syntax involving binders, Proceedings of the 14th IEEE symposium on Logic in Computer Science (LICS 1999), IEEE Computer Society Press, 1999, pp. 214-224.
38. - , A new approach to abstract syntax with variable binding, Formal Aspects of Computing, vol. 13 (2001), no. 3-5, pp. 341-363.
39. MARTIN HOFMANN, Semantical analysis of higher-order abstract syntax, Logic in Computer Science (LICS 1999), IEEE Computer Society Press, 1999, pp. 204-213.
40. FURIO HONSELL, MARINO MICULAN, and IVAN SCAGNETTO, An axiomatic approach to metareasoning on nominal algebras in HOAS, International Colloquium on Automata, Languages and Programming (ICALP 2001), Lecture Notes in Computer Science, vol. 2076, 2001, pp. 963-978. (Pubitemid 33300861)
41. THOMAS JECH, The axiom of choice, North-Holland, 1973.
42. - , Set theory, third ed., Springer, 2006.
43. PETER T. JOHNSTONE, Notes on logic and set theory, Cambridge University Press, 1987.
44. - , Sketches of an elephant: A topos theory compendium, Oxford Logic Guides, vol. 43 and 44, Oxford University Press, 2003.
45. EDWARD KEENAN and DAG WESTERSTÅHL, Generalized quantifiers in linguistics and logic, Handbook of logic and language (J. Van Benthem and A. Ter Meulen, editors), Elsevier, 1996, pp. 837-894.
46. JEAN LOUIS KRIVINE and RENE CORI, Lambda-calculu, types and models, Ellis Horwood, 1993, translated by Rene Cori.
47. SAUNDERS MAC LANE and IEKE MOERDIJK, Sheaves in geometry and logic: A first introduction to topos theory, Universitext, Springer, 1992.
48. MICHAEL MAXKAI, Avoiding the axiom of choice in general category theory, Journal of Pure and Applied Algebra, vol. 108 (1996), no. 2, pp. 109-173.
49. AAD MATHIJSSEN, Logical calculi for reasoning with binding, Ph.D. thesis, Technische Universiteit Eindhoven, 2007.
50. JAMES MCKINNA and RANDY POLLACK, Pure Type Systems formalized, Typed Lambda Calculi and Applications (TLCA 1993) (Marc Bezem and Jan Friso Groote, editors), Lecture Notes in Computer Science, no. 664, Springer-Verlag, 1993, pp. 289-305.
51. MATIAS MENNI, About VI-quantifiers, Applied Categorical Structures, vol. 11 (2003), no. 5, pp. 421-445.
52. DALE MILLER and ALWEN TIU, A proof theory for generic judgments (extended abstract), Proceedings of the 18th IEEE symposium on Logic in Computer Science (LICS 2003), IEEE Computer Society Press, 2003, pp. 118-127.
53. ANDRZEJ MOSTOWSKI, Über die Unabhängigkeit des Wohlordnungssatzes vom Ord-nungsprinzip, Fundament a Mathematicae, vol. 32 (1939), pp. 201-252.
54. - , On the independence of the well-ordering theorem from the ordering principle, Foundational studies, Studies in logic and the foundations of mathematics, 93, vol. 1, North-Holland, 1979, pp. 290-338.
55. DOMINIC P. MULLIGAN, Online nominal bibliography, 2010, http: //www.citeulike.org/group/11951/.
56. FRANK PFENNING and CONAL ELLIOTT, Higher-order abstract syntax, PLDI (Programming Language Design and Implementation), ACM Press, 1988, pp. 199-208.
57. ANDREW M. PITTS, Nominal logic, a first order theory of names and binding, Information and Computation, vol. 186 (2003), no. 2, pp. 165-193.
58. - , Alpha-structural recursion and induction, Journal of the ACM, vol. 53 (2006), no. 3, pp. 459-506.
59. ANDREW M. PITTS and MURDOCH J. GABBAY, A metalanguage for programming with bound names modulo renaming. Mathematics of Program Construction, MPC 2000 (Roland Carl Backhouse and Jose Nuno Oliveira, editors), Lecture Notes in Computer Science, vol. 1837, Springer, 2000, pp. 230-255.
60. MARK R. SHINWELL and ANDREW M. PITTS, Fresh objective Caml user manual, Technical Report UCAM-CL-TR-621, University of Cambridge, 2005.
61. - , On a monadic semantics for freshness, Theoretical Computer Science, vol. 342 (2005), no. 1, pp. 28-55.
62. MARK R. SHINWELL, ANDREW M. PITTS, and MURDOCH J. GABBAY, FreshML: Programming with binders made simple, Proceedings of the 8th ACM SIGPLAN International Conference on Functional Programming (ICFP 2003), vol. 38, ACM Press, 2003, pp. 263-274.
63. ALLEN STOUGHTON, Substitution revisited, Theoretical Computer Science, vol. 59 (1988), no. 3, pp. 317-325.
64. ALFRED TARSKI and STEVEN GIVANT, A formalization of set theory without variables, vol. 41, American Mathematical Society Colloquium Publications, 1987.
65. ALWEN TIU, A logic for reasoning about generic judgments. Electronic Notes in Theoretical Computer Science, vol. 174 (2007), no. 5, pp. 3-18. (Pubitemid 46783719)
66. CHRISTIAN URBAN, Nominal reasoning techniques in Isabelle/HOL, Journal of Automatic Reasoning, vol. 40 (2008), no. 4, pp. 327-356.
67. CHRISTIAN URBAN, JAMES CHENEY, and STEFAN BERGHOFER, Mechanising the metatheory of LF, Proceedings of the 23rd IEEE symposium on Logic in Computer Science (LICS 2008), IEEE Computer Society Press, 2008, pp. 45-56.
68. CHRISTIAN URBAN and CHRISTINE TASSON, Nominal techniques in Isabelle/HOL, Conference on Automated Deduction, Tallinn, Estonia (CADE'05), Lecture Notes in Artificial Intelligence, vol. 3632, 2005, pp. 38-53.
69. JOHN VON NEUMANN, Zur Einführungder transfiniten Zahlen, Acta Universitatis Szegediensis. Acta Scientiarum Mathematicarum, (1923), no. 1, pp. 199-208,
70. reprinted in English translation in From Frege to Gödel: A source book in mathematical logic 1879-1931, Harvard University Press, second edition, 1971.
71. DAG WESTERSTÅHL, Quantifiers in formal and natural languages, Handbook of philosophical logic (Gabbay and Gunthner, editors), vol. 4, Reidel, 1989, pp. 1-131.
72. WIKIPEDIA, Ordinal numbers, en.wikipedia.org/wiki/Ordinal.number, 23 September 2008.
73. ERNST ZERMELO, Über Grenzzahlen und Mengenbereichebe, Fundamenta Mathematical vol. 16 (1930), pp. 29-47.