On the public citation graph
Five axioms of alpha-conversion
0 signed · 89 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-57826-9_152openalex-snapshot
A mechanisation of name-carrying syntax up to alpha-conversion
inferredcites →https://doi.org/10.1007/3-540-58216-9_36openalex-snapshot
Higher-Order Abstract Syntax with induction in Coq
inferredcites →https://doi.org/10.1007/3-540-60275-5openalex-snapshot
Higher Order Logic Theorem Proving and Its Applications
inferredcites →https://doi.org/10.1007/3-540-61697-7_24openalex-snapshot
Implementing FS0 in Isabelle: Adding structure at the metalevel
inferredcites →https://doi.org/10.1016/0304-3975(93)90240-topenalex-snapshot
A theory of binding structures and applications to rewriting
inferredcites →https://doi.org/10.1016/0890-5401(92)90008-4openalex-snapshot
A calculus of mobile processes, I
inferredcites →https://doi.org/10.1016/0890-5401(92)90009-5openalex-snapshot
A calculus of mobile processes, II
inferredcites →https://doi.org/10.1016/1385-7258(72)90034-0openalex-snapshot
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
inferredcites →https://doi.org/10.1016/b978-0-444-89880-7.50042-5openalex-snapshot
Why We Can't have SML Style datatype Declarations in HOL
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1093/comjnl/6.4.308openalex-snapshot
The Mechanical Evaluation of Expressions
inferredcites →https://doi.org/10.2307/2274784openalex-snapshot
Introduction to Higher Order Categorical Logic.
inferredcites →https://doi.org/10.48456/tr-244openalex-snapshot
A mechanized theory of the π-calculus in HOL
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1998.2756openalex-snapshot
Alpha-Conversion and Typability
inferred← citeshttps://doi.org/10.1007/10930755_11openalex-snapshot
Programming a Symbolic Model Checker in a Fully Expansive Theorem Prover
inferred← citeshttps://doi.org/10.1007/11532231_4openalex-snapshot
Nominal Techniques in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/11541868_2openalex-snapshot
Alpha-Structural Recursion and Induction
inferred← citeshttps://doi.org/10.1007/11541868_4openalex-snapshot
Mechanized Metatheory for the Masses: The PoplMark Challenge
inferred← citeshttps://doi.org/10.1007/11541868_9openalex-snapshot
A Design Structure for Higher Order Quotients
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_16openalex-snapshot
A Framework for the Formalisation of Pi Calculus Type Systems in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/3-540-45127-7_23openalex-snapshot
A Formalised First-Order Con uence Proof for the λ-Calculus Using One-Sorted Variable Names (Barendregt Was Right after all ... almost)
inferred← citeshttps://doi.org/10.1007/3-540-45315-6_24openalex-snapshot
Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the π-Calculus and Mechanizing the Theory of Contexts
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_11openalex-snapshot
Nominal Logic: A First Order Theory of Names and Binding
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_18openalex-snapshot
A Type-Theoretic Approach to Induction with Higher-Order Encodings
inferred← citeshttps://doi.org/10.1007/3-540-45685-6_3openalex-snapshot
Combining Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_15openalex-snapshot
Mechanized Operational Semantics via (Co)Induction
inferred← citeshttps://doi.org/10.1007/3-540-62688-3_45openalex-snapshot
Names, equations, relations: Practical ways to reason about new
inferred← citeshttps://doi.org/10.1007/978-3-030-27455-9_3openalex-snapshot
Constructing Search Spaces for Search-Based Software Testing Using Neural Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-10769-6_36openalex-snapshot
Rensets and Renaming-Based Recursion for Syntax with Bindings
inferred← citeshttps://doi.org/10.1007/978-3-032-28187-6_7openalex-snapshot
Soundness of Typed Transitions in the Linear $$\pi $$-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-319-06200-6_17openalex-snapshot
Qed. Computing What Remains to Be Proved
inferred← citeshttps://doi.org/10.1007/978-3-319-66107-0_16openalex-snapshot
A Formalized General Theory of Syntax with Bindings
inferred← citeshttps://doi.org/10.1007/978-3-540-30142-4_18openalex-snapshot
Recursive Function Definition for Types with Binders
inferred← citeshttps://doi.org/10.1007/978-3-540-45191-4_4openalex-snapshot
Chapter 4. Basic Category Theory for Models of Syntax
inferred← citeshttps://doi.org/10.1007/978-3-540-74464-1_5openalex-snapshot
Combining de Bruijn Indices and Higher-Order Abstract Syntax in Coq
inferred← citeshttps://doi.org/10.1007/978-3-540-74591-4_16openalex-snapshot
Proof Pearl: De Bruijn Terms Really Do Work
inferred← citeshttps://doi.org/10.1007/978-3-662-46669-8_31openalex-snapshot
Binding Structures as an Abstract Data Type
inferred← citeshttps://doi.org/10.1007/978-981-99-8664-4_15openalex-snapshot
Formalization of Lambda Calculus with Explicit Names as a Nominal Reasoning Framework
inferred← citeshttps://doi.org/10.1007/bfb0028392openalex-snapshot
A full formalisation of π-calculus theory in the calculus of constructions
inferred← citeshttps://doi.org/10.1007/bfb0055135openalex-snapshot
Formalizing basic first order model theory
inferred← citeshttps://doi.org/10.1007/s001650200016openalex-snapshot
A New Approach to Abstract Syntax with Variable Binding
inferred← citeshttps://doi.org/10.1007/s10817-008-9097-2openalex-snapshot
Nominal Techniques in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/s10817-011-9225-2openalex-snapshot
The Locally Nameless Representation
inferred← citeshttps://doi.org/10.1007/s10817-011-9229-yopenalex-snapshot
A Canonical Locally Named Representation of Binding
inferred← citeshttps://doi.org/10.1007/s10817-019-09522-2openalex-snapshot
A Formalized General Theory of Syntax with Bindings: Extended Version
inferred← citeshttps://doi.org/10.1007/s10817-023-09672-4openalex-snapshot
Rensets and Renaming-Based Recursion for Syntax with Bindings Extended Version
inferred← citeshttps://doi.org/10.1007/s10990-006-8745-7openalex-snapshot
Mechanising λ-calculus using a classical first order theory of terms with permutations
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.01.028openalex-snapshot
Nominal Reasoning Techniques in Coq
inferred← citeshttps://doi.org/10.1016/j.entcs.2016.06.008openalex-snapshot
Alpha-Structural Induction and Recursion for the Lambda Calculus in Constructive Type Theory
inferred← citeshttps://doi.org/10.1016/j.indag.2013.08.003openalex-snapshot
Viewing λ -terms through maps
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.019openalex-snapshot
Mechanizing type environments in weak HOAS
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.08.025openalex-snapshot
Formal metatheory of the Lambda calculus using Stoughton's substitution
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00023-3openalex-snapshot
A formalised first-order confluence proof for the λ-calculus using one-sorted variable names
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00138-xopenalex-snapshot
Nominal logic, a first order theory of names and binding
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00276-2openalex-snapshot
A First-Order Syntax for the π-Calculus in Isabelle/HOL using Permutations
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00277-4openalex-snapshot
The Mechanisation of Barendregt-Style Equational Proofs (the Residual Perspective)
inferred← citeshttps://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.
inferred← citeshttps://doi.org/10.1017/cbo9780511605321.005openalex-snapshot
Higher-order abstract syntax in type theory
inferred← citeshttps://doi.org/10.1017/s0956796802004653openalex-snapshot
A fully adequate shallow embedding of the π-calculus in Isabelle/HOL with mechanized syntax analysis
inferred← citeshttps://doi.org/10.1017/s0956796811000116openalex-snapshot
Structural recursion with locally scoped names
inferred← citeshttps://doi.org/10.1017/s0960129511000041openalex-snapshot
The representational adequacy of Hybrid
inferred← citeshttps://doi.org/10.1023/a:1006294005493openalex-snapshot
Some Lambda Calculus and Type Theory Formalized
inferred← citeshttps://doi.org/10.1109/lics.1999.782617openalex-snapshot
A new approach to abstract syntax involving binders
inferred← citeshttps://doi.org/10.1109/lics.2002.1029819openalex-snapshot
A syntactic approach to foundational proof-carrying code
inferred← citeshttps://doi.org/10.1112/s1461157000000188openalex-snapshot
A Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs
inferred← citeshttps://doi.org/10.1145/1088454.1088456openalex-snapshot
A computational approach to reflective meta-reasoning about languages with bindings
inferred← citeshttps://doi.org/10.1145/1088454.1088458openalex-snapshot
A formal treatment of the barendregt variable convention in rule inductions
inferred← citeshttps://doi.org/10.1145/1147954.1147961openalex-snapshot
Alpha-structural recursion and induction
inferred← citeshttps://doi.org/10.1145/1328438.1328443openalex-snapshot
Engineering formal metatheory
inferred← citeshttps://doi.org/10.1145/2034574.2034819openalex-snapshot
Recursion principles for syntax with bindings and substitution
inferred← citeshttps://doi.org/10.1145/2503887.2503896openalex-snapshot
25 years of formal proof cultures
inferred← citeshttps://doi.org/10.1145/2631172.2631180openalex-snapshot
Internal Adequacy of Bookkeeping in Coq
inferred← citeshttps://doi.org/10.1145/976571.976577openalex-snapshot
Mechanising Hankin and Barendregt using the Gordon-Melham axioms
inferred← citeshttps://doi.org/10.3233/fi-1998-33403openalex-snapshot
Names, Equations, Relations: Practical Ways to Reason about new
inferred← citeshttps://doi.org/10.48456/tr-601openalex-snapshot
Combining model checking and theorem proving
inferred← citeshttps://doi.org/10.5281/zenodo.26347openalex-snapshot
Leptothorax Fuentei Santschi, 1919, En France (Hymenoptera, Formicidae).
inferred← citeshttps://doi.org/10.5525/gla.thesis.4609openalex-snapshot
Supporting formal reasoning about functional programs
inferred← citeshttps://doi.org/10.7146/brics.v4i18.18945openalex-snapshot
How to Believe a Machine-Checked Proof
inferred← citeshttps://doi.org/10.7146/brics.v4i39.18965openalex-snapshot
Names, Equations, Relations: Practical Ways to Reason about new
inferred← citeshttps://doi.org/10.7146/brics.v4i51.19272openalex-snapshot
Some Lambda Calculus and Type Theory Formalized
inferred← citeshttps://doi.org/10.7907/s0hg-rt72.openalex-snapshot
Reflection and its application to mechanized metareasoning about programming languages
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.