On the public citation graph

Eta-conversion for the languages of explicit substitutions

https://doi.org/10.1007/bfb0013834
0 signed · 20 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/978-1-4612-0317-9openalex-snapshot
Categorical Combinators, Sequential Algorithms, and Functional Programming
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1007/bf01235723openalex-snapshot
Eta-conversion for the languages of explicit substitutions
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/1385-7258(78)90052-5openalex-snapshot
Lambda calculus with namefree formulas involving symbols that represent reference transforming mappings
inferredcites →https://doi.org/10.1016/b978-0-08-012975-4.50028-xopenalex-snapshot
Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.
inferredcites →https://doi.org/10.1017/cbo9780511809835.002openalex-snapshot
The λ-calculus
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
inferredcites →https://doi.org/10.1145/96709.96712openalex-snapshot
Explicit substitutions

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-61511-3_125openalex-snapshot
More Church-Rosser proofs (in Isabelle/HOL)
inferred← citeshttps://doi.org/10.1007/bfb0014047openalex-snapshot
An explicit Eta rewrite rule
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.1023/a:1006496715975openalex-snapshot
More Church–Rosser Proofs
inferred← citeshttps://doi.org/10.1093/jigpal/jzp027openalex-snapshot
Explicit substitutions calculi with one step Eta-reduction decided explicitly
inferred← citeshttps://doi.org/10.1145/174675.174707openalex-snapshot
From λσ to λυ
inferred← citeshttps://doi.org/10.3166/jancl.16.119-150openalex-snapshot
SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi ★
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.