On the public citation graph

Towards a logic programming methodology based on higher-order predicates

https://doi.org/10.1007/bf03037300
0 signed · 27 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-16492-8_94openalex-snapshot
Higher-order logic programming
inferredcites →https://doi.org/10.1007/3-540-58792-6_9openalex-snapshot
Schema-based top-down design of logic programs using abstract data types
inferredcites →https://doi.org/10.1007/3540543961_7openalex-snapshot
Functional programming with bananas, lenses, envelopes and barbed wire
inferredcites →https://doi.org/10.1007/978-1-4615-2205-8openalex-snapshot
Logic Program Synthesis from Incomplete Information
inferredcites →https://doi.org/10.1007/978-3-642-74884-4_5openalex-snapshot
Lectures on Constructive Functional Programming
inferredcites →https://doi.org/10.1007/bf01211391openalex-snapshot
Paramorphisms
inferredcites →https://doi.org/10.1007/bf01932293openalex-snapshot
Horn clause computability
inferredcites →https://doi.org/10.1016/0167-6423(85)90003-6openalex-snapshot
The design of divide and conquer algorithms
inferredcites →https://doi.org/10.1016/0743-1066(93)90039-jopenalex-snapshot
HiLog: A foundation for higher-order logic programming
inferredcites →https://doi.org/10.1016/s0747-7171(06)80012-xopenalex-snapshot
Logic program synthesis from incomplete specifications
inferredcites →https://doi.org/10.1109/mex.1987.4307074openalex-snapshot
The Art of Prolog
inferredcites →https://doi.org/10.1145/359576.359579openalex-snapshot
Can programming be liberated from the von Neumann style?
inferredcites →https://doi.org/10.2307/2274454openalex-snapshot
Peter B. Andrews. An introduction to mathematical logic and type theory: to truth through proof. Computer science and applied mathematics. Academic Press, Orlando etc. 1986, xv + 304 pp.
inferredcites →https://doi.org/10.7551/mitpress/4298.003.0049openalex-snapshot
Representing Logic Program Schemata in λ-Prolog
inferredcites →https://doi.org/10.7551/mitpress/4298.003.0089openalex-snapshot
Constructing Logic Programs with Higher-Order Predicates

What points at this work

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

inferred← citeshttps://doi.org/10.1006/ijhc.1999.0250openalex-snapshot
A system architecture for knowledge-based hypermedia
inferred← citeshttps://doi.org/10.1006/jsco.1999.0348openalex-snapshot
An Abstract Formalization of Correct Schemas for Program Synthesis
inferred← citeshttps://doi.org/10.1007/3-540-48958-4_8openalex-snapshot
Inductive Synthesis of Logic Programs by Composition of Combinatory Program Schemes
inferred← citeshttps://doi.org/10.1007/3-540-49674-2_5openalex-snapshot
Implicit Program Synthesis by a Reversible Metainterpreter
inferred← citeshttps://doi.org/10.1007/978-3-0348-0600-8_6openalex-snapshot
Diagrammatic Reasoning with Classes and Relationships
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-642-24764-4_9openalex-snapshot
Querying Class-Relationship Logic in a Metalogic Framework
inferred← citeshttps://doi.org/10.1023/a:1008741507024openalex-snapshot
Logic Program Synthesis as Problem Reduction Using Combining Forms
inferred← citeshttps://doi.org/10.1109/hcc.2001.995298openalex-snapshot
ViCoLL - a visual compositional logic language
inferred← citeshttps://doi.org/10.1109/hcc.2003.1260212openalex-snapshot
DAViLa - a domain adaptable visual language
inferred← citeshttps://doi.org/10.1109/vlhcc.2013.6645256openalex-snapshot
Colour beads visual representation of compositional relational programs
inferred← citeshttps://doi.org/10.3233/978-1-58603-957-8-309openalex-snapshot
A Common Framework for Board Games and Argumentation Games
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.