On the public citation graph
Specifying theorem provers in a higher-order logic programming language
0 signed · 94 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-16492-8_94openalex-snapshot
Higher-order logic programming
inferredcites →https://doi.org/10.1007/bf00245294openalex-snapshot
Using typed lambda calculus to implement formal systems on a machine
inferredcites →https://doi.org/10.1016/0004-3702(77)90012-1openalex-snapshot
Non-resolution theorem proving
inferredcites →https://doi.org/10.1016/0304-3975(75)90011-0openalex-snapshot
A unification algorithm for typed λ-calculus
inferredcites →https://doi.org/10.1016/0743-1066(86)90015-4openalex-snapshot
Natural deduction as higher-order resolution
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7039-9openalex-snapshot
The Collected Papers of Gerhard Gentzen
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types
inferredcites →https://doi.org/10.3115/981131.981165openalex-snapshot
Some uses of higher-order logic in computational linguistics
inferredcites →https://doi.org/10.48456/tr-113openalex-snapshot
The representation of logics in higher-order logic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1994.1036openalex-snapshot
Logic Programming in a Fragment of Intuitionistic Linear Logic
inferred← citeshttps://doi.org/10.1006/jsco.1999.0346openalex-snapshot
Program Development Schemata as Derived Rules
inferred← citeshttps://doi.org/10.1007/11591191_25openalex-snapshot
On the Specification of Sequent Systems
inferred← citeshttps://doi.org/10.1007/3-540-45616-3_2openalex-snapshot
Using Linear Logic to Reason about Sequent Systems
inferred← citeshttps://doi.org/10.1007/3-540-45685-6_2openalex-snapshot
Higher Order Unification 30 Years Later
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_104openalex-snapshot
Higher-order unification with dependent function types
inferred← citeshttps://doi.org/10.1007/3-540-51305-1_13openalex-snapshot
Deriving mixed evaluation from standard evaluation for a simple functional language
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_83openalex-snapshot
Tactical theorem proving in program verification
inferred← citeshttps://doi.org/10.1007/3-540-54967-6_61openalex-snapshot
On the operational interpretation of complex types
inferred← citeshttps://doi.org/10.1007/3-540-55460-2_24openalex-snapshot
Abstract syntax and logic programming
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_189openalex-snapshot
Proof search in the intuitionistic sequent calculus
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_191openalex-snapshot
Tactic-based theorem proving and knowledge-based forward chaining: An experiment with Nuprl and Ontic
inferred← citeshttps://doi.org/10.1007/3-540-55844-6_145openalex-snapshot
A bottom-up interpreter for a higher-order logic programming language
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_93openalex-snapshot
Intuitionistic resolution for a logic programming language with scoping constructs
inferred← citeshttps://doi.org/10.1007/3-540-58025-5_52openalex-snapshot
Finitary partial inductive definitions as a general logic
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_67openalex-snapshot
EUODHILOS-II on top of GNU epoch
inferred← citeshttps://doi.org/10.1007/3-540-58216-9_26openalex-snapshot
Program tactics and logic tactics
inferred← citeshttps://doi.org/10.1007/3-540-61064-2_33openalex-snapshot
The practice of logical frameworks
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_7openalex-snapshot
Designing Unification Procedures Using Transformations: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4613-0609-2_4openalex-snapshot
Constructive Mathematics and Computer-Assisted Reasoning Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-32592-1_5openalex-snapshot
Automating Proof Search when Equality is a Logical Connective
inferred← citeshttps://doi.org/10.1007/978-3-540-25951-0_2openalex-snapshot
Synthesis of Programs in Computational Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_42openalex-snapshot
Focusing in Linear Meta-logic
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_26openalex-snapshot
α lean TA P: A Declarative Theorem Prover for First-Order Classical Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-58041-3_2openalex-snapshot
Lectures on:Classical Proofs as Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_11openalex-snapshot
Sequent Calculus and the Specification of Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-76799-9_2openalex-snapshot
Fundamentals of Deductive Program Synthesis
inferred← citeshttps://doi.org/10.1007/978-94-010-0413-8_5openalex-snapshot
Logical Frameworks—A Brief Introduction
inferred← citeshttps://doi.org/10.1007/bf00245294openalex-snapshot
Using typed lambda calculus to implement formal systems on a machine
inferred← citeshttps://doi.org/10.1007/bf00248324openalex-snapshot
The foundation of a generic theorem prover
inferred← citeshttps://doi.org/10.1007/bf00881900openalex-snapshot
Implementing tactics and tacticals in a higher-order logic programming language
inferred← citeshttps://doi.org/10.1007/bf00881902openalex-snapshot
A proof procedure for the logic of hereditary Harrop formulas
inferred← citeshttps://doi.org/10.1007/bf00993253openalex-snapshot
Higher-order and modal logic as a framework for explanation-based generalization
inferred← citeshttps://doi.org/10.1007/bf01995105openalex-snapshot
Theo: An interactive proof development system
inferred← citeshttps://doi.org/10.1007/bfb0012882openalex-snapshot
λProlog: An extended logic programming language
inferred← citeshttps://doi.org/10.1007/bfb0013606openalex-snapshot
A logic programming approach to implementing higher-Order term rewriting
inferred← citeshttps://doi.org/10.1007/bfb0014564openalex-snapshot
Extending a logical framework with a modal connective for validity
inferred← citeshttps://doi.org/10.1007/bfb0018435openalex-snapshot
Semantic interpretation as higher-order deduction
inferred← citeshttps://doi.org/10.1007/bfb0038693openalex-snapshot
Some applications of Gentzen's proof theory in automated deduction
inferred← citeshttps://doi.org/10.1007/bfb0038694openalex-snapshot
A logic program for transforming sequent proofs to natural deduction proofs
inferred← citeshttps://doi.org/10.1007/bfb0038696openalex-snapshot
Extensions to logic programming motivated by the construction of a generic theorem prover
inferred← citeshttps://doi.org/10.1007/bfb0038698openalex-snapshot
A logic programming language with lambda-abstraction, function variables, and simple unification
inferred← citeshttps://doi.org/10.1007/s10817-010-9182-1openalex-snapshot
A Framework for Proof Systems
inferred← citeshttps://doi.org/10.1007/s10817-018-9483-3openalex-snapshot
Mechanized Metatheory Revisited
inferred← citeshttps://doi.org/10.1016/0167-6423(89)90038-5openalex-snapshot
Equational reasoning in Isabelle
inferred← citeshttps://doi.org/10.1016/0167-6423(91)90038-yopenalex-snapshot
Resolution and type theory
inferred← citeshttps://doi.org/10.1016/0167-739x(96)88792-9openalex-snapshot
Towards provably correct system synthesis and extension
inferred← citeshttps://doi.org/10.1016/0168-0072(91)90068-wopenalex-snapshot
Uniform proofs as a foundation for logic programming
inferred← citeshttps://doi.org/10.1016/0747-7171(92)90011-ropenalex-snapshot
Unification under a mixed prefix
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.008openalex-snapshot
A formal framework for specifying sequent calculus proof systems
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80023-9openalex-snapshot
Higher-order unification revisited: Complete sets of transformations
inferred← citeshttps://doi.org/10.1017/9781316755921.010openalex-snapshot
Linear logic as a framework for specifying sequent calculus
inferred← citeshttps://doi.org/10.1017/cbo9780511550850.004openalex-snapshot
An Overview of Linear Logic Programming
inferred← citeshttps://doi.org/10.1017/s0960129518000427openalex-snapshot
Implementing type theory in higher order constraint logic programming
inferred← citeshttps://doi.org/10.1023/a:1022676712939openalex-snapshot
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization
inferred← citeshttps://doi.org/10.1093/logcom/1.4.497openalex-snapshot
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
inferred← citeshttps://doi.org/10.1093/logcom/7.6.685openalex-snapshot
Labelled propositional modal logics: theory and practice
inferred← citeshttps://doi.org/10.1093/oso/9780198537922.003.0011openalex-snapshot
Higher-Order Logic Programming
inferred← citeshttps://doi.org/10.1109/32.153379openalex-snapshot
Fundamentals of deductive program synthesis
inferred← citeshttps://doi.org/10.1109/cds.1998.675775openalex-snapshot
Achieving middleware customization in a configuration-based development environment: experience with the Aster prototype
inferred← citeshttps://doi.org/10.1109/icsmc.1988.754268openalex-snapshot
Explaining modal logic proofs
inferred← citeshttps://doi.org/10.1109/iwssd.1993.315502openalex-snapshot
A framework for program development based on schematic proof
inferred← citeshttps://doi.org/10.1109/lics.1989.39186openalex-snapshot
Elf: a language for logic definition and verified metaprogramming
inferred← citeshttps://doi.org/10.1109/lics.1991.151628openalex-snapshot
Logic programming in a fragment of intuitionistic linear logic
inferred← citeshttps://doi.org/10.1109/lics.1997.614968openalex-snapshot
A logic for reasoning with higher-order abstract syntax
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175827openalex-snapshot
A system of inference based on proof search: an extended abstract
inferred← citeshttps://doi.org/10.1145/1094622.1094628openalex-snapshot
A proof theory for generic judgments
inferred← citeshttps://doi.org/10.1145/2966268.2966272openalex-snapshot
Implementing HOL in an Higher Order Logic Programming Language
inferred← citeshttps://doi.org/10.1145/3678232.3678233openalex-snapshot
Higher-Order unification for free!: Reusing the meta-language unification for the object language
inferred← citeshttps://doi.org/10.1145/504077.504080openalex-snapshot
Reasoning with higher-order abstract syntax in a logical framework
inferred← citeshttps://doi.org/10.1145/64135.65006openalex-snapshot
The ergo support system: an integrated set of tools for prototyping integrated environments
inferred← citeshttps://doi.org/10.17863/cam.23640openalex-snapshot
ISABELLE - THE NEXT 700 THEOREM PROVERS
inferred← citeshttps://doi.org/10.17863/cam.23641openalex-snapshot
The Foundation of a Generic Theorem Prover
inferred← citeshttps://doi.org/10.22028/d291-40440openalex-snapshot
Towards a Framework to Integrate Proof Search Paradigms
inferred← citeshttps://doi.org/10.29007/xtc2openalex-snapshot
Defining the meaning of TPTP formatted proofs
inferred← citeshttps://doi.org/10.3115/981623.981642openalex-snapshot
A calculus for semantic composition and scoping
inferred← citeshttps://doi.org/10.6092/issn.1972-5787/4650openalex-snapshot
Abella: A System for Reasoning about Relational Specifications
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.