Nominal equational logic
From MaRDI portal
Publication:2864152
DOI10.1016/J.ENTCS.2007.02.009zbMATH Open1277.68043OpenAlexW2094947480MaRDI QIDQ2864152FDOQ2864152
Authors: Ranald A. Clouston, Andrew M. Pitts 
Publication date: 6 December 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2007.02.009
Recommendations
- Nominal (universal) algebra: equational logic with names and binding
- Equational propositional logic
- Binding in nominal equational logic
- Nominal equational problems
- Equational Reasoning in Non-Classical Logics
- scientific article; zbMATH DE number 1036757
- Equational logic as a tool
- Composition nominative logics of equitone predicates
- The Semantics of Nominal Logic Programs
- scientific article
Theory of programming languages (68N15) Logic in computer science (03B70) Equational logic, Mal'tsev conditions (08B05)
Cites Work
- Sheaves in geometry and logic: a first introduction to topos theory
- Nominal logic, a first order theory of names and binding
- Alpha-structural recursion and induction
- 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
- Nominal unification
- Variations on algebra: Monadicity and generalisations of equational theories
- Title not available (Why is that?)
- One-and-a-halfth-order Logic
- A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL
- Theorem Proving in Higher Order Logics
- Logic Programming
- Substitution revisited
- FreshML: programming with binders made simple
- Computer Science Logic
- Fresh logic: Proof-theory and semantics for FM and nominal techniques
- Completeness and Herbrand theorems for nominal logic
- Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads
- Lambda abstraction algebras: representation theorems
- On the algebraic models of lambda calculus
- Foundations of Software Science and Computational Structures
Cited In (29)
- A dependent type theory with abstractable names
- Nominal lambda calculus: an internal language for FM-Cartesian closed categories
- Unity in nominal equational reasoning: the algebra of equality on nominal sets
- Matching and alpha-equivalence check for nominal terms
- Nominal Unification from a Higher-Order Perspective
- Title not available (Why is that?)
- The lambda-context calculus (extended version)
- Nominal (universal) algebra: equational logic with names and binding
- The Semantics of Nominal Logic Programs
- Binding in nominal equational logic
- Nominal logic, a first order theory of names and binding
- Title not available (Why is that?)
- Completeness and Herbrand theorems for nominal logic
- Term equational systems and logics (extended abstract)
- Rule formats for nominal process calculi
- Two cotensors in one: presentations of algebraic theories for local state and fresh names
- The First-Order Nominal Link
- Equational Systems and Free Constructions (Extended Abstract)
- On a monadic semantics for freshness
- Nominal syntax with atom substitutions
- Nominal Lawvere theories: a category theoretic account of equational theories with names
- On the construction of free algebras for equational systems
- Rule formats for nominal process calculi
- Nominal sets. Names and symmetry in computer science
- Equational presentations of functors and monads
- Nominal Matching and Alpha-Equivalence
- On universal algebra over nominal sets
- Fresh logic: Proof-theory and semantics for FM and nominal techniques
- The nominal/FM Yoneda lemma
Uses Software
This page was built for publication: Nominal equational logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864152)
