On the public citation graph

Categorical completeness results for the simply-typed lambda-calculus

https://doi.org/10.1007/bfb0014068
0 signed · 38 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.1021openalex-snapshot
Statman′s 1-Section Theorem
inferredcites →https://doi.org/10.1007/bf01084396openalex-snapshot
The category of finite sets and Cartesian closed categories
inferredcites →https://doi.org/10.1007/bf02023009openalex-snapshot
λ-definable functionals andβη conversion
inferredcites →https://doi.org/10.1007/bfb0014052openalex-snapshot
βη-Equality for coproducts
inferredcites →https://doi.org/10.1007/bfb0037094openalex-snapshot
On Mints' reduction for ccc-calculus
inferredcites →https://doi.org/10.1007/bfb0064870openalex-snapshot
Equality between functionals
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/s0022-4049(96)00137-5openalex-snapshot
Embedding of a free cartesian-closed category into the category of sets
inferredcites →https://doi.org/10.1016/s0049-237x(09)70166-1openalex-snapshot
Equality between Functionals Revisited
inferredcites →https://doi.org/10.1017/s0956796800001301openalex-snapshot
The virtues of eta-expansion
inferredcites →https://doi.org/10.1109/lics.1991.151645openalex-snapshot
An inverse of the evaluation functional for typed lambda -calculus
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.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.1002/1521-3870(200101)47:1<137::aid-malq137>3.0.co;2-fopenalex-snapshot
The Maximality of Cartesian Categories
inferred← citeshttps://doi.org/10.1007/3-540-45504-3_6openalex-snapshot
Coherent Bicartesian and Sesquicartesian Categories
inferred← citeshttps://doi.org/10.1007/978-1-4471-0865-8openalex-snapshot
Models of Sharing Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_20openalex-snapshot
Finite Dimensional Vector Spaces Are Complete for Traced Symmetric Monoidal Categories
inferred← citeshttps://doi.org/10.1007/978-3-642-02273-9_19openalex-snapshot
Kripke Semantics for Martin-Löf’s Extensional Type Theory
inferred← citeshttps://doi.org/10.1016/j.apal.2007.03.005openalex-snapshot
Coherence in smccs and equivalences on derivations in imll with unit
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.11.011openalex-snapshot
Building continuous webbed models for system F
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00168-9openalex-snapshot
The Typed Böhm Theorem
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80724-8openalex-snapshot
Building continuous webbed models for system F
inferred← citeshttps://doi.org/10.1017/bsl.2019.21openalex-snapshot
ETA-RULES IN MARTIN-LÖF TYPE THEORY
inferred← citeshttps://doi.org/10.1017/s0960129502003778openalex-snapshot
βη-complete models for System F
inferred← citeshttps://doi.org/10.1017/s0960129599002807openalex-snapshot
Conditions for the completeness of functional and algebraic equational reasoning
inferred← citeshttps://doi.org/10.1017/s0960129599002972openalex-snapshot
Topological representation of the λ-calculus
inferred← citeshttps://doi.org/10.1023/a:1020568830946openalex-snapshot
Bicartesian Coherence
inferred← citeshttps://doi.org/10.1145/1328438.1328484openalex-snapshot
An approach to call-by-name delimited continuations
inferred← citeshttps://doi.org/10.1145/1328897.1328484openalex-snapshot
An approach to call-by-name delimited continuations
inferred← citeshttps://doi.org/10.1145/3093333.3009901openalex-snapshot
Deciding equivalence with sums and the empty type
inferred← citeshttps://doi.org/10.2168/lmcs-7(3:18)2011openalex-snapshot
Kripke Semantics for Martin-L\"of's Extensional Type Theory
inferred← citeshttps://doi.org/10.2178/bsl/1067620091openalex-snapshot
Identity of Proofs Based on Normalization and Generality
inferred← citeshttps://doi.org/10.23638/lmcs-14(4:21)2018openalex-snapshot
Taylor expansion in linear logic is invertible
inferred← citeshttps://doi.org/10.48456/tr-854openalex-snapshot
Programming contextual computations
inferred← citeshttps://doi.org/10.48550/arxiv.0711.4961openalex-snapshot
Bicartesian Coherence Revisited
inferred← citeshttps://doi.org/10.48550/arxiv.math/9911073openalex-snapshot
The Maximality of the Typed Lambda Calculus and of Cartesian Closed Categories
inferred← citeshttps://doi.org/10.70930/tac/wmeodwd7openalex-snapshot
Exploring the Gap between Linear and Classical Logic
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.