On the public citation graph

A proof procedure for the logic of hereditary Harrop formulas

https://doi.org/10.1007/bf00881902

0 signed · 50 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-55602-8_189openalex-snapshot

Proof search in the intuitionistic sequent calculus

inferredcites →https://doi.org/10.1007/978-1-4684-0357-2openalex-snapshot

First-Order Logic and Automated Theorem Proving

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

Specifying theorem provers in a higher-order logic programming language

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/0743-1066(88)90014-3openalex-snapshot

Clausal intuitionistic logic II. tableau proof procedures

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

Unification under a mixed prefix

inferredcites →https://doi.org/10.1016/s0049-237x(08)70822-xopenalex-snapshot

3. Investigations into Logical Deduction

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/321978.321991openalex-snapshot

The Semantics of Predicate Logic as a Programming Language

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

An Efficient Unification Algorithm

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

Partial polymorphic type inference and higher-order unification

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

A representation of Lambda terms suitable for operations on their intensions

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

Higher-order Horn clauses

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.1007/3-540-44716-4_1openalex-snapshot

The Metalanguage λprolog and Its Implementation

inferred← citeshttps://doi.org/10.1007/3-540-45788-7_6openalex-snapshot

Solving Mixed Quantified Constraints over a Domain Based on $$ \mathcal{R} $$eal Numbers and $$ \mathcal{H} $$erbrand Terms

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-56454-3_18openalex-snapshot

Implementing a notion of modules in the logic programming language λProlog

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-63045-7_21openalex-snapshot

A proof procedure for hereditary Harrop formulas with free equality

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-73228-0_20openalex-snapshot

Higher-Order Logic Programming Languages with Constraints: A Semantics

inferred← citeshttps://doi.org/10.1007/978-3-642-04155-6_23openalex-snapshot

System Support for Forensic Inference

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

Resolution for logic programming with universal quantifiers

inferred← citeshttps://doi.org/10.1007/s10472-021-09764-0openalex-snapshot

The undecidability of proof search when equality is a logical connective

inferred← citeshttps://doi.org/10.1016/0743-1066(94)90032-9openalex-snapshot

Modularity in Logic Programming

inferred← citeshttps://doi.org/10.1016/0743-1066(95)00037-kopenalex-snapshot

Scoping constructs in logic programming: Implementation problems and their solution

inferred← citeshttps://doi.org/10.1016/j.apal.2006.01.002openalex-snapshot

Non-commutative proof construction: A constraint-based approach

inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.038openalex-snapshot

On the algebraic structure of declarative programming languages

inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00244-8openalex-snapshot

Representing scope in intuitionistic deductions

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

Correspondences between classical, intuitionistic and uniform provability

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

Correct Answers for First Order Logic

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

Constraint Logic Programming with Hereditary Harrop formulas

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

A Survey of the Proof-Theoretic Foundations of Logic Programming

inferred← citeshttps://doi.org/10.1093/logcom/8.2.209openalex-snapshot

Uniform provability in classical logic

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

Higher-Order Logic Programming

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

Uniform proofs and disjunctive logic programming

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

Providing declarative semantics for HH extended constraint logic programs

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

Proof-carrying code (abstract)

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

Oracle-based checking of untrusted software

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

Type Checking with Rewriting Rules

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

Oracle-based checking of untrusted software

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

Protecting sensitive attributes in automated trust negotiation

inferred← citeshttps://doi.org/10.14418/wes01.3.7openalex-snapshot

An Adjunction-Theoretic Foundation for Proof Search in Intuitionistic First-Order Categorical Logic Programming

inferred← citeshttps://doi.org/10.29007/7gnropenalex-snapshot

Checking Foundational Proof Certificates for First-Order Logic (Extended Abstract)

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/0404053openalex-snapshot

Constraint Logic Programming with Hereditary Harrop Formula

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

Correspondences between Classical, Intuitionistic and Uniform Provability

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

Modularity in Logic Programming

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.