On the public citation graph

Some philosophical issues concerning theories of combinators

https://doi.org/10.1007/bfb0029537
0 signed · 29 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 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-17162-2_121openalex-snapshot
Category theory and programming language semantics: An overview
inferred← citeshttps://doi.org/10.1007/3-540-45315-6_12openalex-snapshot
Type Inference with Recursive Type Equations
inferred← citeshttps://doi.org/10.1007/978-3-031-72851-8_1openalex-snapshot
General Introduction and Motivation
inferred← citeshttps://doi.org/10.1007/978-3-031-72851-8_4openalex-snapshot
The $$\lambda $$-Calculus as a Formal System of Symbolic Logic and the Container Notation
inferred← citeshttps://doi.org/10.1007/978-3-319-27683-0_27openalex-snapshot
Levy Labels and Recursive Types
inferred← citeshttps://doi.org/10.1007/978-3-540-24849-1_16openalex-snapshot
“Wave-Style” Geometry of Interaction Models in Rel Are Graph-Like Lambda-Models
inferred← citeshttps://doi.org/10.1007/978-3-540-45208-9_20openalex-snapshot
Decidability Properties of Recursive Types
inferred← citeshttps://doi.org/10.1007/978-3-662-05679-0_9openalex-snapshot
Combinatory Logic, Language, and Cognitive Representations
inferred← citeshttps://doi.org/10.1007/bf02123403openalex-snapshot
On the problem of deciding equality in partial combinatory algebras and in a formal system
inferred← citeshttps://doi.org/10.1007/bfb0032044openalex-snapshot
Term rewriting systems from Church-Rosser to Knuth-Bendix and beyond
inferred← citeshttps://doi.org/10.1016/0022-0000(78)90006-5openalex-snapshot
Tω as a Universal Domain
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90296-ropenalex-snapshot
Map theory
inferred← citeshttps://doi.org/10.1016/b978-0-444-87508-2.50035-6openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/j.ic.2008.09.003openalex-snapshot
Applications of infinitary lambda calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.08.018openalex-snapshot
Highlights in infinitary rewriting and lambda calculus
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70025-9openalex-snapshot
Bibliography
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/s0960129597002272openalex-snapshot
An axiomatization of partial n-place operations
inferred← citeshttps://doi.org/10.1017/s0960129598002722openalex-snapshot
The call-by-value λ-calculus: a semantic investigation
inferred← citeshttps://doi.org/10.1109/lics.2010.8openalex-snapshot
Modular Construction of Fixed Point Combinators and Clocked Böhm Trees
inferred← citeshttps://doi.org/10.1137/0205037openalex-snapshot
Data Types as Lattices
inferred← citeshttps://doi.org/10.1145/3408970openalex-snapshot
A general approach to define binders using matching logic
inferred← citeshttps://doi.org/10.1215/00294527-10670089openalex-snapshot
Spiritus Asper versus Lambda: On the Nature of Functional Abstraction
inferred← citeshttps://doi.org/10.2168/lmcs-10(2:4)2014openalex-snapshot
Discriminating Lambda-Terms Using Clocked Boehm Trees
inferred← citeshttps://doi.org/10.23638/lmcs-16(3:7)2020openalex-snapshot
Fixed point combinators as fixed points of higher-order fixed point generators
inferred← citeshttps://doi.org/10.3990/1.9789090075945openalex-snapshot
On an extension of functional languages for use in prototyping
inferred← citeshttps://doi.org/10.4064/fm192-2-5openalex-snapshot
Generalized E-algebras via λ-calculus I
inferred← citeshttps://doi.org/10.48550/arxiv.0711.3045openalex-snapshot
Generalized E-Algebras via lambda-Calculus I
inferred← citeshttps://doi.org/10.48550/arxiv.1002.2578openalex-snapshot
Modular Construction of Fixed Point Combinators and Clocked Boehm Trees
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.