On the public citation graph

First steps in synthetic domain theory

0 signed · 108 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/3-540-18508-9_17openalex-snapshot

Categories and effective computations

inferredcites →https://doi.org/10.1007/bfb0018350openalex-snapshot

Independence results for calculi of dependent types

inferredcites →https://doi.org/10.1007/bfb0089911openalex-snapshot

Scott is not always sober

inferredcites →https://doi.org/10.1016/0022-4049(82)90030-5openalex-snapshot

Generalized Banach-Mazur functionals in the topos of recursive sets

inferredcites →https://doi.org/10.1016/0168-0072(88)90018-8openalex-snapshot

A small complete category

inferredcites →https://doi.org/10.1016/0890-5401(92)90019-copenalex-snapshot

Extensional PERs

inferredcites →https://doi.org/10.1109/lics.1989.39165openalex-snapshot

How complete is PER?

inferredcites →https://doi.org/10.1109/lics.1990.113760openalex-snapshot

Extensional PERs

inferredcites →https://doi.org/10.1109/lics.1990.113762openalex-snapshot

Effective domains and intrinsic structure

inferredcites →https://doi.org/10.1112/plms/s3-38.2.237openalex-snapshot

On a Topological Topos

inferredcites →https://doi.org/10.1112/plms/s3-60.1.1openalex-snapshot

The Discrete Objects in the Effective Topos

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/10703163_22openalex-snapshot

Computational Adequacy in an Elementary Topos

inferred← citeshttps://doi.org/10.1007/3-540-45719-4_8openalex-snapshot

HasCasl: Towards Integrated Specification and Development of Functional Programs

inferred← citeshttps://doi.org/10.1007/3-540-55511-0_22openalex-snapshot

An exper model for Quest

inferred← citeshttps://doi.org/10.1007/3-540-57182-5_14openalex-snapshot

On the adequacy of per models

inferred← citeshttps://doi.org/10.1007/3-540-60164-3_22openalex-snapshot

The S-replete construction

inferred← citeshttps://doi.org/10.1007/3-540-60164-3_24openalex-snapshot

Lifting as a KZ-doctrine

inferred← citeshttps://doi.org/10.1007/3-540-63172-0_36openalex-snapshot

An extension of models of Axiomatic Domain Theory to models of Synthetic Domain Theory

inferred← citeshttps://doi.org/10.1007/978-3-031-39784-4_18openalex-snapshot

Parallelism in Realizability Models

inferred← citeshttps://doi.org/10.1007/978-94-007-0431-2_14openalex-snapshot

Foundations for Computable Topology

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

General synthetic domain theory — A logical approach (extended abstract)

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

Category Theory

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

Synthetic domain theory in type theory: Another logic of computable functions

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

A type-theoretical alternative to ISWIM, CUCH, OWHY

inferred← citeshttps://doi.org/10.1016/b978-0-444-51621-3.50010-4openalex-snapshot

The History of Categorical Logic: 1963–1977

inferred← citeshttps://doi.org/10.1016/j.apal.2003.12.005openalex-snapshot

Computational adequacy for recursive types in models of intuitionistic set theory

inferred← citeshttps://doi.org/10.1016/j.apal.2011.06.017openalex-snapshot

Metric spaces in synthetic topology

inferred← citeshttps://doi.org/10.1016/j.apal.2011.12.028openalex-snapshot

A synthetic theory of sequential domains

inferred← citeshttps://doi.org/10.1016/j.apal.2013.06.004openalex-snapshot

Relating first-order set theories, toposes and categories of classes

inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.049openalex-snapshot

First Steps in Synthetic Computability Theory

inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.058openalex-snapshot

Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic

inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.004openalex-snapshot

A Convenient Category of Domains

inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.040openalex-snapshot

Relational Parametricity for Control Considered as a Computational Effect

inferred← citeshttps://doi.org/10.1016/j.entcs.2012.08.004openalex-snapshot

Observationally-induced Effects in Cartesian Closed Categories

inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.11.004openalex-snapshot

Observationally-induced lower and upper powerspace constructions

inferred← citeshttps://doi.org/10.1016/j.jpaa.2017.02.013openalex-snapshot

The Frobenius condition, right properness, and uniform fibrations

inferred← citeshttps://doi.org/10.1016/j.jpaa.2025.108072openalex-snapshot

Continuous and algebraic domains in univalent foundations

