On the public citation graph

A new characterization of lambda definability

https://doi.org/10.1007/bfb0037110
0 signed · 79 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/bf02023009openalex-snapshot
λ-definable functionals andβη conversion
inferredcites →https://doi.org/10.1007/bfb0037109openalex-snapshot
Studying the fully abstract model of PCF within its continuous function model
inferredcites →https://doi.org/10.1016/0168-0072(91)90067-vopenalex-snapshot
Kripke-style models for typed lambda calculus
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50013-5openalex-snapshot
Type Systems for Programming Languages
inferredcites →https://doi.org/10.1016/s0019-9958(85)80001-2openalex-snapshot
Logical relations and the typed λ-calculus
inferredcites →https://doi.org/10.1016/s0049-237x(08)70754-7openalex-snapshot
An Abstract Notion of Realizability for Which Intuitionistic Predicate Calculus is Complete
inferredcites →https://doi.org/10.1017/cbo9780511525902.015openalex-snapshot
Reasoning about sequential functions via logical relations
inferredcites →https://doi.org/10.1112/blms/19.2.190openalex-snapshot
INTRODUCTION TO HIGHER ORDER CATEGORICAL LOGIC (Cambridge Studies in Advanced Mathematics 7)
inferredcites →https://doi.org/10.21236/ada256233openalex-snapshot
On Statman's Finite Completeness Theorem
inferredcites →https://doi.org/10.2307/2273377openalex-snapshot
Completeness, invariance and λ-definability
inferredcites →https://doi.org/10.2307/2274784openalex-snapshot
Introduction to Higher Order Categorical Logic.

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.2000.2917openalex-snapshot
On Full Abstraction for PCF: I, II, and III
inferred← citeshttps://doi.org/10.1006/inco.2002.2957openalex-snapshot
A Relational Account of Call-by-Value Sequentiality
inferred← citeshttps://doi.org/10.1006/inco.2002.3115openalex-snapshot
Prelogical Relations
inferred← citeshttps://doi.org/10.1007/11538363_8openalex-snapshot
A Semantic Formulation of ⊤ ⊤-Lifting and Logical Predicates for Computational Metalanguage
inferred← citeshttps://doi.org/10.1007/3-540-44622-2_26openalex-snapshot
Finite Models and Full Completeness
inferred← citeshttps://doi.org/10.1007/3-540-44622-2_34openalex-snapshot
Logical Relations and Data Abstraction
inferred← citeshttps://doi.org/10.1007/3-540-44904-3_16openalex-snapshot
On a Semantic Definition of Data Independence
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_9openalex-snapshot
Lax Logical Relations
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_37openalex-snapshot
Logical Relations for Monadic Types
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_9openalex-snapshot
A Higher-Order Simulation Relation for System F
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_38openalex-snapshot
Pre-logical Relations
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_12openalex-snapshot
Lambda Definability with Sums via Grothendieck Logical Relations
inferred← citeshttps://doi.org/10.1007/3-540-57880-3_30openalex-snapshot
Fully abstract translations and parametric polymorphism
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_18openalex-snapshot
Mechanizing logical relations
inferred← citeshttps://doi.org/10.1007/978-3-030-17184-1_9openalex-snapshot
Extended Call-by-Push-Value: Reasoning About Effectful Programs and Evaluation Order
inferred← citeshttps://doi.org/10.1007/978-3-030-33636-3_10openalex-snapshot
System F in Agda, for Fun and Profit
inferred← citeshttps://doi.org/10.1007/978-3-030-44914-8_3openalex-snapshot
On the Versatility of Open Logical Relations
inferred← citeshttps://doi.org/10.1007/978-3-030-45231-5_15openalex-snapshot
Relative Full Completeness for Bicategorical Cartesian Closed Structure
inferred← citeshttps://doi.org/10.1007/978-3-031-30044-8_7openalex-snapshot
Modal Crash Types for Intermittent Computing
inferred← citeshttps://doi.org/10.1007/978-3-031-68934-5_15openalex-snapshot
Toward a Geometry for Syntax
inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_2openalex-snapshot
HOBiT: Programming Lenses Without Using Lens Combinators
inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_8openalex-snapshot
An Arithmetical Proof of the Strong Normalization for the λ-Calculus with Recursive Equations on Types
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_1openalex-snapshot
Games, Automata and Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_21openalex-snapshot
A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_22openalex-snapshot
Discrete Generalised Polynomial Functors
inferred← citeshttps://doi.org/10.1007/978-3-642-37075-5_15openalex-snapshot
On Monadic Parametricity of Second-Order Functionals
inferred← citeshttps://doi.org/10.1007/978-94-010-0526-5_15openalex-snapshot
The Undecidability of λ-Definability
inferred← citeshttps://doi.org/10.1007/bfb0037109openalex-snapshot
Studying the fully abstract model of PCF within its continuous function model
inferred← citeshttps://doi.org/10.1007/s00224-007-9062-1openalex-snapshot
A Provably Correct Translation of the λ-Calculus into a Mathematical Model of C++
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00283-oopenalex-snapshot
A characterization of lambda definability in categorical models of implicit polymorphism
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.08.002openalex-snapshot
Sequentiality and Piecewise-affinity in Segments of Real-PCF
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.01.011openalex-snapshot
On Quantum and Probabilistic Linear Lambda-calculi (Extended Abstract)
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.02.008openalex-snapshot
Logical Relations and Parametricity – A Reynolds Programme for Category Theory and Programming Languages
inferred← citeshttps://doi.org/10.1016/j.ic.2012.10.014openalex-snapshot
Relating computational effects by ⊤⊤-lifting
inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.09.003openalex-snapshot
Full abstraction for non-deterministic and probabilistic extensions of PCF I: The angelic cases
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.09.033openalex-snapshot
Cryptographic logical relations
inferred← citeshttps://doi.org/10.1016/s0168-0072(00)00056-7openalex-snapshot
On phase semantics and denotational semantics: the exponentials
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00066-7openalex-snapshot
Full abstraction for the second order subset of an Algol-like language
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)87172-1openalex-snapshot
The behavior-realization adjunction and generalized homomorphic relations
inferred← citeshttps://doi.org/10.1016/s0890-5401(02)93115-9openalex-snapshot
Prelogical Relations
inferred← citeshttps://doi.org/10.1016/s1570-7954(00)80027-3openalex-snapshot
Some aspects of categories in computer science
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)01206-5openalex-snapshot
A fully abstract model for sequential computation
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80321-4openalex-snapshot
Denotational Completeness Revisited
inferred← citeshttps://doi.org/10.1017/cbo9781107256552openalex-snapshot
Program Logics for Certified Compilers
inferred← citeshttps://doi.org/10.1017/s0956796899003615openalex-snapshot
Girard translation and logical predicates
inferred← citeshttps://doi.org/10.1017/s0960129508007172openalex-snapshot
Logical relations for monadic types
inferred← citeshttps://doi.org/10.1017/s0960129522000263openalex-snapshot
Semantic analysis of normalisation by evaluation for typed lambda calculus
inferred← citeshttps://doi.org/10.1017/s0960129525100327openalex-snapshot
Controlling unfolding in type theory
inferred← citeshttps://doi.org/10.1109/lics.1999.782612openalex-snapshot
Full abstraction and universality via realisability
inferred← citeshttps://doi.org/10.1109/lics.2007.23openalex-snapshot
Higher-Order Matching, Games and Automata
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470719openalex-snapshot
Normalization for Cubical Type Theory
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00061openalex-snapshot
Logical relations for call-by-push-value models, via internal fibrations in a 2-category
inferred← citeshttps://doi.org/10.1145/3498710openalex-snapshot
Provably correct, asymptotically efficient, higher-order reverse-mode automatic differentiation
inferred← citeshttps://doi.org/10.1145/351268.351271openalex-snapshot
Logical relations, data abstraction, and structured fibrations
inferred← citeshttps://doi.org/10.1145/3676954openalex-snapshot
A Logical Approach to Type Soundness
inferred← citeshttps://doi.org/10.1145/571157.571161openalex-snapshot
Semantic analysis of normalisation by evaluation for typed lambda calculus
inferred← citeshttps://doi.org/10.17863/cam.15863openalex-snapshot
Names and higher-order functions.
inferred← citeshttps://doi.org/10.17863/cam.55080openalex-snapshot
Cartesian closed bicategories: type theory and coherence
inferred← citeshttps://doi.org/10.2307/421100openalex-snapshot
An Application of Category-Theoretic Semantics to the Characterisation of Complexity Classes Using Higher-Order Function Algebras
inferred← citeshttps://doi.org/10.2307/j.ctv36xvknz.13openalex-snapshot
Functional Concepts in C++
inferred← citeshttps://doi.org/10.26083/tuprints-00000351openalex-snapshot
A Universal Realizability Model for Sequential Functional Computation
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d56openalex-snapshot
On the Versatility of Open Logical Relations: Continuity, Automatic Differentiation, and a Containment Theorem
inferred← citeshttps://doi.org/10.26226/morressier.604907f51a80aac83ca25d68openalex-snapshot
Relative full completeness for bicategorical cartesian closed structure
inferred← citeshttps://doi.org/10.46298/lmcs-18(1:43)2022openalex-snapshot
A Cubical Language for Bishop Sets
inferred← citeshttps://doi.org/10.46298/lmcs-20(1:13)2024openalex-snapshot
Galois connecting call-by-value and call-by-name
inferred← citeshttps://doi.org/10.5281/zenodo.31430openalex-snapshot
The Evolvdso Project: Key Services For The Evolution Of Dsos Roles
inferred← citeshttps://doi.org/10.7146/brics.v4i41.18967openalex-snapshot
A Relational Account of Call-by-Value Sequentiality
inferred← citeshttps://doi.org/10.7146/brics.v6i10.20067openalex-snapshot
A Relational Account of Call-by-Value Sequentiality
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.