On the public citation graph
An explicit Eta rewrite rule
0 signed · 23 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-59200-8_65openalex-snapshot
Explicit substitutions with de bruijn's levels
inferredcites →https://doi.org/10.1007/978-1-4612-0317-9openalex-snapshot
Categorical Combinators, Sequential Algorithms, and Functional Programming
inferredcites →https://doi.org/10.1007/bfb0013834openalex-snapshot
Eta-conversion for the languages of explicit substitutions
inferredcites →https://doi.org/10.1007/bfb0014062openalex-snapshot
Typed λ-calculi with explicit substitutions may not terminate
inferredcites →https://doi.org/10.1016/0304-3975(89)90105-9openalex-snapshot
Confluence results for the pure strong categorical logic CCL. λ-calculi as subsystems of CCL
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/s0019-9958(86)80047-xopenalex-snapshot
Categorical combinators
inferredcites →https://doi.org/10.1017/s0956796800001945openalex-snapshot
λν, a calculus of explicit substitutions which preserves strong normalisation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11601548_22openalex-snapshot
Expression Reduction Systems and Extensions: An Overview
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_15openalex-snapshot
Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_52openalex-snapshot
Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_125openalex-snapshot
More Church-Rosser proofs (in Isabelle/HOL)
inferred← citeshttps://doi.org/10.1016/j.apal.2004.06.009openalex-snapshot
Comparing and implementing calculi of explicit substitutions with eta-reduction
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00166-2openalex-snapshot
Confluence of extensional and non-extensional λ-calculi with explicit substitutions
inferred← citeshttps://doi.org/10.1017/s0956796800001945openalex-snapshot
λν, a calculus of explicit substitutions which preserves strong normalisation
inferred← citeshttps://doi.org/10.1093/jigpal/jzp027openalex-snapshot
Explicit substitutions calculi with one step Eta-reduction decided explicitly
inferred← citeshttps://doi.org/10.3166/jancl.16.119-150openalex-snapshot
SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi ★
showing the first 10 of 11 · page through all 11
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.