On the public citation graph

How to invent a Prolog machine

https://doi.org/10.1007/bf03037460
0 signed · 36 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-15199-0_18openalex-snapshot
A PROLOG environment for developing and reasoning about data types
inferredcites →https://doi.org/10.1007/978-3-642-55481-0openalex-snapshot
Programming in Prolog
inferredcites →https://doi.org/10.1007/bf03037117openalex-snapshot
Design and simulation of a sequential Prolog machine
inferredcites →https://doi.org/10.1007/bf03037325openalex-snapshot
Towards a pipelined Prolog processor
inferredcites →https://doi.org/10.1016/0020-0190(77)90078-3openalex-snapshot
On the partial computation principle
inferredcites →https://doi.org/10.1016/0304-3975(82)90111-6openalex-snapshot
Mixed computation: potential applications and problems for study
inferredcites →https://doi.org/10.1016/0743-1066(85)90004-4openalex-snapshot
Some global optimizations for a PROLOG compiler
inferredcites →https://doi.org/10.1145/988346.988358openalex-snapshot
An experiment in partial evaluation

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.1995.1034openalex-snapshot
Suprema of Open and Closed Formulas and Their Application to Resolution
inferred← citeshttps://doi.org/10.1007/3-540-48242-3_21openalex-snapshot
CHAT Is Θ (SLG-WAM)
inferred← citeshttps://doi.org/10.1007/3-540-57186-8_85openalex-snapshot
A WAM-based implementation of a logic language with sets
inferred← citeshttps://doi.org/10.1007/978-1-4471-3227-1_39openalex-snapshot
A Formal Definition of an Abstract Prolog Compiler (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-1-4471-3234-9_12openalex-snapshot
Specialising the Ground Representation in the Logic Programming Language Gödel
inferred← citeshttps://doi.org/10.1007/978-1-4613-1619-0_1openalex-snapshot
From Low Level Semantic Description of Prolog to Instruction Set and VLSI Design
inferred← citeshttps://doi.org/10.1007/978-3-031-11806-7_9openalex-snapshot
Language Paradigms
inferred← citeshttps://doi.org/10.1007/978-3-031-93299-1_10openalex-snapshot
Language Paradigms
inferred← citeshttps://doi.org/10.1007/978-3-540-25938-1_13openalex-snapshot
From Interpreter to Logic Engine by Defunctionalization
inferred← citeshttps://doi.org/10.1007/978-3-662-46823-4_19openalex-snapshot
Supercompilation for Datatypes
inferred← citeshttps://doi.org/10.1007/bfb0013096openalex-snapshot
FRIENDLY-WAM: An interactive tool to understand the compilation of PROLOG
inferred← citeshttps://doi.org/10.1007/bfb0019413openalex-snapshot
Visualization as debugging: Understanding/debugging the Warren Abstract Machine
inferred← citeshttps://doi.org/10.1007/bfb0024173openalex-snapshot
Compilation of narrowing
inferred← citeshttps://doi.org/10.1007/bfb0024180openalex-snapshot
The vienna abstract machine
inferred← citeshttps://doi.org/10.1016/0165-6074(91)90393-8openalex-snapshot
Issues in the implementation of Prolog, and their optimization
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90170-xopenalex-snapshot
C-expressions: a variable-free calculus for equational logic programming
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90026-dopenalex-snapshot
Towards a methodology for the design of abstract machines for logic programming languages
inferred← citeshttps://doi.org/10.1016/s0167-6423(99)00047-7openalex-snapshot
A generative methodology for the design of abstract machines
inferred← citeshttps://doi.org/10.1023/a:1012936614361openalex-snapshot
Regular Tree Languages as an Abstract Domain in Program Specialisation
inferred← citeshttps://doi.org/10.1142/9789812798039_0005openalex-snapshot
What is Logic Programming good for in Software Engineering?
inferred← citeshttps://doi.org/10.1145/115865.115879openalex-snapshot
Staging transformations for abstract machines
inferred← citeshttps://doi.org/10.1145/115866.115879openalex-snapshot
Staging transformations for abstract machines
inferred← citeshttps://doi.org/10.1145/131295.131299openalex-snapshot
Memoing for logic programs
inferred← citeshttps://doi.org/10.1145/183432.183458openalex-snapshot
Operational semantics-directed compilers and machine architectures
inferred← citeshttps://doi.org/10.1145/43908.43910openalex-snapshot
A bibliography on partial evaluation
inferred← citeshttps://doi.org/10.7146/brics.v10i25.21954openalex-snapshot
From Interpreter to Logic Engine by Defunctionalization
inferred← citeshttps://doi.org/10.7146/brics.v11i5.21830openalex-snapshot
From Interpreter to Logic Engine by Defunctionalization
inferred← citeshttps://doi.org/10.7551/mitpress/7160.001.0001openalex-snapshot
Warren's Abstract Machine
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.