On the public citation graph

The þ-function in λ-K-conversion

0 signed · 23 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.1215/s0012-7094-36-00227-2openalex-snapshot
λ-definability and recursiveness
inferredcites →https://doi.org/10.2307/2371199openalex-snapshot
A Theory of Positive Integers in Formal Logic. Part II

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-53280-6_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-3-642-86745-3_2openalex-snapshot
The Undecidability of λK-Conversion
inferred← citeshttps://doi.org/10.1007/978-94-009-0681-5_14openalex-snapshot
A Tour of the Multivariate Lambda Calculus
inferred← citeshttps://doi.org/10.1007/s10990-005-4881-8openalex-snapshot
A Variadic Extension of Curry's Fixed-Point Combinator
inferred← citeshttps://doi.org/10.1016/b978-0-12-386980-7.50001-0openalex-snapshot
Alan Mathison Turing by Max Newman
inferred← citeshttps://doi.org/10.1016/b978-0-12-386980-7.50005-8openalex-snapshot
The p -Function in λ-K Conversion**Supported in part by NWO Project 612.000.936 CALMOC.
inferred← citeshttps://doi.org/10.1016/b978-0-444-87508-2.50035-6openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/b978-044450423-4/50020-6openalex-snapshot
ALAN MATHISON TURING
inferred← citeshttps://doi.org/10.1016/b978-044450423-4/50021-8openalex-snapshot
BIBLIOGRAPHY
inferred← citeshttps://doi.org/10.1016/j.apal.2019.04.013openalex-snapshot
Fixed point theorems for precomplete numberings
inferred← citeshttps://doi.org/10.1016/j.jtbi.2021.110984openalex-snapshot
An RNA-based theory of natural universal computation
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.12.024openalex-snapshot
Graph easy sets of mute lambda terms
inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80041-2openalex-snapshot
Loops in combinator-based compilers
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70025-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82613-1openalex-snapshot
Rewrite Strategies in the Rewriting Calculus
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.1016/s1874-5857(09)70019-6openalex-snapshot
The Logic of Church and Curry
inferred← citeshttps://doi.org/10.1051/ita/1986200403831openalex-snapshot
Point-fixe sur un ensemble restreint
inferred← citeshttps://doi.org/10.1080/01463379309369870openalex-snapshot
Communication and computability: The case of Alan Mathison Turing
inferred← citeshttps://doi.org/10.1098/rsbm.1955.0019openalex-snapshot
Alan Mathison Turing, 1912-1954
inferred← citeshttps://doi.org/10.4230/lipics.csl.2016.11openalex-snapshot
Models and theories of 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.