On the public citation graph

Higher order quotients and their implementation in Isabelle HOL

https://doi.org/10.1007/bfb0028401
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/978-1-4471-1591-5openalex-snapshot
Theorem Proving with the Real Numbers
inferredcites →https://doi.org/10.1007/978-1-4899-4489-4_1openalex-snapshot
Introduction
inferredcites →https://doi.org/10.1007/bfb0014426openalex-snapshot
Behavioural theories
inferredcites →https://doi.org/10.1007/bfb0028402openalex-snapshot
Type classes and overloading in higher-order logic
inferredcites →https://doi.org/10.1007/bfb0030541openalex-snapshot
Isabelle
inferredcites →https://doi.org/10.1016/0304-3975(96)00039-4openalex-snapshot
Behavioural theories and the proof of behavioural properties
inferredcites →https://doi.org/10.1109/lics.1989.39165openalex-snapshot
How complete is PER?
inferredcites →https://doi.org/10.1145/130697.130699openalex-snapshot
Report on the programming language Haskell
inferredcites →https://doi.org/10.1145/143165.143230openalex-snapshot
PER models of subtyping, recursive types and higher-order polymorphism
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_9openalex-snapshot
A Design Structure for Higher Order Quotients
inferred← citeshttps://doi.org/10.1007/978-3-030-51054-1_4openalex-snapshot
Quotients of Bounded Natural Functors
inferred← citeshttps://doi.org/10.1007/978-3-319-03545-1_9openalex-snapshot
Lifting and Transfer: A Modular Design for Quotients in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-642-14128-7_5openalex-snapshot
Structured Formal Development with Quotient Types in Isabelle/HOL
inferred← citeshttps://doi.org/10.1017/s095679689900341xopenalex-snapshot
HOLCF = HOL + LCF
inferred← citeshttps://doi.org/10.1145/1183278.1183280openalex-snapshot
Defining functions on equivalence classes
inferred← citeshttps://doi.org/10.1145/1982185.1982529openalex-snapshot
Quotients revisited for Isabelle/HOL
inferred← citeshttps://doi.org/10.1145/3632869openalex-snapshot
Quotient Haskell: Lightweight Quotient Types for All
inferred← citeshttps://doi.org/10.1561/2500000045openalex-snapshot
QED at Large: A Survey of Engineering of Formally Verified Software
inferred← citeshttps://doi.org/10.46298/lmcs-18(1:23)2022openalex-snapshot
Quotients of Bounded Natural Functors
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.