On the public citation graph

Applications of Polytypism in Theorem Proving

0 signed · 34 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-44659-1_2openalex-snapshot
Programming and Computing in HOL
inferredcites →https://doi.org/10.1007/3-540-44659-1_5openalex-snapshot
Recursive Families of Inductive Types
inferredcites →https://doi.org/10.1007/3-540-44957-4_42openalex-snapshot
Automatic Derivation and Application of Induction Schemes for Mutually Recursive Functions
inferredcites →https://doi.org/10.1007/3-540-45413-6_15openalex-snapshot
Normalization by Evaluation for the Computational Lambda-Calculus
inferredcites →https://doi.org/10.1007/3-540-45607-4_1openalex-snapshot
Static Analysis for Safe Destructive Updates in a Functional Language
inferredcites →https://doi.org/10.1007/3-540-45685-6_15openalex-snapshot
PuzzleTool: An Example of Programming Computation and Deduction
inferredcites →https://doi.org/10.1007/3-540-45842-5_2openalex-snapshot
Executing Higher Order Logic
inferredcites →https://doi.org/10.1007/3-540-45927-8_8openalex-snapshot
Higher-Order Intensional Type Analysis
inferredcites →https://doi.org/10.1007/3-540-48256-3_3openalex-snapshot
Inductive Datatypes in HOL — Lessons Learned in Formal-Logic Engineering
inferredcites →https://doi.org/10.1007/3-540-49519-3_22openalex-snapshot
Symbolic Simulation: An ACL2 Approach
inferredcites →https://doi.org/10.1007/3-540-57826-9_131openalex-snapshot
A broader class of trees for recursive type definitions for HOL
inferredcites →https://doi.org/10.1007/3-540-60275-5_66openalex-snapshot
Inductive definitions: Automation and application
inferredcites →https://doi.org/10.1007/3-540-60360-3_38openalex-snapshot
Termination analysis for functional programs using term orderings
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.1016/j.scico.2003.07.001openalex-snapshot
Type-indexed data types
inferredcites →https://doi.org/10.1016/s0065-2458(03)58003-2openalex-snapshot
Bounded Model Checking
inferredcites →https://doi.org/10.1093/comjnl/45.1.37openalex-snapshot
A Thread of HOL Development
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.1991.151645openalex-snapshot
An inverse of the evaluation functional for typed lambda -calculus
inferredcites →https://doi.org/10.1112/s1461157000000693openalex-snapshot
Programming Combinations of Deduction and BDD-based Symbolic Calculation
inferredcites →https://doi.org/10.1145/325694.325709openalex-snapshot
A new approach to generic functional programming
inferredcites →https://doi.org/10.1145/581478.581501openalex-snapshot
A compiled implementation of strong reduction
inferredcites →https://doi.org/10.48456/tr-545openalex-snapshot
A HOL specification of the ARM instruction set architecture
inferredcites →https://doi.org/10.48456/tr-548openalex-snapshot
Formal verification of the ARM6 micro-architecture

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11591191_36openalex-snapshot
Functional Correctness Proofs of Encryption Algorithms
inferred← citeshttps://doi.org/10.1007/11916277_25openalex-snapshot
Verification Condition Generation Via Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-1-4419-5998-0_5openalex-snapshot
Operational Semantics and Assertional Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-319-22102-1_28openalex-snapshot
Deriving Comparators and Show Functions in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-540-31848-4_2openalex-snapshot
Symbolic Test Case Generation for Primitive Recursive Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-74591-4_20openalex-snapshot
Automatically Translating Type and Function Definitions from HOL to ACL2
inferred← citeshttps://doi.org/10.1007/s10990-008-9038-0openalex-snapshot
Adapting functional programs to higher order logic
inferred← citeshttps://doi.org/10.1109/fmcad.2006.6openalex-snapshot
An Integration of HOL and ACL2
inferred← citeshttps://doi.org/10.1109/sefm.2004.1347524openalex-snapshot
Random testing in Isabelle/HOL
inferred← citeshttps://doi.org/10.1109/sefm.2004.36openalex-snapshot
Random testing in Isabelle/HOL
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.