A general mathematics of names
DOI10.1016/J.IC.2006.10.010zbMATH Open1123.03047OpenAlexW2108640219MaRDI QIDQ2373874FDOQ2373874
Authors: Murdoch J. Gabbay 
Publication date: 16 July 2007
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2006.10.010
Recommendations
nominal techniquesalpha-conversionFraenkel-Mostowski set theoryde Bruijn indicesBarendregt representativesbinding of infinitely many namesFM setsname-carrying syntaxnew quantifierscope extrusion
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70) Nonclassical and second-order set theories (03E70) Inductive definability (03D70)
Cites Work
- Set theory. An introduction to independence proofs
- Nominal logic, a first order theory of names and binding
- Some lambda calculus and type theory formalized
- Title not available (Why is that?)
- A new approach to abstract syntax with variable binding
- The lambda calculus. Its syntax and semantics. Rev. ed.
- A calculus of mobile processes. II
- Handbook of philosophical logic. Vol. 5
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- FreshML: programming with binders made simple
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A fixedpoint approach to implementing (co)inductive definitions
- On a monadic semantics for freshness
Cited In (15)
- Alpha equivalence equalities
- On the development of the Fraenkel-Mostowski set theory
- Mathematical models of systems of transcription of name-and-surname groups
- On the rule of \(k\) names
- PNL to HOL: from the logic of nominal sets to the logic of higher-order functions
- A formalized general theory of syntax with bindings
- A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets
- A formalized general theory of syntax with bindings: extended version
- Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness
- Foundations of nominal techniques: logic and semantics of variables in abstract syntax
- Game semantics in the nominal model
- A basic method for naming Persian karbandis using a set of numbers
- Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free
- Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables
- Two-level lambda-calculus
Uses Software
This page was built for publication: A general mathematics of names
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373874)
