On the public citation graph

Implementing tactics and tacticals in a higher-order logic programming language

https://doi.org/10.1007/bf00881900

0 signed · 79 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-09724-4openalex-snapshot

Edinburgh LCF

inferredcites →https://doi.org/10.1007/3-540-51081-8_104openalex-snapshot

Higher-order unification with dependent function types

inferredcites →https://doi.org/10.1007/3-540-52885-7_116openalex-snapshot

Programming by example and proving by example using higher-order unification

inferredcites →https://doi.org/10.1007/bf00248324openalex-snapshot

The foundation of a generic theorem prover

inferredcites →https://doi.org/10.1007/bfb0012823openalex-snapshot

Specifying theorem provers in a higher-order logic programming language

inferredcites →https://doi.org/10.1007/bfb0013606openalex-snapshot

A logic programming approach to implementing higher-Order term rewriting

inferredcites →https://doi.org/10.1007/bfb0038694openalex-snapshot

A logic program for transforming sequent proofs to natural deduction proofs

inferredcites →https://doi.org/10.1016/0004-3702(85)90084-0openalex-snapshot

Depth-first iterative-deepening

inferredcites →https://doi.org/10.1016/0168-0072(91)90068-wopenalex-snapshot

Uniform proofs as a foundation for logic programming

inferredcites →https://doi.org/10.1016/0304-3975(75)90011-0openalex-snapshot

A unification algorithm for typed λ-calculus

inferredcites →https://doi.org/10.1016/0747-7171(92)90011-ropenalex-snapshot

Unification under a mixed prefix

inferredcites →https://doi.org/10.1016/0890-5401(88)90005-3openalex-snapshot

The calculus of constructions

inferredcites →https://doi.org/10.1016/b978-1-55860-036-2.50113-2openalex-snapshot

Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization

inferredcites →https://doi.org/10.1016/s0049-237x(08)70849-8openalex-snapshot

Ideas and Results in Proof Theory

inferredcites →https://doi.org/10.1016/s0049-237x(08)x7039-9openalex-snapshot

The Collected Papers of Gerhard Gentzen

inferredcites →https://doi.org/10.1017/cbo9780511569807.008openalex-snapshot

Logic programming in the LF logical framework

inferredcites →https://doi.org/10.1017/cbo9780511569807.010openalex-snapshot

Encoding dependent types in an intuitionistic logic

inferredcites →https://doi.org/10.1023/a:1022676712939openalex-snapshot

Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization

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.1145/138027.138060openalex-snapshot

A framework for defining logics

inferredcites →https://doi.org/10.1145/960116.54010openalex-snapshot

Higher-order abstract syntax

inferredcites →https://doi.org/10.1145/96559.96570openalex-snapshot

Higher-order Horn clauses

inferredcites →https://doi.org/10.2307/2266170openalex-snapshot

A formulation of the simple theory of types

inferredcites →https://doi.org/10.48456/tr-68openalex-snapshot

HOL A machine oriented formulation of 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/jsco.1996.0094openalex-snapshot

Interactive Theorem Proving with Temporal Logic

inferred← citeshttps://doi.org/10.1007/11532231_17openalex-snapshot

Proof Planning for First-Order Temporal Logic

inferred← citeshttps://doi.org/10.1007/11812289_6openalex-snapshot

A Proof-Theoretic Approach to Tactics

inferred← citeshttps://doi.org/10.1007/3-540-36078-6_7openalex-snapshot

Proof Planning for Feature Interactions: A Preliminary Report

inferred← citeshttps://doi.org/10.1007/3-540-44716-4_1openalex-snapshot

The Metalanguage λprolog and Its Implementation

inferred← citeshttps://doi.org/10.1007/3-540-44716-4_7openalex-snapshot

A Higher-Order Logic Programming Language with Constraints

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-45685-6_2openalex-snapshot

Higher Order Unification 30 Years Later

inferred← citeshttps://doi.org/10.1007/3-540-48660-7_25openalex-snapshot

System Description: Teyjus—A Compiler and Abstract Machine Based Implementation of λProlog

inferred← citeshttps://doi.org/10.1007/3-540-58156-1_42openalex-snapshot

Representing proof transformations for program optimization

inferred← citeshttps://doi.org/10.1007/3-540-58156-1_44openalex-snapshot

Tactic theorem proving with refinement-tree proofs and metavariables

inferred← citeshttps://doi.org/10.1007/3-540-58216-9_25openalex-snapshot

Generalization and reuse of tactic proofs

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-58216-9_35openalex-snapshot

Program extraction in a Logical Framework setting

inferred← citeshttps://doi.org/10.1007/3-540-59155-9_12openalex-snapshot

Imagining CLP(Λ,≡αβ)

inferred← citeshttps://doi.org/10.1007/3-540-60688-2_54openalex-snapshot

