On the public citation graph
λ-Terms as total or partial functions on normal forms
0 signed · 24 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.1007/3-540-06841-4_60openalex-snapshot
Combinatorial Problems, Combinator Equations and Normal Forms
inferredcites →https://doi.org/10.1007/bf02575641openalex-snapshot
Un modello di λ-calcolo fortemente equivalente agli schemi ricorsivi
inferredcites →https://doi.org/10.1090/s0002-9947-1936-1501858-0openalex-snapshot
Some properties of conversion
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-08342-1_8openalex-snapshot
Termination tests inside λ-calculus
inferred← citeshttps://doi.org/10.1007/3-540-08860-1_30openalex-snapshot
Une extension de la theorie des types en λ-calcul
inferred← citeshttps://doi.org/10.1007/3-540-39185-1_8openalex-snapshot
Two Behavioural Lambda Models
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_26openalex-snapshot
Compositional Characterizations of λ-Terms Using Intersection Types
inferred← citeshttps://doi.org/10.1007/3-540-57880-3_9openalex-snapshot
λ-definition of function(al)s by normal forms
inferred← citeshttps://doi.org/10.1007/bfb0017128openalex-snapshot
Functional programming and combinatory algebras
inferred← citeshttps://doi.org/10.1016/0304-3975(79)90014-8openalex-snapshot
A discrimination algorithm inside λ-β-calculus
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90088-4openalex-snapshot
Expressive power of typed and type-free programming languages
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90042-3openalex-snapshot
Type theories, normal forms, and D∞-lambda-models
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.01.023openalex-snapshot
Behavioural inverse limit λ-models
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.03.011openalex-snapshot
Compositional characterisations of λ -terms using intersection types
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.1051/ita/1978120403391openalex-snapshot
Complexité de la réduction en logique combinatoire
inferred← citeshttps://doi.org/10.1051/ita/1979130302571openalex-snapshot
Complexity of $\lambda $-term reductions
inferred← citeshttps://doi.org/10.1051/ita/1980140201431openalex-snapshot
Une généralisation de la théorie des types en $\lambda $-calcul
inferred← citeshttps://doi.org/10.1051/ita/1980140303011openalex-snapshot
Une généralisation de la théorie des types en $\lambda $-calcul (II)
inferred← citeshttps://doi.org/10.2307/2272881openalex-snapshot
European meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.2307/2273135openalex-snapshot
European meeting of the Association for Symbolic Logic, Wroclaw 1977
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.