On the public citation graph

λ-definable functionals andβη conversion

https://doi.org/10.1007/bf02023009
0 signed · 33 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/bfb0064870openalex-snapshot
Equality between functionals
inferredcites →https://doi.org/10.1016/0304-3975(79)90007-0openalex-snapshot
The typed λ-calculus is not elementary recursive

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.1995.1085openalex-snapshot
Second Order Isomorphic Types: A Proof Theoretic Study on Second Order λ-Calculus with Surjective Pairing and Terminal Object
inferred← citeshttps://doi.org/10.1006/inco.2002.3115openalex-snapshot
Prelogical Relations
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_10openalex-snapshot
Axiomatizing Fully Complete Models for ML Polymorphic Types
inferred← citeshttps://doi.org/10.1007/3-540-44622-2_9openalex-snapshot
A Fully Complete PER Model for ML Polymorphic Types
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_102openalex-snapshot
How to define functionals on free structures in typed λ calculus
inferred← citeshttps://doi.org/10.1007/978-3-031-50981-0_10openalex-snapshot
Intensional Harmony as Isomorphism
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-87531-4_13openalex-snapshot
On the Relations between the Syntactic Theories of λμ-Calculi
inferred← citeshttps://doi.org/10.1007/bfb0014068openalex-snapshot
Categorical completeness results for the simply-typed lambda-calculus
inferred← citeshttps://doi.org/10.1007/bfb0014987openalex-snapshot
Extensional models for polymorphism
inferred← citeshttps://doi.org/10.1007/bfb0037110openalex-snapshot
A new characterization of lambda definability
inferred← citeshttps://doi.org/10.1007/bfb0043090openalex-snapshot
On the λ-definable tree operations
inferred← citeshttps://doi.org/10.1007/s10992-020-09577-2openalex-snapshot
What is the Meaning of Proofs?
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90077-6openalex-snapshot
Word operation definable in the typed λ-calculus
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90097-7openalex-snapshot
Extensional models for polymorphism
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90019-eopenalex-snapshot
A characterization of lambda definable tree operations
inferred← citeshttps://doi.org/10.1016/j.apal.2004.08.003openalex-snapshot
Linear realizability and full completeness for typed lambda-calculi
inferred← citeshttps://doi.org/10.1016/j.apal.2006.06.001openalex-snapshot
Weak typed Böhm theorem on IMLL
inferred← citeshttps://doi.org/10.1016/j.apal.2012.01.004openalex-snapshot
The relational model is injective for multiplicative exponential linear logic (without weakenings)
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.02.027openalex-snapshot
Böhm theorem and Böhm trees for the Λμ -calculus
inferred← citeshttps://doi.org/10.1016/s0890-5401(02)93115-9openalex-snapshot
Prelogical Relations
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00168-9openalex-snapshot
The Typed Böhm Theorem
inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70018-4openalex-snapshot
Lambda-Calculus and Combinators in the 20th Century
inferred← citeshttps://doi.org/10.1017/bsl.2019.21openalex-snapshot
ETA-RULES IN MARTIN-LÖF TYPE THEORY
inferred← citeshttps://doi.org/10.1017/s0960129500001444openalex-snapshot
Provable isomorphisms of types
inferred← citeshttps://doi.org/10.1093/jigpal/11.1.51openalex-snapshot
Higher Order β Matching is Undecidable
inferred← citeshttps://doi.org/10.1093/logcom/exae014openalex-snapshot
Meaning and identity of proofs in a bilateralist setting: A two-sorted typed Lambda-calculus for proofs and refutations
inferred← citeshttps://doi.org/10.1109/lics.2000.855753openalex-snapshot
Complete axioms for categorical fixed-point operators
inferred← citeshttps://doi.org/10.1145/22145.22175openalex-snapshot
Provable isomorphisms and domain equations in models of typed languages
inferred← citeshttps://doi.org/10.2178/bsl/1067620091openalex-snapshot
Identity of Proofs Based on Normalization and Generality
inferred← citeshttps://doi.org/10.4204/eptcs.207.1openalex-snapshot
Strong Typed Böhm Theorem and Functional Completeness on the Linear Lambda Calculus
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.