inferred← citeshttps://doi.org/10.1016/j.tcs.2010.01.021openalex-snapshot

Comparing free algebras in Topological and Classical Domain Theory

inferred← citeshttps://doi.org/10.1016/j.tcs.2014.03.002openalex-snapshot

Sobriety for equilogical spaces

inferred← citeshttps://doi.org/10.1016/s0022-4049(96)00108-9openalex-snapshot

A presentation of the initial lift-algebra

inferred← citeshttps://doi.org/10.1016/s0022-4049(96)00151-xopenalex-snapshot

Repleteness and the associated sheaf

inferred← citeshttps://doi.org/10.1016/s0022-4049(96)00164-8openalex-snapshot

Two models of synthetic domain theory

inferred← citeshttps://doi.org/10.1016/s0168-0072(00)00014-2openalex-snapshot

Axioms and (counter)examples in synthetic domain theory

inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00110-5openalex-snapshot

The sequentially realizable functionals

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

On the structure of categories of coalgebras

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00221-8openalex-snapshot

Domains in H

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00243-2openalex-snapshot

An equational notion of lifting monad

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00108-2openalex-snapshot

Realizability Models for Type Theories

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80157-4openalex-snapshot

Studying Repleteness in the Category of Cpos

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80165-3openalex-snapshot

The Category of Cpos From a Synthetic Viewpoint

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80303-2openalex-snapshot

Equational Lifting Monads

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/9781316755884.004openalex-snapshot

Notions of computability at higher types I

inferred← citeshttps://doi.org/10.1017/s0956796818000011openalex-snapshot

Foundations of dependent interoperability

inferred← citeshttps://doi.org/10.1017/s0960129502003626openalex-snapshot

Realizability: a historical essay

inferred← citeshttps://doi.org/10.1017/s0960129502003651openalex-snapshot

Variations on realizability: realizing the propositional axiom of choice

inferred← citeshttps://doi.org/10.1017/s0960129502003699openalex-snapshot

Topological and limit-space subcategories of countably-based equilogical spaces

inferred← citeshttps://doi.org/10.1017/s0960129509007695openalex-snapshot

The Dedekind reals in abstract Stone duality

inferred← citeshttps://doi.org/10.1017/s0960129509990375openalex-snapshot

Some reasons for generalising domain theory

inferred← citeshttps://doi.org/10.1017/s0960129513000182openalex-snapshot

Computability structures, simulations and realizability

inferred← citeshttps://doi.org/10.1017/s0960129517000184openalex-snapshot

Quotienting the delay monad by weak bisimilarity

inferred← citeshttps://doi.org/10.1017/s0960129518000087openalex-snapshot

Denotational semantics of recursive types in synthetic guarded domain theory

inferred← citeshttps://doi.org/10.1017/s0960129521000165openalex-snapshot

Synthetic topology in Homotopy Type Theory for probabilistic programming

inferred← citeshttps://doi.org/10.1017/s096012952400032xopenalex-snapshot

Smooth and proper maps with respect to a fibration

inferred← citeshttps://doi.org/10.1017/s0960129597002387openalex-snapshot

A uniform approach to domain theory in realizability models

inferred← citeshttps://doi.org/10.1017/s0960129597002429openalex-snapshot

An enrichment theorem for an axiomatisation of categories of domains and continuous functions

inferred← citeshttps://doi.org/10.1017/s096012959900273xopenalex-snapshot

General synthetic domain theory – a logical approach

inferred← citeshttps://doi.org/10.1023/a:1006258506401openalex-snapshot

Formalizing Synthetic Domain Theory

inferred← citeshttps://doi.org/10.1023/a:1008600521659openalex-snapshot

Extensional Σ-Spaces in Type Theory

inferred← citeshttps://doi.org/10.1023/a:1008604622568openalex-snapshot

Inductive Construction of Repletion

inferred← citeshttps://doi.org/10.1109/lics.1994.316054openalex-snapshot

A general semantics for Evaluation Logic

inferred← citeshttps://doi.org/10.1109/lics.1996.561324openalex-snapshot

Syntactic considerations on recursive types

inferred← citeshttps://doi.org/10.1109/lics.1997.614954openalex-snapshot

Complete cuboidal sets in axiomatic domain theory

inferred← citeshttps://doi.org/10.1109/lics.1998.705658openalex-snapshot