Formalizing inductive proofs of network algorithms

inferred← citeshttps://doi.org/10.1007/3-540-61064-2_33openalex-snapshot

The practice of logical frameworks

inferred← citeshttps://doi.org/10.1007/978-3-319-10398-3_10openalex-snapshot

A Logical Framework for Systems Biology

inferred← citeshttps://doi.org/10.1007/978-3-540-74835-9_3openalex-snapshot

Efficient Proving for Practical Distributed Access-Control Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-14309-0_12openalex-snapshot

Proof-Theoretic and Higher-Order Extensions of Logic Programming

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-59048-1_8openalex-snapshot

Logic Programming and Meta-Logic

inferred← citeshttps://doi.org/10.1007/978-3-642-60858-2_25openalex-snapshot

Tool Support for Logics of Programs

inferred← citeshttps://doi.org/10.1007/bf01213535openalex-snapshot

A tactic calculus — abridged version

inferred← citeshttps://doi.org/10.1007/bf02127970openalex-snapshot

Program tactics and logic tactics

inferred← citeshttps://doi.org/10.1007/bfb0014049openalex-snapshot

Higher-order abstract syntax in Coq

inferred← citeshttps://doi.org/10.1007/bfb0052151openalex-snapshot

Linear logic as logic programming: An abstract

inferred← citeshttps://doi.org/10.1007/bfb0055141openalex-snapshot

Free variables and subexpressions in higher-order meta logic

inferred← citeshttps://doi.org/10.1007/bfb0105418openalex-snapshot

Higher-order annotated terms for proof search

inferred← citeshttps://doi.org/10.1007/s10817-016-9380-6openalex-snapshot

A Semantic Framework for Proof Evidence

inferred← citeshttps://doi.org/10.1007/s11786-010-0025-6openalex-snapshot

Tactics for Hierarchical Proof

inferred← citeshttps://doi.org/10.1016/0004-3702(95)00002-xopenalex-snapshot

A metatheory of a mechanized object 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/0304-3975(96)00045-xopenalex-snapshot

Forum: A multiple-conclusion specification logic

inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50019-9openalex-snapshot

Logical Frameworks

inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00175-9openalex-snapshot

The calculus of constructions as a framework for proof search with set variable instantiation

inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10038-9openalex-snapshot

A pragmatic reconstruction of λProlog

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80509-7openalex-snapshot

Memoization-Based Proof Search in LF

inferred← citeshttps://doi.org/10.1017/s0956796803004921openalex-snapshot

Dependent types ensure partial correctness of theorem provers

inferred← citeshttps://doi.org/10.1017/s1471068403001698openalex-snapshot

Polymorphic lemmas and definitions in $\lambda$Prolog and Twelf

inferred← citeshttps://doi.org/10.1017/s1471068404002297openalex-snapshot

A treatment of higher-order features in logic programming

inferred← citeshttps://doi.org/10.1017/s1471068421000533openalex-snapshot

A Survey of the Proof-Theoretic Foundations of Logic Programming

inferred← citeshttps://doi.org/10.1093/oso/9780198537922.003.0011openalex-snapshot

Higher-Order Logic Programming

inferred← citeshttps://doi.org/10.1109/lics.1993.287584openalex-snapshot

Encoding the calculus of constructions in a higher-order logic

inferred← citeshttps://doi.org/10.1109/lics.1994.316062openalex-snapshot

A multiple-conclusion meta-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.1145/1387673.1387675openalex-snapshot

Nominal logic programming

inferred← citeshttps://doi.org/10.1145/2966268.2966272openalex-snapshot

Implementing HOL in an Higher Order Logic Programming Language

inferred← citeshttps://doi.org/10.1145/3408974openalex-snapshot

Achieving high-performance the functional way: a functional pearl on expressing high-performance optimizations as rewrite strategies

inferred← citeshttps://doi.org/10.1145/504077.504080openalex-snapshot

Reasoning with higher-order abstract syntax in a logical framework

inferred← citeshttps://doi.org/10.1184/r1/6467873openalex-snapshot

Efficient Proving for Distributed Access-Control Systems

inferred← citeshttps://doi.org/10.48550/arxiv.0911.5203openalex-snapshot

An Implementation of the Language Lambda Prolog Organized around Higher-Order Pattern Unification

inferred← citeshttps://doi.org/10.48550/arxiv.cs/9711106openalex-snapshot

Generic Automatic Proof Tools

inferred← citeshttps://doi.org/10.70675/61bfbf53z121az472ez8c91ze9f6166c9a6aopenalex-snapshot

Applications of Foundational Proof Certificates in theorem proving

inferred← citeshttps://doi.org/10.7551/mitpress/4304.003.0036openalex-snapshot

Lightweight Lemmas in λProlog

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.