On the public citation graph
Semantic foundations for embedding HOL in Nuprl
0 signed · 49 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.1006/inco.1996.0008openalex-snapshot
Proving Congruence of Bisimulation in Functional Programming Languages
inferredcites →https://doi.org/10.1007/3-540-54233-7_125openalex-snapshot
Logical and computational aspects of programming with sets/bags/lists
inferredcites →https://doi.org/10.1007/3-540-57887-0_89openalex-snapshot
An operational approach to combining classical set theory and functional programming languages
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-60275-5openalex-snapshot
Higher Order Logic Theorem Proving and Its Applications
inferredcites →https://doi.org/10.1007/bf01383982openalex-snapshot
The HOL logic extended with quantification over type variables
inferredcites →https://doi.org/10.1007/bfb0014067openalex-snapshot
A fully abstract translation between a λ-calculus with reference types and Standard ML
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.1017/cbo9780511569807.012openalex-snapshot
Inductive sets and families in Martin-Löf's type theory and their set-theoretic semantics
inferredcites →https://doi.org/10.1098/rsta.1984.0073openalex-snapshot
Constructive mathematics and computer programming
inferredcites →https://doi.org/10.1109/lics.1989.39174openalex-snapshot
Equality in lazy computation systems
inferredcites →https://doi.org/10.1109/lics.1991.151641openalex-snapshot
On computational open-endedness in Martin-Lof's type theory
inferredcites →https://doi.org/10.48456/tr-285openalex-snapshot
Functional programming and input/output
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.1006/jsco.2000.0468openalex-snapshot
MBase: Representing Knowledge and Context for the Integration of Mathematical Software Systems
inferred← citeshttps://doi.org/10.1007/10721975_1openalex-snapshot
Rewriting Logic and Maude: Concepts and Applications
inferred← citeshttps://doi.org/10.1007/11814771_16openalex-snapshot
Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics
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-45685-6_18openalex-snapshot
Quotient Types: A Modular Approach
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_21openalex-snapshot
Formal Metatheory Using Implicit Syntax, and an Application to Data Abstraction for Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/978-0-387-35358-6_11openalex-snapshot
Programming Language Semantics in Foundational Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-08970-6_3openalex-snapshot
Towards a Formally Verified Proof Assistant
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-642-58622-4_6openalex-snapshot
Formalizing Decidability Theorems About Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-59048-1_4openalex-snapshot
The Structure of Nuprl’s Type Theory
inferred← citeshttps://doi.org/10.1007/978-94-010-0413-8_7openalex-snapshot
Naïve Computational Type Theory
inferred← citeshttps://doi.org/10.1007/978-94-017-0253-9_3openalex-snapshot
Recent Results in Type Theory and Their Relationship to Automath
inferred← citeshttps://doi.org/10.1007/bfb0055138openalex-snapshot
A type annotation scheme for Nuprl
inferred← citeshttps://doi.org/10.1007/bfb0105410openalex-snapshot
Importing mathematics from HOL into Nuprl
inferred← citeshttps://doi.org/10.1016/b978-0-444-51621-3.50011-6openalex-snapshot
Russell's Orders in Kripke's Theory of Truth and Computational Type Theory
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.1016/s0304-3975(99)00169-3openalex-snapshot
Proof-search in type-theoretic languages: an introduction
inferred← citeshttps://doi.org/10.1017/s0960129517000172openalex-snapshot
Validating Brouwer's continuity principle for numbers using named exceptions
inferred← citeshttps://doi.org/10.1109/lics.2012.9openalex-snapshot
On Building Constructive Formal Theories of Computation Noting the Roles of Turing, Church, and Brouwer
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/2854065.2854077openalex-snapshot
A nominal exploration of intuitionism
inferred← citeshttps://doi.org/10.1145/3305261openalex-snapshot
Bar Induction is Compatible with Constructive Type Theory
inferred← citeshttps://doi.org/10.2168/lmcs-4(3:5)2008openalex-snapshot
Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics
inferred← citeshttps://doi.org/10.29007/f58nopenalex-snapshot
A Verified Theorem Prover Backend Supported by a Monotonic Library
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.48550/arxiv.1912.03028openalex-snapshot
A Survey on Theorem Provers in Formal Methods
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.