A theory of recursive domains with applications to concurrency

inferred← citeshttps://doi.org/10.1109/lics.1998.705670openalex-snapshot

Recursive types in games: axiomatics and process representation

inferred← citeshttps://doi.org/10.1109/lics.1999.782592openalex-snapshot

Elementary axioms for categories of classes

inferred← citeshttps://doi.org/10.1109/lics.2002.1029837openalex-snapshot

Computational adequacy for recursive types in models of intuitionistic set theory

inferred← citeshttps://doi.org/10.1109/lics.2007.40openalex-snapshot

Relational Parametricity for Computational Effects

inferred← citeshttps://doi.org/10.1109/lics.2011.16openalex-snapshot

First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees

inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470719openalex-snapshot

Normalization for Cubical Type Theory

inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175777openalex-snapshot

A Metalanguage for Cost-Aware Denotational Semantics

inferred← citeshttps://doi.org/10.1109/lics65433.2025.00060openalex-snapshot

When is the partial map classifier a Sierpiński cone?

inferred← citeshttps://doi.org/10.1142/6284openalex-snapshot

Domain-Theoretic Foundations of Functional Programming

inferred← citeshttps://doi.org/10.1142/9789811236488_0004openalex-snapshot

Generalized Spaces for Constructive Algebra

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

Denotational semantics of recursive types in synthetic guarded domain theory

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

Partial type equivalences for verified dependent interoperability

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

Partial type equivalences for verified dependent interoperability

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

Logical Relations as Types: Proof-Relevant Parametricity for Program Modules

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

Decalf: A Directed, Effectful Cost-Aware Logical Framework

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

Handling Higher-Order Effectful Operations with Judgemental Monadic Laws

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

A Certifying Proof Assistant for Synthetic Mathematics in Lean

inferred← citeshttps://doi.org/10.1305/ndjfl/1039182256openalex-snapshot

Book Review: Colin McLarty. Elementary Categories, Elementary Toposes.

inferred← citeshttps://doi.org/10.1515/tmj-2017-0107openalex-snapshot

On fixed-point theorems in synthetic computability

inferred← citeshttps://doi.org/10.2168/lmcs-5(3:7)2009openalex-snapshot

Relational Parametricity for Computational Effects

inferred← citeshttps://doi.org/10.2168/lmcs-8(4:1)2012openalex-snapshot

First steps in synthetic guarded domain theory: step-indexing in the topos of trees

inferred← citeshttps://doi.org/10.26083/tuprints-00000528openalex-snapshot

From constructive mathematics to computable analysis via the realizability interpretation

inferred← citeshttps://doi.org/10.3233/fi-1995-22126openalex-snapshot

A SEMANTICS FOR EVALUATION LOGIC

inferred← citeshttps://doi.org/10.3233/fi-1995-2431openalex-snapshot

PARAMETERS AND PARAMETRIZATION IN SPECIFICATION, USING DISTRIBUTIVE CATEGORIES

inferred← citeshttps://doi.org/10.4115/jla.2010.2.5openalex-snapshot

A lambda calculus for real analysis

inferred← citeshttps://doi.org/10.4115/jla.2019.11.ft5openalex-snapshot

Frames and topological algebras for a double-power monad

inferred← citeshttps://doi.org/10.4115/jla.v2i0.63openalex-snapshot

A Lambda Calculus for Real Analysis.

inferred← citeshttps://doi.org/10.4230/lipics.csl.2021.28openalex-snapshot

Domain Theory in Constructive and Predicative Univalent Foundations

inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.131openalex-snapshot

Uniform Elgot Iteration in Foundations

inferred← citeshttps://doi.org/10.46298/entics.10323openalex-snapshot

Classifying topoi in synthetic guarded domain theory

inferred← citeshttps://doi.org/10.46298/entics.14732openalex-snapshot

Cost-sensitive computational adequacy of higher-order recursion in synthetic domain theory

inferred← citeshttps://doi.org/10.48550/arxiv.2111.03685openalex-snapshot

Using the internal language of toposes in algebraic geometry

inferred← citeshttps://doi.org/10.48550/arxiv.2307.05938openalex-snapshot

Decalf: A Directed, Effectful Cost-Aware Logical Framework

inferred← citeshttps://doi.org/10.70930/tac/t866sktdopenalex-snapshot

Geometric and Higher Order Logic in terms of Abstract Stone Duality

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.