Nominal equational logic
From MaRDI portal
Publication:2864152
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; zbMATH DE number 5524514
Cites work
- scientific article; zbMATH DE number 108365 (Why is no real title available?)
- scientific article; zbMATH DE number 2090724 (Why is no real title available?)
- A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL
- A calculus of mobile processes. II
- A new approach to abstract syntax with variable binding
- Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads
- Alpha-structural recursion and induction
- Completeness and Herbrand theorems for nominal logic
- Computer Science Logic
- Foundations of Software Science and Computational Structures
- Fresh logic: Proof-theory and semantics for FM and nominal techniques
- FreshML: programming with binders made simple
- Lambda abstraction algebras: representation theorems
- Logic Programming
- Nominal logic, a first order theory of names and binding
- Nominal unification
- On the algebraic models of lambda calculus
- One-and-a-halfth-order Logic
- Sheaves in geometry and logic: a first introduction to topos theory
- Substitution revisited
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Theorem Proving in Higher Order Logics
- Variations on algebra: Monadicity and generalisations of equational theories
Cited in
(28)- The First-Order Nominal Link
- Equational Systems and Free Constructions (Extended Abstract)
- Nominal sets. Names and symmetry in computer science
- On universal algebra over nominal sets
- On the construction of free algebras for equational systems
- Rule formats for nominal process calculi
- Nominal syntax with atom substitutions
- scientific article; zbMATH DE number 5524514 (Why is no real title available?)
- Equational presentations of functors and monads
- Unity in nominal equational reasoning: the algebra of equality on nominal sets
- scientific article; zbMATH DE number 2242589 (Why is no real title available?)
- Nominal Lawvere theories: a category theoretic account of equational theories with names
- Matching and alpha-equivalence check for nominal terms
- Nominal (universal) algebra: equational logic with names and binding
- Completeness and Herbrand theorems for nominal logic
- The Semantics of Nominal Logic Programs
- Binding in nominal equational logic
- The nominal/FM Yoneda lemma
- Two cotensors in one: presentations of algebraic theories for local state and fresh names
- Nominal logic, a first order theory of names and binding
- Term equational systems and logics (extended abstract)
- On a monadic semantics for freshness
- Rule formats for nominal process calculi
- A dependent type theory with abstractable names
- Nominal Matching and Alpha-Equivalence
- Nominal lambda calculus: an internal language for FM-Cartesian closed categories
- Fresh logic: Proof-theory and semantics for FM and nominal techniques
- The lambda-context calculus (extended version)
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)
