On the public citation graph

The HOL logic extended with quantification over type variables

https://doi.org/10.1007/bf01383982
0 signed · 18 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.1016/0304-3975(86)90044-7openalex-snapshot
The system F of variable types, fifteen years later
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7057-0openalex-snapshot
A Transfinite Type Theory with Type Variables
inferredcites →https://doi.org/10.1109/hol.1991.596299openalex-snapshot
A Package For Inductive Relation Definitions In HOL
inferredcites →https://doi.org/10.11575/prism/20004openalex-snapshot
An Implementation of higher order logic
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types

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_10openalex-snapshot
Axiomatic Constructor Classes in Isabelle/HOLCF
inferred← citeshttps://doi.org/10.1007/11814771_17openalex-snapshot
Towards Self-verification of HOL Light
inferred← citeshttps://doi.org/10.1007/3-540-57826-9_149openalex-snapshot
Modelling bit vectors in HOL: The word library
inferred← citeshttps://doi.org/10.1007/3-540-60275-5_66openalex-snapshot
Inductive definitions: Automation and application
inferred← citeshttps://doi.org/10.1007/978-3-540-74591-4_18openalex-snapshot
Source-Level Proof Reconstruction for Interactive Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-540-74591-4_25openalex-snapshot
HOL2P - A System of Classical Higher Order Logic with Second Order Polymorphism
inferred← citeshttps://doi.org/10.1007/978-3-642-03359-9_18openalex-snapshot
The HOL-Omega Logic
inferred← citeshttps://doi.org/10.1007/bfb0014309openalex-snapshot
Semantic foundations for embedding HOL in Nuprl
inferred← citeshttps://doi.org/10.1007/bfb0055135openalex-snapshot
Formalizing basic first order model theory
inferred← citeshttps://doi.org/10.1007/bfb0105410openalex-snapshot
Importing mathematics from HOL into Nuprl
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50004-6openalex-snapshot
History of Interactive Theorem Proving
inferred← citeshttps://doi.org/10.29007/grmxopenalex-snapshot
Leo-III Version 1.1 (System description)
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.