On the public citation graph
Translating dependent type theory into higher order logic
0 signed · 27 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.1007/978-1-4612-3658-0_9openalex-snapshot
Automating Recursive Type Definitions in Higher Order Logic
inferredcites →https://doi.org/10.1007/978-1-4613-2007-4_3openalex-snapshot
HOL: A Proof Generating System for Higher-Order Logic
inferredcites →https://doi.org/10.1016/0304-3975(87)90047-8openalex-snapshot
On the syntax of Martin-Löf's type theories
inferredcites →https://doi.org/10.1017/cbo9780511569807.010openalex-snapshot
Encoding dependent types in an intuitionistic logic
inferredcites →https://doi.org/10.1098/rsta.1992.0025openalex-snapshot
Using Nuprl for the verification and synthesis of hardware
inferredcites →https://doi.org/10.1109/32.58783openalex-snapshot
Specification and verification using dependent types
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types
inferredcites →https://doi.org/10.48456/tr-68openalex-snapshot
HOL A machine oriented formulation of higher order logic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11541868_15openalex-snapshot
Proving Bounds for Real Linear Programs in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_15openalex-snapshot
Abstraction and Refinement in Higher Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-38499-8_25openalex-snapshot
Theorem Proving in Dependently-Typed Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-03429-9_21openalex-snapshot
Translating a Dependently-Typed Logic to First-Order Logic
inferred← citeshttps://doi.org/10.1007/bfb0014309openalex-snapshot
Semantic foundations for embedding HOL in Nuprl
inferred← citeshttps://doi.org/10.1007/bfb0021713openalex-snapshot
Strongly-typed theory of structures and behaviours
inferred← citeshttps://doi.org/10.1007/bfb0028403openalex-snapshot
A comparative study of Coq and HOL
inferred← citeshttps://doi.org/10.1007/bfb0105410openalex-snapshot
Importing mathematics from HOL into Nuprl
inferred← citeshttps://doi.org/10.1016/j.jal.2007.11.001openalex-snapshot
The seven virtues of simple type theory
inferred← citeshttps://doi.org/10.1145/3290351openalex-snapshot
Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, Bayesian inference, and optimization
inferred← citeshttps://doi.org/10.4204/eptcs.210.3openalex-snapshot
Extending Nunchaku to Dependent Type Theory
inferred← citeshttps://doi.org/10.7146/brics.v1i44.21598openalex-snapshot
A HOL Basis for Reasoning about Functional Programs
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.