On the public citation graph

Nominal (Universal) Algebra: Equational Logic with Names and Binding

0 signed · 112 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-44667-2_11openalex-snapshot
General Distributions in Process Algebra
inferredcites →https://doi.org/10.1007/3-540-45793-3_36openalex-snapshot
Open Proofs and Open Terms: A Basis for Interactive Logic
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_30openalex-snapshot
The Complexity of Equivariant Unification
inferredcites →https://doi.org/10.1007/978-3-540-73445-1_12openalex-snapshot
A Formal Calculus for Informal Equality with Binding
inferredcites →https://doi.org/10.1007/978-94-009-7066-3_4openalex-snapshot
Higher-Order Logic
inferredcites →https://doi.org/10.1007/978-94-009-7960-4_2openalex-snapshot
Parts I and II
inferredcites →https://doi.org/10.1007/978-94-017-0462-5openalex-snapshot
Handbook of Philosophical Logic
inferredcites →https://doi.org/10.1007/s00165-007-0056-1openalex-snapshot
Capture-avoiding substitution as a nominal algebra
inferredcites →https://doi.org/10.1007/s001650200016openalex-snapshot
A New Approach to Abstract Syntax with Variable Binding
inferredcites →https://doi.org/10.1007/s10817-008-9097-2openalex-snapshot
Nominal Techniques in Isabelle/HOL
inferredcites →https://doi.org/10.1016/0304-3975(92)90310-copenalex-snapshot
Universal algebra in higher types
inferredcites →https://doi.org/10.1016/b978-0-444-82830-9.x5017-6openalex-snapshot
Handbook of Process Algebra
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/j.entcs.2005.08.003openalex-snapshot
Constructing Induction Rules for Deductive Synthesis Proofs
inferredcites →https://doi.org/10.1016/j.entcs.2007.01.017openalex-snapshot
Hierarchical Nominal Terms and Their Theory of Rewriting
inferredcites →https://doi.org/10.1016/j.entcs.2007.02.009openalex-snapshot
Nominal Equational Logic
inferredcites →https://doi.org/10.1016/j.entcs.2007.02.019openalex-snapshot
The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads
inferredcites →https://doi.org/10.1016/j.entcs.2007.09.015openalex-snapshot
The λ-context Calculus
inferredcites →https://doi.org/10.1016/j.entcs.2008.10.011openalex-snapshot
Term Equational Systems and Logics
inferredcites →https://doi.org/10.1016/j.ic.2006.10.010openalex-snapshot
A general mathematics of names
inferredcites →https://doi.org/10.1016/j.ic.2006.12.002openalex-snapshot
Nominal rewriting
inferredcites →https://doi.org/10.1016/j.jal.2005.10.012openalex-snapshot
Fresh Logic: proof-theory and semantics for FM and nominal techniques
inferredcites →https://doi.org/10.1016/j.tcs.2004.06.016openalex-snapshot
Nominal unification
inferredcites →https://doi.org/10.1016/s0304-3975(00)00059-1openalex-snapshot
On the algebraic models of lambda calculus
inferredcites →https://doi.org/10.1016/s0304-3975(96)00171-5openalex-snapshot
Infinitary lambda calculus
inferredcites →https://doi.org/10.1016/s0304-3975(97)00170-9openalex-snapshot
An algebraic generalization of Frege structures — binding algebras
inferredcites →https://doi.org/10.1016/s0890-5401(03)00138-xopenalex-snapshot
Nominal logic, a first order theory of names and binding
inferredcites →https://doi.org/10.1016/s1571-0661(04)00278-6openalex-snapshot
Developing (Meta)Theory of λ-calculus in the Theory of Contexts1 1Work partially supported by Italian MURST project tosca and EC-WG types.
inferredcites →https://doi.org/10.1017/cbo9781139032636openalex-snapshot
Lambda Calculus with Types
inferredcites →https://doi.org/10.1017/cbo9781139172066openalex-snapshot
Notes on Logic and Set Theory
inferredcites →https://doi.org/10.1073/pnas.50.5.869openalex-snapshot
FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
inferredcites →https://doi.org/10.1093/logcom/14.3.373openalex-snapshot
The Lattice of Lambda Theories
inferredcites →https://doi.org/10.1093/logcom/exm064openalex-snapshot
One-and-a-halfth-order Logic
inferredcites →https://doi.org/10.1093/logcom/exn055openalex-snapshot
Nominal Algebra and the HSP Theorem
inferredcites →https://doi.org/10.1109/lics.1999.782615openalex-snapshot
Abstract syntax and variable binding
inferredcites →https://doi.org/10.1109/lics.2002.1029817openalex-snapshot
Separation logic: a logic for shared mutable data structures
inferredcites →https://doi.org/10.1145/1013963.1013978openalex-snapshot
Nominal rewriting systems
inferredcites →https://doi.org/10.1145/1069774.1069783openalex-snapshot
A new calculus of contexts
inferredcites →https://doi.org/10.1145/266420.266432openalex-snapshot
A calculus for cryptographic protocols
inferredcites →https://doi.org/10.1201/9781420064872openalex-snapshot
Process Algebra for Parallel and Distributed Processing
inferredcites →https://doi.org/10.1201/9781420064872.pt2openalex-snapshot
Analysis of Distributed Systems with mCRL2
inferredcites →https://doi.org/10.2178/jsl/1140641176openalex-snapshot
Completeness and Herbrand theorems for nominal logic
inferredcites →https://doi.org/10.2307/2322184openalex-snapshot
A Course in Universal Algebra.
inferredcites →https://doi.org/10.2307/421090openalex-snapshot
The Logic of Bunched Implications
inferredcites →https://doi.org/10.4324/9780203016244openalex-snapshot
An Introduction to Substructural Logics
inferredcites →https://doi.org/10.6100/ir573767openalex-snapshot
Incomplete proofs and terms and their use in interactive theorem proving
inferredcites →https://doi.org/10.6100/ir630460openalex-snapshot
Logical calculi for reasoning with binding

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-25027-0_5openalex-snapshot
Nominal Syntax with Atom Substitutions: Matching, Unification, Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-030-29436-6_26openalex-snapshot
A Formally Verified Abstract Account of Gödel’s Incompleteness Theorems
inferred← citeshttps://doi.org/10.1007/978-3-030-71995-1_2openalex-snapshot
Nominal Equational Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_33openalex-snapshot
Equational Reasoning Modulo Commutativity in Languages with Binders
inferred← citeshttps://doi.org/10.1007/978-3-032-04848-6_6openalex-snapshot
A Completion Procedure for Equational Rewriting Systems with Binders
inferred← citeshttps://doi.org/10.1007/978-3-319-05119-2_6openalex-snapshot
Types for Resources in $$\psi $$ -calculi
inferred← citeshttps://doi.org/10.1007/978-3-319-08918-8_23openalex-snapshot
Local States in String Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-319-24704-5_4openalex-snapshot
Completeness and Incompleteness in Nominal Kleene Algebra
inferred← citeshttps://doi.org/10.1007/978-3-319-47958-3_6openalex-snapshot
Binary Session Types for Psi-Calculi
inferred← citeshttps://doi.org/10.1007/978-3-319-94460-9_14openalex-snapshot
Nominal C-Unification
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_26openalex-snapshot
Second-Order Equational Logic (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-19805-2_25openalex-snapshot
Freshness and Name-Restriction in Sets of Traces with Names
inferred← citeshttps://doi.org/10.1007/978-3-642-20551-4_15openalex-snapshot
The First-Order Nominal Link
inferred← citeshttps://doi.org/10.1007/978-3-642-20920-8_11openalex-snapshot
Nominal Lawvere Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-22944-2_14openalex-snapshot
Stone Duality for Nominal Boolean Algebras with И
inferred← citeshttps://doi.org/10.1007/978-3-642-22953-4_14openalex-snapshot
Principal Types for Nominal Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-23217-6_18openalex-snapshot
Typed ψ-calculi
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_21openalex-snapshot
Nominal Completion for Rewrite Systems with Binders
inferred← citeshttps://doi.org/10.1007/978-3-642-32784-1_8openalex-snapshot
An Alpha-Corecursion Principle for the Infinitary Lambda Calculus
inferred← citeshttps://doi.org/10.1007/978-94-007-6600-6_2openalex-snapshot
Nominal Terms and Nominal Logics: From Foundations to Meta-mathematics
inferred← citeshttps://doi.org/10.1007/s10817-009-9164-3openalex-snapshot
Equivariant Unification
inferred← citeshttps://doi.org/10.1007/s10817-021-09599-8openalex-snapshot
Distilling the Requirements of Gödel’s Incompleteness Theorems with a Proof Assistant
inferred← citeshttps://doi.org/10.1016/j.apal.2016.10.001openalex-snapshot
Representation and duality of the untyped λ-calculus in nominal lattice and topological semantics, with a proof of topological completeness
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.08.016openalex-snapshot
Binding in Nominal Equational Logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2012.08.003openalex-snapshot
New
inferred← citeshttps://doi.org/10.1016/j.entcs.2013.09.009openalex-snapshot
Nominal Lambda Calculus: An Internal Language for FM-Cartesian Closed Categories
inferred← citeshttps://doi.org/10.1016/j.entcs.2015.04.003openalex-snapshot
A Dependent Type Theory with Abstractable Names
inferred← citeshttps://doi.org/10.1016/j.entcs.2020.02.002openalex-snapshot
On Solving Nominal Disunification Constraints
inferred← citeshttps://doi.org/10.1016/j.ic.2009.06.004openalex-snapshot
The lambda-context calculus (extended version)
inferred← citeshttps://doi.org/10.1016/j.jal.2012.03.001openalex-snapshot
Unity in nominal equational reasoning: The algebra of equality on nominal sets
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.04.002openalex-snapshot
Nominal Lawvere Theories: A category theoretic account of equational theories with names
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.01.002openalex-snapshot
Nominal syntax with atom substitutions
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.06.007openalex-snapshot
PNL to HOL: From the logic of nominal sets to the logic of higher-order functions
inferred← citeshttps://doi.org/10.1017/s0960129509990399openalex-snapshot
On universal algebra over nominal sets
inferred← citeshttps://doi.org/10.1017/s0960129511000272openalex-snapshot
Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables
inferred← citeshttps://doi.org/10.1017/s0960129520000328openalex-snapshot
The nominal/FM Yoneda Lemma
inferred← citeshttps://doi.org/10.1093/jigpal/jzq006openalex-snapshot
Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques
inferred← citeshttps://doi.org/10.1093/jigpal/jzs005openalex-snapshot
Meta-variables as infinite lists in nominal terms unification and rewriting
inferred← citeshttps://doi.org/10.1093/logcom/exp049openalex-snapshot
A Nominal Axiomatization of the Lambda Calculus
inferred← citeshttps://doi.org/10.1093/logcom/exs057openalex-snapshot
Quantifiers in logic and proof-search using permissive-nominal terms and sets
inferred← citeshttps://doi.org/10.1109/lics.2013.58openalex-snapshot
Instances of Computational Effects: An Algebraic Perspective
inferred← citeshttps://doi.org/10.1145/1577824.1577835openalex-snapshot
Universal algebra over lambda-terms and nominal terms
inferred← citeshttps://doi.org/10.1145/1836089.1836111openalex-snapshot
Permissive-nominal logic
inferred← citeshttps://doi.org/10.1145/2159531.2159532openalex-snapshot
Nominal Unification from a Higher-Order Perspective
inferred← citeshttps://doi.org/10.1145/2287718.2287720openalex-snapshot
Permissive-nominal logic
inferred← citeshttps://doi.org/10.1145/2700819openalex-snapshot
Semantics Out of Context
inferred← citeshttps://doi.org/10.1145/3161558openalex-snapshot
Typed Nominal Rewriting
inferred← citeshttps://doi.org/10.1145/3756907.3756921openalex-snapshot
Formalizing Languages with Binding Operators in Rewriting Logic
inferred← citeshttps://doi.org/10.1145/3767744openalex-snapshot
A Nominal Approach to Equational Problems in Languages with Binders
inferred← citeshttps://doi.org/10.2168/lmcs-8(3:14)2012openalex-snapshot
Strongly Complete Logics for Coalgebras
inferred← citeshttps://doi.org/10.2178/jsl/1344862164openalex-snapshot
Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free
inferred← citeshttps://doi.org/10.23638/lmcs-14(2:12)2018openalex-snapshot
The language of Stratified Sets is confluent and strongly normalising
inferred← citeshttps://doi.org/10.23638/lmcs-15(4:2)2019openalex-snapshot
Rule Formats for Nominal Process Calculi
inferred← citeshttps://doi.org/10.4204/eptcs.34.5openalex-snapshot
Closed nominal rewriting and efficiently computable nominal algebra equality
inferred← citeshttps://doi.org/10.4204/eptcs.430.0.4openalex-snapshot
Towards the HSP Theorem in Nominal Algebra with Fixed-Point Constraints (Work in Progress)
inferred← citeshttps://doi.org/10.4204/eptcs.71.4openalex-snapshot
Nominal Logic with Equations Only
inferred← citeshttps://doi.org/10.4204/eptcs.71.5openalex-snapshot
Nominal Henkin Semantics: simply-typed lambda-calculus models in nominal sets
inferred← citeshttps://doi.org/10.4230/lipics.csl.2015.374openalex-snapshot
Leaving the Nest: Nominal Techniques for Variables with Interleaving Scopes
inferred← citeshttps://doi.org/10.4230/lipics.rta.2010.209openalex-snapshot
An Efficient Nominal Unification Algorithm
inferred← citeshttps://doi.org/10.4230/lipics.tlca.2015.180openalex-snapshot
Dependent Types for Nominal Terms with Atom Substitutions
inferred← citeshttps://doi.org/10.46298/entics.14777openalex-snapshot
Strong Nominal Semantics for Fixed-Point Constraints
inferred← citeshttps://doi.org/10.46298/lmcs-19(1:8)2023openalex-snapshot
Completeness of Nominal PROPs
inferred← citeshttps://doi.org/10.48550/arxiv.1006.3027openalex-snapshot
Algebraic Theories over Nominal Sets
inferred← citeshttps://doi.org/10.48550/arxiv.1102.3174openalex-snapshot
Towards Nominal Formal Languages
inferred← citeshttps://doi.org/10.5555/2591370.2591394openalex-snapshot
Instances of Computational Effects: An Algebraic Perspective
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.