On the public citation graph

Importing mathematics from HOL into Nuprl

https://doi.org/10.1007/bfb0105410
0 signed · 35 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/3-540-58156-1_43openalex-snapshot
Exploring abstract algebra in constructive type theory
inferredcites →https://doi.org/10.1007/3-540-61474-5_91openalex-snapshot
PVS: Combining specification, proof checking, and model checking
inferredcites →https://doi.org/10.1007/bf01383982openalex-snapshot
The HOL logic extended with quantification over type variables
inferredcites →https://doi.org/10.1007/bfb0014309openalex-snapshot
Semantic foundations for embedding HOL in Nuprl
inferredcites →https://doi.org/10.1007/bfb0037108openalex-snapshot
Translating dependent type theory into higher order logic
inferredcites →https://doi.org/10.1016/b978-0-444-89880-7.50014-0openalex-snapshot
Introducing well-founded function definitions in HOL
inferredcites →https://doi.org/10.1016/s0049-237x(09)70189-2openalex-snapshot
Constructive Mathematics and Computer Programming
inferredcites →https://doi.org/10.7551/mitpress/2319.001.0001openalex-snapshot
The Definition of Standard ML

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10721959_12openalex-snapshot
The Nuprl Open Logical Environment
inferred← citeshttps://doi.org/10.1007/11814771_18openalex-snapshot
An Interpretation of Isabelle/HOL in HOL Light
inferred← citeshttps://doi.org/10.1007/11814771_27openalex-snapshot
Importing HOL into Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/11916277_11openalex-snapshot
An Executable Formalization of the HOL/Nuprl Connection in the Metalogical Framework Twelf
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_23openalex-snapshot
The HOL/NuPRL Proof Translator
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_9openalex-snapshot
Proving Hybrid Protocols Correct
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_34openalex-snapshot
Hybrid interactive theorem proving using nuprl and HOL
inferred← citeshttps://doi.org/10.1007/978-3-319-42432-3_3openalex-snapshot
Exercising Nuprl’s Open-Endedness
inferred← citeshttps://doi.org/10.1007/978-3-319-57708-1_8openalex-snapshot
A Proof System for MSVL Programs in Coq
inferred← citeshttps://doi.org/10.1007/978-3-319-66107-0_9openalex-snapshot
FoCaLiZe and Dedukti to the Rescue for Proof Interoperability
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_17openalex-snapshot
Bridging Theorem Proving and Mathematical Knowledge Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-540-69149-5_51openalex-snapshot
Meta-Logical Frameworks and Formal Digital Libraries
inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_6openalex-snapshot
Formalizing Decidability Theorems About Automata
inferred← citeshttps://doi.org/10.1007/978-94-010-0413-8_7openalex-snapshot
Naïve Computational Type Theory
inferred← citeshttps://doi.org/10.1007/bfb0028764openalex-snapshot
Protocol verification in Nuprl
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.005openalex-snapshot
Innovations in computational type theory using Nuprl
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80025-6openalex-snapshot
Types in Logic, Mathematics and Programming
inferred← citeshttps://doi.org/10.1017/s0956796803004854openalex-snapshot
Building reliable, high-performance networks with the Nuprl proof development system
inferred← citeshttps://doi.org/10.1017/s0960129511000156openalex-snapshot
A pluralist approach to the formalisation of mathematics
inferred← citeshttps://doi.org/10.1109/lics.2017.8005074openalex-snapshot
Bar induction: The good, the bad, and the ugly
inferred← citeshttps://doi.org/10.1145/3305261openalex-snapshot
Bar Induction is Compatible with Constructive Type Theory
inferred← citeshttps://doi.org/10.14264/7583d15openalex-snapshot
A generic proof checker
inferred← citeshttps://doi.org/10.1609/aimag.v20i1.1442openalex-snapshot
Automated Deduction: Looking Ahead
inferred← citeshttps://doi.org/10.29007/6k4xopenalex-snapshot
Translating HOL-Light proofs to Coq
inferred← citeshttps://doi.org/10.3233/fun-2005-681-205openalex-snapshot
The Open Calculus of Constructions (Part I): An Equational Type Theory with Dependent Types for Programming, Specification, and Interactive Theorem Proving
inferred← citeshttps://doi.org/10.5555/3329995.3330009openalex-snapshot
Bar induction: the good, the bad, and the ugly
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.