On the public citation graph
A Coverage Checking Algorithm for LF
0 signed · 73 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.1007/3-540-44802-0_41openalex-snapshot
Recursion for Higher-Order Encodings
inferredcites →https://doi.org/10.1007/3-540-45744-5_32openalex-snapshot
Termination and Reduction Checking for Higher-Order Logic Programs
inferredcites →https://doi.org/10.1007/3-540-48167-2_13openalex-snapshot
Algorithms for Equality and Unification in the Presence of Notational Definitions
inferredcites →https://doi.org/10.1007/3-540-48660-7_14openalex-snapshot
System Description: Twelf — A Meta-Logical Framework for Deductive Systems
inferredcites →https://doi.org/10.1007/3-540-58025-5_52openalex-snapshot
Finitary partial inductive definitions as a general logic
inferredcites →https://doi.org/10.1007/3-540-61055-3openalex-snapshot
Programming Languages and Systems — ESOP '96
inferredcites →https://doi.org/10.1007/3-540-61055-3_44openalex-snapshot
Mode and termination checking for higher-order logic programs
inferredcites →https://doi.org/10.1007/978-3-540-45085-6_22openalex-snapshot
IsaPlanner: A Prototype Proof Planner in Isabelle
inferredcites →https://doi.org/10.1007/978-3-540-45085-6_40openalex-snapshot
Optimizing Higher-Order Pattern Unification
inferredcites →https://doi.org/10.1016/0304-3975(75)90011-0openalex-snapshot
A unification algorithm for typed λ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(91)90028-zopenalex-snapshot
Author index volume 86 (1991)
inferredcites →https://doi.org/10.1016/s0304-3975(06)80007-1openalex-snapshot
Partial inductive definitions
inferredcites →https://doi.org/10.1017/cbo9780511569807.011openalex-snapshot
An algorithm for testing conversion in type theory
inferredcites →https://doi.org/10.1093/logcom/1.4.497openalex-snapshot
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
inferredcites →https://doi.org/10.1109/lics.1993.287585openalex-snapshot
Rules of definitional reflection
inferredcites →https://doi.org/10.1109/lics.1994.316071openalex-snapshot
The groupoid model refutes uniqueness of identity proofs
inferredcites →https://doi.org/10.1145/138027.138060openalex-snapshot
A framework for defining logics
inferredcites →https://doi.org/10.1145/158511.158524openalex-snapshot
Imperative functional programming
inferredcites →https://doi.org/10.1145/604131.604149openalex-snapshot
Toward a foundational typed assembly language
inferredcites →https://doi.org/10.21236/ada256574openalex-snapshot
A Proof of the Church-Rosser Theorem and its Representation in a Logical Framework
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11538363_6openalex-snapshot
Distributed Control Flow with Classical Modal Logic
inferred← citeshttps://doi.org/10.1007/11780274_27openalex-snapshot
Eliminating Dependent Pattern Matching
inferred← citeshttps://doi.org/10.1007/11814771_3openalex-snapshot
Representing and Reasoning with Operational Semantics
inferred← citeshttps://doi.org/10.1007/11814771_50openalex-snapshot
Consistency and Completeness of Rewriting in the Calculus of Constructions
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/978-3-540-24754-8_3openalex-snapshot
Twelf and Delphin: Logic and Functional Programming in a Meta-logical Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-24849-1_19openalex-snapshot
Induction and Co-induction in Sequent Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-30142-4_2openalex-snapshot
Verifying Uniqueness in a Logical Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-74591-4_19openalex-snapshot
Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF
inferred← citeshttps://doi.org/10.1007/978-3-540-78663-4_9openalex-snapshot
Type-Safe Distributed Programming with ML5
inferred← citeshttps://doi.org/10.1007/978-3-540-78739-6_7openalex-snapshot
Practical Programming with Higher-Order Encodings and Dependent Types
inferred← citeshttps://doi.org/10.1007/978-3-642-02444-3_3openalex-snapshot
A New Elimination Rule for the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1007/s10817-005-6534-3openalex-snapshot
Verifying Termination and Reduction Properties about Higher-Order Logic Programs
inferred← citeshttps://doi.org/10.1007/s10817-015-9327-3openalex-snapshot
The Next 700 Challenge Problems for Reasoning with Higher-Order Abstract Syntax Representations
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.10.037openalex-snapshot
Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.11.030openalex-snapshot
Hybridizing a Logical Framework
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.11.009openalex-snapshot
Normalization for the Simply-Typed Lambda-Calculus in Twelf
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.12.117openalex-snapshot
Case Analysis of Higher-Order Data
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.12.120openalex-snapshot
System Description: Delphin – A Functional Programming Language for Deductive Systems
inferred← citeshttps://doi.org/10.1016/j.jal.2012.07.007openalex-snapshot
Cut elimination for a logic with induction and co-induction
inferred← citeshttps://doi.org/10.1017/cbo9780511605321.005openalex-snapshot
Higher-order abstract syntax in type theory
inferred← citeshttps://doi.org/10.1017/s0956796807006430openalex-snapshot
Mechanizing metatheory in a logical framework
inferred← citeshttps://doi.org/10.1017/s0956796812000408openalex-snapshot
An insider's look at LF type reconstruction: everything you (n)ever wanted to know
inferred← citeshttps://doi.org/10.1017/s0960129517000093openalex-snapshot
Benchmarks for reasoning with syntax trees containing binders and contexts of assumptions
inferred← citeshttps://doi.org/10.1109/lics.2004.1319623openalex-snapshot
A symmetric modal lambda calculus for distributed computing
inferred← citeshttps://doi.org/10.1109/lics.2004.7openalex-snapshot
A symmetric modal lambda calculus for distributed computing
inferred← citeshttps://doi.org/10.1145/1086365.1086400openalex-snapshot
A language-based approach to functionally correct imperative programming
inferred← citeshttps://doi.org/10.1145/1090189.1086400openalex-snapshot
A language-based approach to functionally correct imperative programming
inferred← citeshttps://doi.org/10.1145/1292597.1292606openalex-snapshot
Pattern matching coverage checking with dependent types using set approximations
inferred← citeshttps://doi.org/10.1145/1328438.1328483openalex-snapshot
A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions
inferred← citeshttps://doi.org/10.1145/1599410.1599422openalex-snapshot
Reasoning with hypothetical judgments and open terms in hybrid
inferred← citeshttps://doi.org/10.1145/2103621.2103705openalex-snapshot
Programming with binders and indexed data-types
inferred← citeshttps://doi.org/10.1145/2103656.2103705openalex-snapshot
Programming with binders and indexed data-types
inferred← citeshttps://doi.org/10.1145/2503887.2503893openalex-snapshot
Towards extracting explicit proofs from totality checking in twelf
inferred← citeshttps://doi.org/10.1145/2631172.2631179openalex-snapshot
Proof-Theoretic Foundations of Indexing in Logic Programming
inferred← citeshttps://doi.org/10.1145/3704265openalex-snapshot
A Saturation-Based Unification Algorithm for Higher-Order Rational Patterns
inferred← citeshttps://doi.org/10.1145/976571.976579openalex-snapshot
Representing reductions of NP-complete problems in logical frameworks
inferred← citeshttps://doi.org/10.1145/976571.976581openalex-snapshot
A formalization of an Ordered Logical Framework in Hybrid with applications to continuation machines
inferred← citeshttps://doi.org/10.1184/r1/6603296openalex-snapshot
An Extensible Theory of Indexed Types
inferred← citeshttps://doi.org/10.4204/eptcs.197.2openalex-snapshot
Proof Outlines as Proof Certificates: A System Description
inferred← citeshttps://doi.org/10.4204/eptcs.241.2openalex-snapshot
GADTs and Exhaustiveness: Looking for the Impossible
inferred← citeshttps://doi.org/10.4230/lipics.tlca.2015.273openalex-snapshot
Well-Founded Recursion over Contextual Objects
inferred← citeshttps://doi.org/10.48550/arxiv.1503.06095openalex-snapshot
The Next 700 Challenge Problems for Reasoning with Higher-Order Abstract Syntax Representations: Part 1-A Common Infrastructure for Benchmarks
inferred← citeshttps://doi.org/10.70675/61bfbf53z121az472ez8c91ze9f6166c9a6aopenalex-snapshot
Applications of Foundational Proof Certificates in theorem proving
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.