On the public citation graph

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

https://doi.org/10.1007/bfb0105416
0 signed · 23 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-57182-5_3openalex-snapshot
Deliverables: a categorical approach to program development in type theory
inferredcites →https://doi.org/10.1007/3-540-57182-5_57openalex-snapshot
Verifying properties of module construction in type theory
inferredcites →https://doi.org/10.1007/978-1-4612-0433-6openalex-snapshot
Semantics of Type Theory
inferredcites →https://doi.org/10.1007/bfb0084215openalex-snapshot
Algebraically complete categories
inferredcites →https://doi.org/10.1007/bfb0084217openalex-snapshot
First steps in synthetic domain theory
inferredcites →https://doi.org/10.1016/0890-5401(92)90019-copenalex-snapshot
Extensional PERs
inferredcites →https://doi.org/10.1017/cbo9780511526602openalex-snapshot
Logic and Computation
inferredcites →https://doi.org/10.1017/cbo9780511550812openalex-snapshot
Synthetic Differential Geometry
inferredcites →https://doi.org/10.1093/oso/9780198538356.001.0001openalex-snapshot
Computation and Reasoning
inferredcites →https://doi.org/10.1109/lics.1991.151640openalex-snapshot
The fixed point property in synthetic domain theory
inferredcites →https://doi.org/10.5860/choice.32-5698openalex-snapshot
Computation and reasoning: a type theory for computer science
inferredcites →https://doi.org/10.7146/brics.v1i44.21598openalex-snapshot
A HOL Basis for Reasoning about Functional Programs

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-642-21691-6_17openalex-snapshot
Partiality, State and Dependent Types
inferred← citeshttps://doi.org/10.1007/bfb0026995openalex-snapshot
General synthetic domain theory — A logical approach (extended abstract)
inferred← citeshttps://doi.org/10.1007/bfb0105392openalex-snapshot
Theorem Proving in Higher Order Logics
inferred← citeshttps://doi.org/10.1017/s0960129502003651openalex-snapshot
Variations on realizability: realizing the propositional axiom of choice
inferred← citeshttps://doi.org/10.1017/s0960129518000087openalex-snapshot
Denotational semantics of recursive types in synthetic guarded domain theory
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:1006294005493openalex-snapshot
Some Lambda Calculus and Type Theory Formalized
inferred← citeshttps://doi.org/10.1023/a:1008600521659openalex-snapshot
Extensional Σ-Spaces in Type Theory
inferred← citeshttps://doi.org/10.1145/2933575.2934516openalex-snapshot
Denotational semantics of recursive types in synthetic guarded domain theory
inferred← citeshttps://doi.org/10.7146/brics.v4i51.19272openalex-snapshot
Some Lambda Calculus and Type Theory Formalized
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.