On the public citation graph

Type classes and overloading in higher-order logic

https://doi.org/10.1007/bfb0028402
0 signed · 125 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-94-015-9934-4openalex-snapshot
An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof
inferredcites →https://doi.org/10.1007/bf00248324openalex-snapshot
The foundation of a generic theorem prover
inferredcites →https://doi.org/10.1007/bfb0024065openalex-snapshot
Computational Aspects of an Order-Sorted Logic with Term Declarations
inferredcites →https://doi.org/10.1007/bfb0030541openalex-snapshot
Isabelle
inferredcites →https://doi.org/10.1007/bfb0105405openalex-snapshot
Set theory, higher order logic or both?
inferredcites →https://doi.org/10.1145/130697.130699openalex-snapshot
Report on the programming language Haskell
inferredcites →https://doi.org/10.1145/158511.158698openalex-snapshot
Type checking type classes
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types
inferredcites →https://doi.org/10.2307/2266967openalex-snapshot
Completeness in the theory of types
inferredcites →https://doi.org/10.2307/2274454openalex-snapshot
Peter B. Andrews. An introduction to mathematical logic and type theory: to truth through proof. Computer science and applied mathematics. Academic Press, Orlando etc. 1986, xv + 304 pp.

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/11805618_16openalex-snapshot
Checking Conservativity of Overloaded Definitions in Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/11812289_4openalex-snapshot
Interpretation of Locales in Isabelle: Theories and Proof Contexts
inferred← citeshttps://doi.org/10.1007/11814771_18openalex-snapshot
An Interpretation of Isabelle/HOL in HOL Light
inferred← citeshttps://doi.org/10.1007/3-540-39185-1_2openalex-snapshot
Program Extraction in Simply-Typed Higher Order Logic
inferred← citeshttps://doi.org/10.1007/3-540-44557-9_4openalex-snapshot
Computer-Assisted Mathematics at Work
inferred← citeshttps://doi.org/10.1007/3-540-45607-4_11openalex-snapshot
A Framework for Developing Embeddable Customized Logics
inferred← citeshttps://doi.org/10.1007/3-540-45620-1_31openalex-snapshot
The Reflection Theorem: A Study in Meta-theoretic Reasoning
inferred← citeshttps://doi.org/10.1007/3-540-45719-4_8openalex-snapshot
HasCasl: Towards Integrated Specification and Development of Functional Programs
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_18openalex-snapshot
From I/O Automata to Timed I/O Automata
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_2openalex-snapshot
Disjoint Sums over Type Classes in HOL
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_3openalex-snapshot
Inductive Datatypes in HOL — Lessons Learned in Formal-Logic Engineering
inferred← citeshttps://doi.org/10.1007/3-540-62034-6_48openalex-snapshot
Winskel is (almost) right
inferred← citeshttps://doi.org/10.1007/978-3-030-15655-8_20openalex-snapshot
Formalising Mathematics in Simple Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-19071-2_64-1openalex-snapshot
The Design of Mathematical Language
inferred← citeshttps://doi.org/10.1007/978-3-030-64276-1_2openalex-snapshot
Proof-Theoretic Conservative Extension of HOL with Ad-hoc Overloading
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_6openalex-snapshot
Isabelle’s Metalogic: Formalization and Proof Checker
inferred← citeshttps://doi.org/10.1007/978-3-031-16681-5_6openalex-snapshot
Wetzel: Formalisation of an Undecidable Problem Linked to the Continuum Hypothesis
inferred← citeshttps://doi.org/10.1007/978-3-031-40846-5_64openalex-snapshot
The Design of Mathematical Language
inferred← citeshttps://doi.org/10.1007/978-3-319-22102-1_16openalex-snapshot
A Consistent Foundation for Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-319-43144-4_13openalex-snapshot
From Types to Sets by Local Type Definitions in Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-66107-0_25openalex-snapshot
Effect Polymorphism in Higher-Order Logic (Proof Pearl)
inferred← citeshttps://doi.org/10.1007/978-3-319-71237-6_13openalex-snapshot
Verified Root-Balanced Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-89363-1_9openalex-snapshot
Hierarchical Specification and Verification of Architectural Design Patterns
inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_35openalex-snapshot
A Verified Compiler from Isabelle/HOL to CakeML
inferred← citeshttps://doi.org/10.1007/978-3-540-24771-5_16openalex-snapshot
Calculational Relation-Algebraic Proofs in Isabelle/Isar
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_27openalex-snapshot
Formalizing O Notation in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_28openalex-snapshot
Experiments on Supporting Interactive Proof Using Resolution
inferred← citeshttps://doi.org/10.1007/978-3-540-30498-2_39openalex-snapshot
Towards CNC Programming Using Haskell
inferred← citeshttps://doi.org/10.1007/978-3-540-31959-7_14openalex-snapshot
Type Class Polymorphism in an Institutional Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-71067-7_23openalex-snapshot
First-Class Type Classes
inferred← citeshttps://doi.org/10.1007/978-3-540-71067-7_7openalex-snapshot
The Isabelle Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-73086-6_3openalex-snapshot
Context Aware Calculation and Deduction
inferred← citeshttps://doi.org/10.1007/978-3-540-74464-1_11openalex-snapshot
Constructive Type Classes in Isabelle
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-85110-3_20openalex-snapshot
Parametric Linear Arithmetic over Ordered Fields in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-642-02444-3_10openalex-snapshot
Local Theory Specifications in Isabelle/Isar
inferred← citeshttps://doi.org/10.1007/978-3-642-03359-9_8openalex-snapshot
Hints in Unification
inferred← citeshttps://doi.org/10.1007/978-3-642-13977-2_11openalex-snapshot
Relational Analysis of (Co)inductive Predicates, (Co)algebraic Datatypes, and (Co)recursive Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-14052-5_23openalex-snapshot
A Mechanized Translation from Higher-Order Logic to Set Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-22438-6_11openalex-snapshot
Extending Sledgehammer with SMT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-22438-6_7openalex-snapshot
The Matita Interactive Theorem Prover
inferred← citeshttps://doi.org/10.1007/978-3-642-24364-6_2openalex-snapshot
Automatic Proof and Disproof in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-642-24559-6_42openalex-snapshot
Term Rewriting in Logics of Partial Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-35308-6_10openalex-snapshot
The New Quickcheck for Isabelle
inferred← citeshttps://doi.org/10.1007/978-3-642-35308-6_19openalex-snapshot
Rating Disambiguation Errors
inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_34openalex-snapshot
Encoding Monomorphic and Polymorphic Types
inferred← citeshttps://doi.org/10.1007/978-3-662-54434-1_27openalex-snapshot
Comprehending Isabelle/HOL’s Consistency
inferred← citeshttps://doi.org/10.1007/bfb0028401openalex-snapshot
Higher order quotients and their implementation in Isabelle HOL
inferred← citeshttps://doi.org/10.1007/bfb0055133openalex-snapshot
A comparison of PVS and Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/bfb0055146openalex-snapshot
Object-oriented verification based on record subtyping in Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/s00165-019-00492-1openalex-snapshot
From LCF to Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/s001650050009openalex-snapshot
Winskel is (almost) Right: Towards a Mechanized Semantics Textbook
inferred← citeshttps://doi.org/10.1007/s10817-004-3997-6openalex-snapshot
Organizing Numerical Theories Using Axiomatic Type Classes
inferred← citeshttps://doi.org/10.1007/s10817-007-9070-5openalex-snapshot
User Interaction with the Matita Proof Assistant
inferred← citeshttps://doi.org/10.1007/s10817-009-9120-2openalex-snapshot
Formal Verification of C Systems Code
inferred← citeshttps://doi.org/10.1007/s10817-010-9195-9openalex-snapshot
Formal Power Series
inferred← citeshttps://doi.org/10.1007/s10817-013-9278-5openalex-snapshot
Extending Sledgehammer with SMT Solvers
inferred← citeshttps://doi.org/10.1007/s10817-013-9284-7openalex-snapshot
Locales: A Module System for Mathematical Theories
inferred← citeshttps://doi.org/10.1007/s10817-015-9335-3openalex-snapshot
Semi-intelligible Isar Proofs from Machine-Generated Proofs
inferred← citeshttps://doi.org/10.1007/s10817-017-9404-xopenalex-snapshot
A Formally Verified Proof of the Central Limit Theorem
inferred← citeshttps://doi.org/10.1007/s10817-018-9454-8openalex-snapshot
A Consistent Foundation for Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/s10817-018-9464-6openalex-snapshot
From Types to Sets by Local Type Definition in Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/s10817-018-9476-2openalex-snapshot
Effect Polymorphism in Higher-Order Logic (Proof Pearl)
inferred← citeshttps://doi.org/10.1007/s10817-018-9495-zopenalex-snapshot
An Isabelle/HOL Formalisation of Green’s Theorem
inferred← citeshttps://doi.org/10.1007/s10817-022-09648-wopenalex-snapshot
A Formalization and Proof Checker for Isabelle’s Metalogic
inferred← citeshttps://doi.org/10.1007/s10817-024-09712-7openalex-snapshot
Use and Abuse of Instance Parameters in the Lean Mathematical Library
inferred← citeshttps://doi.org/10.1007/s11219-011-9148-5openalex-snapshot
Relational analysis of (co)inductive predicates, (co)algebraic datatypes, and (co)recursive functions
inferred← citeshttps://doi.org/10.1007/s11225-024-10097-2openalex-snapshot
Stefania Centrone, Deborah Kant, Deniz Serikaya, Reflections on the Foundations of Mathematics. Univalent Foundations, Set Theory and General Thoughts, vol. 407 of Synthese Library, Springer, 2019, pp. 494+xxviii; ISBN: 978-3-030-15654-1 (Hardcover) 149.79€, ISBN: 978-3-030-15655-8 (eBook).
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.10.027openalex-snapshot
Bounded Model Generation for Isabelle/HOL
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.06.041openalex-snapshot
Structured Types and Separation Logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2018.10.009openalex-snapshot
Model-Theoretic Conservative Extension for Definitional Theories
inferred← citeshttps://doi.org/10.1016/j.ic.2005.05.010openalex-snapshot
Automation for interactive proof: First prototype
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.007openalex-snapshot
A proof-centric approach to mathematical assistants
inferred← citeshttps://doi.org/10.1016/j.jal.2012.12.002openalex-snapshot
LEO-II and Satallax on the Sledgehammer test bench
inferred← citeshttps://doi.org/10.1017/s095679689900341xopenalex-snapshot
HOLCF = HOL + LCF
inferred← citeshttps://doi.org/10.1017/s0960129509990041openalex-snapshot
Social processes, program verification and all that
inferred← citeshttps://doi.org/10.1080/10586458.2022.2062073openalex-snapshot
Simple Type Theory is not too Simple: Grothendieck’s Schemes Without Dependent Types
inferred← citeshttps://doi.org/10.1098/rspa.2017.0872openalex-snapshot
Computational logic: its origins and applications
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00008openalex-snapshot
Completing Gordon’s Higher-Order Logic
inferred← citeshttps://doi.org/10.1145/1190215.1190234openalex-snapshot
Types, bytes, and separation logic
inferred← citeshttps://doi.org/10.1145/1297658.1297660openalex-snapshot
A formally verified proof of the prime number theorem
inferred← citeshttps://doi.org/10.1145/1577824.1577827openalex-snapshot
Theory support for weak higher order abstract syntax in Isabelle/HOL
inferred← citeshttps://doi.org/10.1145/2364527.2364532openalex-snapshot
Formal verification of monad transformers
inferred← citeshttps://doi.org/10.1145/2398856.2364532openalex-snapshot
Formal verification of monad transformers
inferred← citeshttps://doi.org/10.1145/2676724.2693175openalex-snapshot
Correctness of Isabelle's Cyclicity Checker
inferred← citeshttps://doi.org/10.1145/3158112openalex-snapshot
Safety and conservativity of definitions in HOL and Isabelle/HOL
inferred← citeshttps://doi.org/10.1145/3372885.3373824openalex-snapshot
The lean mathematical library
inferred← citeshttps://doi.org/10.1145/3497775.3503674openalex-snapshot
An extension of the framework types-to-sets for Isabelle/HOL
inferred← citeshttps://doi.org/10.1145/3546189.3549919openalex-snapshot
How to safely use extensionality in Liquid Haskell
inferred← citeshttps://doi.org/10.1145/3573105.3575679openalex-snapshot
Encoding Dependently-Typed Constructions into Simple Type Theory
inferred← citeshttps://doi.org/10.1145/3607833openalex-snapshot
Flexible Instruction-Set Semantics via Abstract Monads (Experience Report)
inferred← citeshttps://doi.org/10.1184/r1/6492326openalex-snapshot
Notes on a Formalization of the Prime Number Theorem
inferred← citeshttps://doi.org/10.17863/cam.23736openalex-snapshot
Computational logic: its origins and applications.
inferred← citeshttps://doi.org/10.20381/ruor-4338openalex-snapshot
Reasoning Using Higher-Order Abstract Syntax in a Higher-Order Logic Proof Environment: Improvements to Hybrid and a Case Study
inferred← citeshttps://doi.org/10.2168/lmcs-2014-1018openalex-snapshot
Encoding Monomorphic and Polymorphic Types
inferred← citeshttps://doi.org/10.2307/j.ctv36xw0k5.4openalex-snapshot
Proof Support for General Type Classes
inferred← citeshttps://doi.org/10.26190/unsworks/17927openalex-snapshot
Formal memory models for verifying C systems code
inferred← citeshttps://doi.org/10.29007/36dtopenalex-snapshot
Three years of experience with Sledgehammer, a Practical Link Between Automatic and Interactive Theorem Provers
inferred← citeshttps://doi.org/10.29007/8v2fopenalex-snapshot
Polymorphic+Typeclass Superposition
inferred← citeshttps://doi.org/10.29007/tnfdopenalex-snapshot
Three Years of Experience with Sledgehammer, a Practical Link between Automatic and Interactive Theorem Provers
inferred← citeshttps://doi.org/10.29007/zbdbopenalex-snapshot
Robust, Semi-Intelligible Isabelle Proofs from ATP Proofs
inferred← citeshttps://doi.org/10.3929/ethz-a-006750722openalex-snapshot
Term rewriting in logics of partial functions
inferred← citeshttps://doi.org/10.4204/eptcs.210.3openalex-snapshot
Extending Nunchaku to Dependent Type Theory
inferred← citeshttps://doi.org/10.4204/eptcs.307.5openalex-snapshot
Rapid Prototyping Formal Systems in MMT: 5 Case Studies
inferred← citeshttps://doi.org/10.4204/eptcs.332openalex-snapshot
Proceedings Fifteenth Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
inferred← citeshttps://doi.org/10.4204/eptcs.332.1openalex-snapshot
Mechanisation of Model-theoretic Conservative Extension for HOL with Ad-hoc Overloading
inferred← citeshttps://doi.org/10.4230/lipics.itp.2025.26openalex-snapshot
Improving the SMT Proof Reconstruction Pipeline in Isabelle/HOL
inferred← citeshttps://doi.org/10.48456/tr-283openalex-snapshot
The Isabelle reference manual
inferred← citeshttps://doi.org/10.48456/tr-872openalex-snapshot
The integration of higher order interactive proof with first order automatic theorem proving
inferred← citeshttps://doi.org/10.5463/thesis.541openalex-snapshot
Formalizing Fundamental Algebraic Number Theory
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/3754openalex-snapshot
Theoretical and implementation aspects in the mechanization of the metatheory of programming languages
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/616openalex-snapshot
User interaction widgets for interactive theorem proving
inferred← citeshttps://doi.org/10.70675/71f26983z5247z4693z82f8zf54d904938ebopenalex-snapshot
Model-based Testing of Operating System-Level Security Mechanisms
inferred← citeshttps://doi.org/10.70675/d2678bfbz03e4z436czbe88ze142a4922d6eopenalex-snapshot
Constructing Semantically Sound Object-Logics for UML/OCL Based Domain-Specific Languages
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.