On the public citation graph

A Nominal Axiomatization of the Lambda Calculus

0 signed · 59 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.1006/inco.1995.1057openalex-snapshot
Parallel Reductions in λ-Calculus
inferredcites →https://doi.org/10.1007/11417170_8openalex-snapshot
Relational Reasoning in a Nominal Semantics for Storage
inferredcites →https://doi.org/10.1007/3-540-15975-4_37openalex-snapshot
Lambda lifting: Transforming programs to recursive equations
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-3-540-74464-1_9openalex-snapshot
Curry-Style Types for Nominal Terms
inferredcites →https://doi.org/10.1007/978-3-540-74915-8_24openalex-snapshot
Not Enough Points Is Enough
inferredcites →https://doi.org/10.1007/bf00248324openalex-snapshot
The foundation of a generic theorem prover
inferredcites →https://doi.org/10.1007/bf00252180openalex-snapshot
TPS: A theorem-proving system for classical type theory
inferredcites →https://doi.org/10.1007/bf01448013openalex-snapshot
Über die Bausteine der mathematischen Logik
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.1016/0019-3577(94)90013-2openalex-snapshot
La reconstruction des fonctions holomorphes dans des domaines de Cn
inferredcites →https://doi.org/10.1016/0096-0551(83)90036-xopenalex-snapshot
Denotational semantics: The scott-strachey approach to programming language theory
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/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/j.entcs.2007.02.009openalex-snapshot
Nominal Equational Logic
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.tcs.2003.10.041openalex-snapshot
A spatial logic for concurrency—II
inferredcites →https://doi.org/10.1016/j.tcs.2004.06.016openalex-snapshot
Nominal unification
inferredcites →https://doi.org/10.1016/s0049-237x(08)71097-8openalex-snapshot
An Introduction to First-Order Logic
inferredcites →https://doi.org/10.1016/s0049-237x(08)71819-6openalex-snapshot
Extended Type Structures and Filter Lambda Models
inferredcites →https://doi.org/10.1016/s0304-3975(00)00057-8openalex-snapshot
From computation to foundations via functions and application: The λ-calculus and its webbed models
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(00)00353-4openalex-snapshot
Innocent game models of untyped λ-calculus
inferredcites →https://doi.org/10.1016/s0890-5401(03)00137-8openalex-snapshot
A spatial logic for concurrency (part I)
inferredcites →https://doi.org/10.1017/cbo9780511811326openalex-snapshot
ML for the Working Programmer
inferredcites →https://doi.org/10.1017/cbo9781139172752openalex-snapshot
Term Rewriting and All That
inferredcites →https://doi.org/10.1017/s0956796801004294openalex-snapshot
The lambda calculus is algebraic
inferredcites →https://doi.org/10.1017/s0960129506005123openalex-snapshot
Graph models of $\lambda$-calculus at work, and variations
inferredcites →https://doi.org/10.1093/logcom/1.4.497openalex-snapshot
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
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.1093/logcom/exp033openalex-snapshot
Nominal (Universal) Algebra: Equational Logic with Names and Binding
inferredcites →https://doi.org/10.1109/lics.2004.27openalex-snapshot
Nominal games and full abstraction for the nu-calculus
inferredcites →https://doi.org/10.1109/lics.2007.21openalex-snapshot
Full abstraction for nominal general references
inferredcites →https://doi.org/10.1145/1352582.1352591openalex-snapshot
Contextual modal type theory
inferredcites →https://doi.org/10.1145/960116.54010openalex-snapshot
Higher-order abstract syntax
inferredcites →https://doi.org/10.2307/2215463openalex-snapshot
Reasoning with Arbitrary Objects.
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types
inferredcites →https://doi.org/10.2307/2274454openalex-snapshot
Peter B. Andrews. An introduction to mathematical logic and type theory: to truth through proof. Computer science and applied mathematics. Academic Press, Orlando etc. 1986, xv + 304 pp.
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-642-22953-4_14openalex-snapshot
Principal Types for Nominal Theories
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.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.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.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/s0960129511000041openalex-snapshot
The representational adequacy of Hybrid
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.1093/jigpal/jzq006openalex-snapshot
Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques
inferred← citeshttps://doi.org/10.1145/1577824.1577835openalex-snapshot
Universal algebra over lambda-terms and nominal terms
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.23638/lmcs-15(4:2)2019openalex-snapshot
Rule Formats for Nominal Process Calculi
inferred← citeshttps://doi.org/10.29007/tp3zopenalex-snapshot
Stone duality for first-order logic: a nominal approach to logic and topology
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.48550/arxiv.1305.5968openalex-snapshot
Representation and duality of the untyped lambda-calculus in nominal lattice and topological semantics, with a proof of topological completeness
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.