On the public citation graph

Expressibility of functions in D. Scott's LCF language

https://doi.org/10.1007/bf01876321
0 signed · 42 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/bf02219096openalex-snapshot
Computable functionals of finite types
inferredcites →https://doi.org/10.1007/bfb0029534openalex-snapshot
Sequentially and parallelly computable functionals
inferredcites →https://doi.org/10.1007/bfb0073967openalex-snapshot
Continuous lattices
inferredcites →https://doi.org/10.1016/s0049-237x(08)70730-4openalex-snapshot
Lambda Calculus and Recursion Theory (Preliminary Version)

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.1021openalex-snapshot
Statman′s 1-Section Theorem
inferred← citeshttps://doi.org/10.1006/inco.2000.2917openalex-snapshot
On Full Abstraction for PCF: I, II, and III
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_44openalex-snapshot
Full abstraction and the Context Lemma (preliminary report)
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_39openalex-snapshot
SPCF: its model, calculus, and computational power
inferred← citeshttps://doi.org/10.1007/3-540-57880-3_30openalex-snapshot
Fully abstract translations and parametric polymorphism
inferred← citeshttps://doi.org/10.1007/3-540-58140-5_25openalex-snapshot
Hereditarily sequential functionals
inferred← citeshttps://doi.org/10.1007/978-1-4613-0897-3_14openalex-snapshot
On ‘Logical Relations’ in Program Semantics
inferred← citeshttps://doi.org/10.1007/978-3-030-31175-9_18openalex-snapshot
Fooling the Parallel or Tester with Probability 8/27
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_1openalex-snapshot
From Logic to Theoretical Computer Science – An Update
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_34openalex-snapshot
On Natural Non-dcpo Domains
inferred← citeshttps://doi.org/10.1007/978-3-7091-6597-3_27openalex-snapshot
Comparing the Church and Turing Approaches: Two Prophetical Messages
inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot
Semantics of algorithmic languages
inferred← citeshttps://doi.org/10.1007/bfb0023892openalex-snapshot
Non modularity and expressibility for nets of relations (extended abstract)
inferred← citeshttps://doi.org/10.1007/bfb0032019openalex-snapshot
A complete and decidable proof system for call-by-value equalities
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90064-oopenalex-snapshot
Can LCF be topped? Flat lattice models of typed λ-calculus
inferred← citeshttps://doi.org/10.1016/j.apal.2008.09.027openalex-snapshot
Natural non-dcpo domains and f-spaces
inferred← citeshttps://doi.org/10.1016/j.apal.2011.06.013openalex-snapshot
The extensional ordering of the sequential functionals
inferred← citeshttps://doi.org/10.1016/j.ic.2005.11.002openalex-snapshot
A stable programming language
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/s0960129500000293openalex-snapshot
Fully abstract translations between functional languages
inferred← citeshttps://doi.org/10.1017/s0960129500000384openalex-snapshot
A universality theorem for PCF with recursive types, parallel-or and ∃
inferred← citeshttps://doi.org/10.1017/s0960129516000165openalex-snapshot
On naturally continuous non-dcpo domains
inferred← citeshttps://doi.org/10.1017/s0960129599002807openalex-snapshot
Conditions for the completeness of functional and algebraic equational reasoning
inferred← citeshttps://doi.org/10.1109/ismvl64713.2025.00039openalex-snapshot
Normal Forms and Decompositions of Monotone Ternary Functions
inferred← citeshttps://doi.org/10.1109/lics.1988.5123openalex-snapshot
Semantical paradigms: notes for an invited lecture
inferred← citeshttps://doi.org/10.1109/lics.1989.39156openalex-snapshot
Computing with recursive types
inferred← citeshttps://doi.org/10.1109/lics.1990.113757openalex-snapshot
Completeness for typed lazy inequalities
inferred← citeshttps://doi.org/10.1109/lics.1993.287579openalex-snapshot
Adequacy for untyped translations of typed lambda -calculi
inferred← citeshttps://doi.org/10.1137/s0097539791224212openalex-snapshot
Full Abstraction and the Context Lemma
inferred← citeshttps://doi.org/10.1145/158511.158627openalex-snapshot
Algebraic reasoning and completeness in typed languages
inferred← citeshttps://doi.org/10.1145/182409.182482openalex-snapshot
Complete proof systems for algebraic simply-typed terms
inferred← citeshttps://doi.org/10.1145/3607869openalex-snapshot
Consistency Constraints for Mapping Dataflow Graphs to Hybrid Dataflow/von Neumann Architectures
inferred← citeshttps://doi.org/10.1145/3610579openalex-snapshot
Proceedings of the 21st ACM-IEEE International Conference on Formal Methods and Models for System Design
inferred← citeshttps://doi.org/10.1145/3610579.3611092openalex-snapshot
Towards a Basis for Endochronous Functions in Dataflow Process Networks
inferred← citeshttps://doi.org/10.1145/99583.99617openalex-snapshot
Fully abstract translations between functional languages
inferred← citeshttps://doi.org/10.1215/00294527-1499381openalex-snapshot
Partial Combinatory Algebras of Functions
inferred← citeshttps://doi.org/10.2168/lmcs-3(3:7)2007openalex-snapshot
Inductive Definition and Domain Theoretic Properties of Fully Abstract
inferred← citeshttps://doi.org/10.3233/com-180200openalex-snapshot
Bar recursion is not computable via iteration
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.