On the public citation graph
Final semantics for untyped λ-calculus
0 signed · 35 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.1006/inco.1993.1044openalex-snapshot
Full Abstraction in the Lazy Lambda Calculus
inferredcites →https://doi.org/10.1007/3-540-56596-5_45openalex-snapshot
On the foundations of final semantics: Non-standard sets, metric spaces, partial orders
inferredcites →https://doi.org/10.1007/3-540-57182-5_6openalex-snapshot
Some results on the full abstraction problem for restricted lambda calculi
inferredcites →https://doi.org/10.1007/3-540-58338-6_82openalex-snapshot
Processes and hyperuniverses
inferredcites →https://doi.org/10.1016/0022-0000(92)90040-popenalex-snapshot
An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
inferredcites →https://doi.org/10.1016/0304-3975(75)90017-1openalex-snapshot
Call-by-name, call-by-value and the λ-calculus
inferredcites →https://doi.org/10.1016/0890-5401(87)90042-3openalex-snapshot
Type theories, normal forms, and D∞-lambda-models
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50024-xopenalex-snapshot
Operational and Algebraic Semantics of Concurrent Processes
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1017/s096012950000147xopenalex-snapshot
Processes as terms: non-well-founded models for bisimulation
inferredcites →https://doi.org/10.1109/lics.1993.287595openalex-snapshot
A coinduction principle for recursive data types based on bisimulation
inferredcites →https://doi.org/10.1109/lics.1993.287597openalex-snapshot
Relational properties of recursively defined domains
inferredcites →https://doi.org/10.1137/0205036openalex-snapshot
The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
inferredcites →https://doi.org/10.3233/fi-1992-16205openalex-snapshot
Operational, Denotational and Logical Descriptions: A Case Study1
inferredcites →https://doi.org/10.48456/tr-263openalex-snapshot
The Lazy Lambda Calculus: an investigation into the foundations of functional programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_35openalex-snapshot
The Fine Structure of Game Lambda Models
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_10openalex-snapshot
Game Semantics for Untyped λβη-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-49019-1_17openalex-snapshot
A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects
inferred← citeshttps://doi.org/10.1007/3-540-61064-2_32openalex-snapshot
Final semantics for a higher order concurrent language
inferred← citeshttps://doi.org/10.1007/3-540-62688-3_29openalex-snapshot
Coinductive axiomatization of recursive type equality and subtyping
inferred← citeshttps://doi.org/10.1007/3-540-62688-3_40openalex-snapshot
Semantic techniques for deriving coinductive characterizations of observational equivalences for λ-calculi
inferred← citeshttps://doi.org/10.1007/bfb0030606openalex-snapshot
A uniform syntactical method for proving coinduction principles in λ-calculi
inferred← citeshttps://doi.org/10.1016/j.ic.2003.08.003openalex-snapshot
Parametric parameter passing λ-calculus
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00056-6openalex-snapshot
Universal coalgebra: a theory of systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00057-8openalex-snapshot
From computation to foundations via functions and application: The λ-calculus and its webbed models
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00140-6openalex-snapshot
Semantical analysis of perpetual strategies in λ-calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00170-7openalex-snapshot
Towards Lambda Calculus Order-Incompleteness
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80265-8openalex-snapshot
From Set-theoretic Coinduction to Coalgebraic Coinduction: some results, some problems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80347-0openalex-snapshot
Coalgebraic Coinduction in (Hyper)set-theoretic Categories
inferred← citeshttps://doi.org/10.1017/cbo9780511792588.003openalex-snapshot
An introduction to (co)algebra and (co)induction
inferred← citeshttps://doi.org/10.1017/s0956796809007205openalex-snapshot
Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
inferred← citeshttps://doi.org/10.1017/s0960129507006214openalex-snapshot
Coalgebraic description of generalised binary methods
inferred← citeshttps://doi.org/10.3233/fi-1998-33401openalex-snapshot
Coinductive Axiomatization of Recursive Type Equality and Subtyping
inferred← citeshttps://doi.org/10.5281/zenodo.26425openalex-snapshot
A List Of Ants From Mesopotamia; With A Description Of A New Species And A New Variety.
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.