On the public citation graph
Domain-Theoretic Foundations of Functional Programming
0 signed · 74 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.2000.2917openalex-snapshot
On Full Abstraction for PCF: I, II, and III
inferredcites →https://doi.org/10.1006/inco.2002.2957openalex-snapshot
A Relational Account of Call-by-Value Sequentiality
inferredcites →https://doi.org/10.1007/978-1-4471-0615-9openalex-snapshot
Games and Full Abstraction for a Functional Metalanguage with Recursive Types
inferredcites →https://doi.org/10.1007/bfb0040262openalex-snapshot
Equationally fully abstract models of PCF
inferredcites →https://doi.org/10.1007/bfb0084217openalex-snapshot
First steps in synthetic domain theory
inferredcites →https://doi.org/10.1016/0022-0000(78)90006-5openalex-snapshot
Tω as a Universal Domain
inferredcites →https://doi.org/10.1016/0304-3975(77)90044-5openalex-snapshot
LCF considered as a programming language
inferredcites →https://doi.org/10.1016/0304-3975(77)90053-6openalex-snapshot
Fully abstract models of typed λ-calculi
inferredcites →https://doi.org/10.1016/0304-3975(93)90095-bopenalex-snapshot
A type-theoretical alternative to ISWIM, CUCH, OWHY
inferredcites →https://doi.org/10.1016/0890-5401(90)90050-ropenalex-snapshot
Stability and computability in coherent domains
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/j.apal.2003.12.005openalex-snapshot
Computational adequacy for recursive types in models of intuitionistic set theory
inferredcites →https://doi.org/10.1016/s0304-3975(00)00194-8openalex-snapshot
Finitary PCF is not decidable
inferredcites →https://doi.org/10.1016/s1571-0661(05)01206-5openalex-snapshot
A fully abstract model for sequential computation
inferredcites →https://doi.org/10.1017/s0956796898003141openalex-snapshot
Classical logic, continuation semantics and abstract machines
inferredcites →https://doi.org/10.1017/s0960129500000384openalex-snapshot
A universality theorem for PCF with recursive types, parallel-or and ∃
inferredcites →https://doi.org/10.1017/s096012959900273xopenalex-snapshot
General synthetic domain theory – a logical approach
inferredcites →https://doi.org/10.1109/lics.1991.151640openalex-snapshot
The fixed point property in synthetic domain theory
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.5860/choice.30-6217openalex-snapshot
The formal semantics of programming languages: an introduction
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-030-41103-9_4openalex-snapshot
Galois Connections for Recursive Types
inferred← citeshttps://doi.org/10.1007/978-3-030-44914-8_22openalex-snapshot
Modular Relaxed Dependencies in Weak Memory Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-031-99536-1_11openalex-snapshot
Infinitary Refinement Types for Temporal Properties in Scott Domains
inferred← citeshttps://doi.org/10.1007/978-3-319-71237-6_25openalex-snapshot
A Nonstandard Functional Programming Language
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_37openalex-snapshot
Recursion in Higher Types and Resource Bounded Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_34openalex-snapshot
A Denotational Semantics for Total Correctness of Sequential Exact Real Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_32openalex-snapshot
Nested Hoare Triples and Frame Rules for Higher-Order Store
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_2openalex-snapshot
A Semantic Foundation for Hidden State
inferred← citeshttps://doi.org/10.1007/978-3-662-54458-7_32openalex-snapshot
On the Semantics of Intensionality
inferred← citeshttps://doi.org/10.1007/s00012-020-00676-4openalex-snapshot
A note on the Knaster–Tarski Fixpoint Theorem
inferred← citeshttps://doi.org/10.1007/s00224-011-9377-9openalex-snapshot
Non-determinism in Gödel’s System T
inferred← citeshttps://doi.org/10.1016/j.apal.2008.06.020openalex-snapshot
A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language
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.entcs.2008.10.020openalex-snapshot
A Functional Algorithm for Exact Real Integration with Invariant Measures
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.092openalex-snapshot
Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting
inferred← citeshttps://doi.org/10.1016/j.entcs.2013.09.023openalex-snapshot
A Stream Calculus of Bottomed Sequences for Real Number Computation
inferred← citeshttps://doi.org/10.1016/j.ic.2008.12.003openalex-snapshot
Operational domain theory and topology of sequential programming languages
inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.09.003openalex-snapshot
Full abstraction for non-deterministic and probabilistic extensions of PCF I: The angelic cases
inferred← citeshttps://doi.org/10.1016/j.jpaa.2016.02.011openalex-snapshot
A universal Krull–Lindenbaum theorem
inferred← citeshttps://doi.org/10.1016/j.scico.2022.102792openalex-snapshot
Effectful improvement theory
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.029openalex-snapshot
Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language
inferred← citeshttps://doi.org/10.1017/s0960129510000186openalex-snapshot
Semantical proofs of correctness for programs performing non-deterministic tests on real numbers
inferred← citeshttps://doi.org/10.1017/s0960129518000087openalex-snapshot
Denotational semantics of recursive types in synthetic guarded domain theory
inferred← citeshttps://doi.org/10.1017/s0960129521000153openalex-snapshot
The Scott model of PCF in univalent type theory
inferred← citeshttps://doi.org/10.1017/s0960129523000403openalex-snapshot
The order-K-ification monads
inferred← citeshttps://doi.org/10.1090/proc/17788openalex-snapshot
Countable quasicontinuous domains are quasialgebraic
inferred← citeshttps://doi.org/10.1093/logcom/exac075openalex-snapshot
On the computational properties of basic mathematical notions
inferred← citeshttps://doi.org/10.1093/logcom/exq009openalex-snapshot
Higher Types, Finite Domains and Resource-bounded Turing Machines
inferred← citeshttps://doi.org/10.1109/lics.2005.34openalex-snapshot
Operational Domain Theory and Topology of a Sequential Programming Language
inferred← citeshttps://doi.org/10.1109/lics.2019.8785809openalex-snapshot
A Probabilistic and Non-Deterministic Call-by-Push-Value Language
inferred← citeshttps://doi.org/10.1112/blms.70227openalex-snapshot
Separating continuous domains from algebraic domains
inferred← citeshttps://doi.org/10.1145/2429069.2429073openalex-snapshot
Full abstraction for nominal Scott domains
inferred← citeshttps://doi.org/10.1145/2629529openalex-snapshot
Denotational Semantics with Nominal Scott Domains
inferred← citeshttps://doi.org/10.1145/3290333openalex-snapshot
Modalities, cohesion, and information flow
inferred← citeshttps://doi.org/10.1145/3371083openalex-snapshot
Recurrence extraction for functional programs through call-by-push-value
inferred← citeshttps://doi.org/10.1145/3607863openalex-snapshot
Combinator-Based Fixpoint Algorithms for Big-Step Abstract Interpreters
inferred← citeshttps://doi.org/10.1145/3720457openalex-snapshot
Adequacy for Algebraic Effects Revisited
inferred← citeshttps://doi.org/10.1145/3763798openalex-snapshot
Integrating Resource Analyses via Resource Decomposition
inferred← citeshttps://doi.org/10.1145/3776699openalex-snapshot
Domain-Theoretic Semantics for Functional Logic Programming
inferred← citeshttps://doi.org/10.1177/0926227x251409398openalex-snapshot
SoK: Robust properties, robust abstractions and back-translations
inferred← citeshttps://doi.org/10.2168/lmcs-7(3:21)2011openalex-snapshot
Nested Hoare Triples and Frame Rules for Higher-order Store
inferred← citeshttps://doi.org/10.23638/lmcs-14(2:14)2018openalex-snapshot
Computability in Basic Quantum Mechanics
inferred← citeshttps://doi.org/10.25560/24759openalex-snapshot
Cumulative Learning in the Lambda Calculus
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d45openalex-snapshot
Modular Relaxed Dependencies in Weak Memory Concurrency
inferred← citeshttps://doi.org/10.29252/cgasa.13.1.105openalex-snapshot
The symmetric monoidal closed category of cpo M -sets
inferred← citeshttps://doi.org/10.4230/lipics.csl.2011.470openalex-snapshot
Relative Completeness for Logics of Functional Programs
inferred← citeshttps://doi.org/10.48456/tr-860openalex-snapshot
Program equivalence in functional metaprogramming via nominal Scott domains
inferred← citeshttps://doi.org/10.48550/arxiv.1604.01595openalex-snapshot
On Word and Frontier Languages of Unsafe Higher-Order Grammars
inferred← citeshttps://doi.org/10.48550/arxiv.2007.04621openalex-snapshot
Logic of computational semi-effects and categorical gluing for equivariant functors
inferred← citeshttps://doi.org/10.5282/edoc.17570openalex-snapshot
Formal methods in the theories of rings and domains
inferred← citeshttps://doi.org/10.70675/2c4422f8z1cafz4e76z85e9z4ba8ed705623openalex-snapshot
Game semantics and realizability for classical logic
inferred← citeshttps://doi.org/10.70675/f617f2ebzfaf0z4326z86d2z743244d3a16bopenalex-snapshot
A synchronous functional language with integer clocks
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.