On the public citation graph

Functional programming and combinatory algebras

https://doi.org/10.1007/bfb0017128
0 signed · 26 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.1002/malq.19680142106openalex-snapshot
Hierarchies of Primitive Recursive Functions
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/3-540-15975-4_26openalex-snapshot
Miranda: A non-strict functional language with polymorphic types
inferredcites →https://doi.org/10.1007/bf01448013openalex-snapshot
Über die Bausteine der mathematischen Logik
inferredcites →https://doi.org/10.1007/bfb0015737openalex-snapshot
A completeness theorem for recursively defined types
inferredcites →https://doi.org/10.1007/bfb0029515openalex-snapshot
λ-Calculus and Computer Science Theory
inferredcites →https://doi.org/10.1007/bfb0029521openalex-snapshot
λ-Terms as total or partial functions on normal forms
inferredcites →https://doi.org/10.1016/0304-3975(85)90135-5openalex-snapshot
Automatic synthesis of typed Λ-programs on term algebras
inferredcites →https://doi.org/10.1017/s0022481200051914openalex-snapshot
An abstraction algorithm for combinatory logic
inferredcites →https://doi.org/10.1145/359576.359579openalex-snapshot
Can programming be liberated from the von Neumann style?
inferredcites →https://doi.org/10.1145/367177.367199openalex-snapshot
Recursive functions of symbolic expressions and their computation by machine, Part I
inferredcites →https://doi.org/10.1145/502874.502880openalex-snapshot
Efficient compilation of lazy evaluation
inferredcites →https://doi.org/10.1145/800068.802132openalex-snapshot
Combinatory foundation of functional programming
inferredcites →https://doi.org/10.2307/2274155openalex-snapshot
Handbook of mathematical logic, edited by Jon Barwise with the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis, and A. S. Troelstra, Studies in logic and the foundations of mathematics, vol. 90, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1978 (© 1977), xi + 1165…
inferredcites →https://doi.org/10.7551/mitpress/12274.003.0023openalex-snapshot
Recursive Functions of Symbolic Expressions and Their Computation by Machine (1960)

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.1086openalex-snapshot
Intersection and Union Types: Syntax and Semantics
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_69openalex-snapshot
Intersection and union 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/bfb0035755openalex-snapshot
Subduing self-application
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90081-4openalex-snapshot
A short scientific biography of Corrado Böhm
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70268-4openalex-snapshot
Solving Equations in Lambda-Calculus
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00142-xopenalex-snapshot
An algebraic view of the Böhm-out technique
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00171-9openalex-snapshot
A CuCh Interpretation of an Object-Oriented Language1 1Partially supported by MURST Cofin '99 TOSCA.
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.1109/doa.1999.793988openalex-snapshot
A model for Java/CORBA and OODBMS distributed architectures
inferred← citeshttps://doi.org/10.3233/fi-1999-37401openalex-snapshot
Fixed Point Equations Inside the Algebra of Normal Forms
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.