On the public citation graph

Sequentially and parallelly computable functionals

0 signed · 17 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/bfb0073967openalex-snapshot

Continuous lattices

inferredcites →https://doi.org/10.1016/s0049-237x(09)70356-8openalex-snapshot

Models for Various Type-Free Calculi

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-07854-1_168openalex-snapshot

Recursive program schemes and computable functionals

inferred← citeshttps://doi.org/10.1007/3-540-07854-1_223openalex-snapshot

Degrees of parallelism in computations

inferred← citeshttps://doi.org/10.1007/3-540-08860-1_7openalex-snapshot

Stable models of typed λ-calculi

inferred← citeshttps://doi.org/10.1007/3-540-58027-1_16openalex-snapshot

Sequential functions on indexed domains and full abstraction for a sub-language of PCF

inferred← citeshttps://doi.org/10.1007/bf00967869openalex-snapshot

Functionals computable in series and in parallel

inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot

Semantics of algorithmic languages

inferred← citeshttps://doi.org/10.1007/bf01876321openalex-snapshot

Expressibility of functions in D. Scott's LCF language

inferred← citeshttps://doi.org/10.1016/0304-3975(76)90034-7openalex-snapshot

Relationships between classes of monotonic functions

inferred← citeshttps://doi.org/10.1016/0304-3975(92)90049-lopenalex-snapshot

Towards a theory of parallel algorithms on concrete data structures

inferred← citeshttps://doi.org/10.1016/0304-3975(93)90089-copenalex-snapshot

Historical introduction to “concrete domains” by G. Kahn and G.D. Plotkin

inferred← citeshttps://doi.org/10.1016/j.ic.2005.11.002openalex-snapshot

A stable programming language

inferred← citeshttps://doi.org/10.1016/s0304-3975(82)80002-9openalex-snapshot

Sequential algorithms on concrete data structures

inferred← citeshttps://doi.org/10.1017/9781316755884.004openalex-snapshot

Notions of computability at higher types I

inferred← citeshttps://doi.org/10.1109/ismvl64713.2025.00039openalex-snapshot

Normal Forms and Decompositions of Monotone Ternary Functions

inferred← citeshttps://doi.org/10.1145/3607869openalex-snapshot

Consistency Constraints for Mapping Dataflow Graphs to Hybrid Dataflow/von Neumann Architectures

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.