On the public citation graph

Implementing constructive real analysis (preliminary report)

https://doi.org/10.1007/bfb0021090
0 signed · 20 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-09724-4openalex-snapshot
Edinburgh LCF
inferredcites →https://doi.org/10.1007/bfb0012835openalex-snapshot
Computational metatheory in Nuprl
inferredcites →https://doi.org/10.1007/bfb0062852openalex-snapshot
A language and axioms for explicit mathematics
inferredcites →https://doi.org/10.1016/0890-5401(88)90005-3openalex-snapshot
The calculus of constructions
inferredcites →https://doi.org/10.1016/s0049-237x(08)70223-4openalex-snapshot
Checking Landau's “Grundlagen” in the Automath System
inferredcites →https://doi.org/10.1016/s0049-237x(09)70189-2openalex-snapshot
Constructive Mathematics and Computer Programming
inferredcites →https://doi.org/10.2307/2314383openalex-snapshot
Foundations of Constructive Analysis.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11780342_24openalex-snapshot
Coinductive Proofs for Basic Real Computation
inferred← citeshttps://doi.org/10.1007/3-540-44557-9_7openalex-snapshot
A Co-inductive Approach to Real Numbers
inferred← citeshttps://doi.org/10.1007/3-540-45842-5_6openalex-snapshot
Constructive Reals in Coq: Axioms and Categoricity
inferred← citeshttps://doi.org/10.1007/3-540-56320-2_55openalex-snapshot
Formal theories and software systems: Fundamental connections between Computer Science and Logic
inferred← citeshttps://doi.org/10.1007/3-540-56883-2_9openalex-snapshot
Reasoning about functional programs in Nuprl
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_43openalex-snapshot
Exploring abstract algebra in constructive type theory
inferred← citeshttps://doi.org/10.1007/978-3-642-58041-3_2openalex-snapshot
Lectures on:Classical Proofs as Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_6openalex-snapshot
Formalizing Decidability Theorems About Automata
inferred← citeshttps://doi.org/10.1007/bf01384233openalex-snapshot
Constructing the real numbers in HOL
inferred← citeshttps://doi.org/10.1007/s00224-007-9017-6openalex-snapshot
Coinduction for Exact Real Number Computation
inferred← citeshttps://doi.org/10.1016/b978-0-444-89880-7.50016-4openalex-snapshot
Constructing the real numbers in HOL
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.09.061openalex-snapshot
A certified, corecursive implementation of exact real numbers
inferred← citeshttps://doi.org/10.1017/s0956796802004501openalex-snapshot
Setoids in type theory
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.