On the public citation graph

Compiling logic programs with equality

https://doi.org/10.1007/bfb0024197
0 signed · 66 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-10009-1_25openalex-snapshot
Canonical forms and unification
inferredcites →https://doi.org/10.1007/3-540-19242-5_10openalex-snapshot
Compiling conditional rewriting systems
inferredcites →https://doi.org/10.1007/3-540-50820-1_52openalex-snapshot
Formal specification of a prolog compiler
inferredcites →https://doi.org/10.1007/3-540-51081-8_99openalex-snapshot
Completion-time optimization of rewrite-time goal solving
inferredcites →https://doi.org/10.1007/3-540-52531-9_142openalex-snapshot
A functional and logic language with polymorphic types
inferredcites →https://doi.org/10.1007/3-540-52592-0_69openalex-snapshot
Graph-based implementation of a functional logic language
inferredcites →https://doi.org/10.1007/978-3-642-55481-0openalex-snapshot
Programming in Prolog
inferredcites →https://doi.org/10.1007/978-3-642-73824-1openalex-snapshot
Computing in Horn Clause Theories
inferredcites →https://doi.org/10.1007/bfb0014986openalex-snapshot
Refined strategies for semantic unification
inferredcites →https://doi.org/10.1016/0743-1066(89)90030-7openalex-snapshot
An implementation of narrowing
inferredcites →https://doi.org/10.21236/ada087640openalex-snapshot
Canonical Forms and Unification.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11680093_2openalex-snapshot
Declarative Programming with Function Patterns
inferred← citeshttps://doi.org/10.1007/3-540-54444-5_110openalex-snapshot
Dynamic detection of determinism in functional logic languages
inferred← citeshttps://doi.org/10.1007/3-540-54444-5_112openalex-snapshot
Efficient integration of simplification into Prolog
inferred← citeshttps://doi.org/10.1007/3-540-54444-5_119openalex-snapshot
The ALF system
inferred← citeshttps://doi.org/10.1007/3-540-54444-5_93openalex-snapshot
The implementation of lazy narrowing
inferred← citeshttps://doi.org/10.1007/3-540-54496-8_19openalex-snapshot
Design of a compiler for lazy pattern driven narrowing
inferred← citeshttps://doi.org/10.1007/3-540-55844-6_124openalex-snapshot
Improving control of logic programs by using functional logic languages
inferred← citeshttps://doi.org/10.1007/3-540-55844-6_146openalex-snapshot
Camel: An extension of the categorical abstract machine to compile functional/logic programs
inferred← citeshttps://doi.org/10.1007/3-540-55844-6_147openalex-snapshot
On the interaction of lazy evaluation and backtracking
inferred← citeshttps://doi.org/10.1007/3-540-55844-6_160openalex-snapshot
Implementing higher-order functions in an algebraic specification language with narrowing
inferred← citeshttps://doi.org/10.1007/3-540-57186-8_69openalex-snapshot
A debugging model for functional logic programs
inferred← citeshttps://doi.org/10.1007/3-540-57186-8_78openalex-snapshot
Efficient lazy narrowing using demandedness analysis
inferred← citeshttps://doi.org/10.1007/3-540-57264-3_39openalex-snapshot
Abstract rewriting
inferred← citeshttps://doi.org/10.1007/3-540-57877-3_5openalex-snapshot
Towards the global optimization of functional logic programs
inferred← citeshttps://doi.org/10.1007/3-540-57880-3_18openalex-snapshot
Lazy unification with simplification
inferred← citeshttps://doi.org/10.1007/3-540-58402-1_26openalex-snapshot
Combining lazy narrowing and simplification
inferred← citeshttps://doi.org/10.1007/3-540-58485-4_31openalex-snapshot
Mode analysis of functional logic programs
inferred← citeshttps://doi.org/10.1007/3-540-60939-3_19openalex-snapshot
Efficient translation of lazy functional logic programs into Prolog
inferred← citeshttps://doi.org/10.1007/3-540-60983-0_15openalex-snapshot
Extending constructive negation for partial functions in lazy functional-logic languages
inferred← citeshttps://doi.org/10.1007/978-1-4471-3560-9_18openalex-snapshot
Efficient Compilation of Lazy Narrowing into Prolog
inferred← citeshttps://doi.org/10.1007/978-1-4471-3794-8_12openalex-snapshot
A survey of the implementations of narrowing
inferred← citeshttps://doi.org/10.1007/978-1-4471-3794-8_13openalex-snapshot
A Systematic Method for Designing Abstract Narrowing Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_6openalex-snapshot
Functional Logic Programming: From Theory to Curry
inferred← citeshttps://doi.org/10.1007/bf01190830openalex-snapshot
Completeness results for basic narrowing
inferred← citeshttps://doi.org/10.1007/bf03037158openalex-snapshot
Relating the implementation techniques of functional and functional logic languages
inferred← citeshttps://doi.org/10.1007/bf03037211openalex-snapshot
The functional logic language BABEL and its implementation on a graph machine
inferred← citeshttps://doi.org/10.1007/bfb0013543openalex-snapshot
Efficient implementation of narrowing and rewriting
inferred← citeshttps://doi.org/10.1007/bfb0013551openalex-snapshot
The ALF system: An efficient implementation of a functional logic language
inferred← citeshttps://doi.org/10.1007/bfb0013829openalex-snapshot
Incremental rewriting in narrowing derivations
inferred← citeshttps://doi.org/10.1007/bfb0013830openalex-snapshot
Counterexamples to completeness results for basic narrowing (extended abstract)
inferred← citeshttps://doi.org/10.1007/s00200-010-0122-4openalex-snapshot
Termination of narrowing via termination of rewriting
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00225-8openalex-snapshot
Dynamic detection of determinism in functional logic languages
inferred← citeshttps://doi.org/10.1016/0743-1066(94)00105-fopenalex-snapshot
Analysis of residuating logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90034-5openalex-snapshot
The integration of functions into logic programming: From theory to practice
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.07.009openalex-snapshot
An integrated framework for the diagnosis and correction of rule-based programs
inferred← citeshttps://doi.org/10.1016/s0096-0551(97)00010-6openalex-snapshot
Lazy narrowing with simplification
inferred← citeshttps://doi.org/10.1016/s0096-0551(97)00012-xopenalex-snapshot
Towards the uniform implementation of declarative languages
inferred← citeshttps://doi.org/10.1016/s0167-739x(99)00088-6openalex-snapshot
Abstract machines for programming language implementation
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00266-xopenalex-snapshot
Declarative Debugging of Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Accóon Integrada Hispano-Italiana HI2000-0161 and by Generalitat Valenciana under grant GV01-424.
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80345-1openalex-snapshot
A Debugging Scheme for Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Acción Integrada Hispano-Italiana HI2000-0161, Acción Integrada Hispano-Alemana HA2001-0059 and by Generalitat Valenciana under grant GV01-424.
inferred← citeshttps://doi.org/10.1017/s0956796897002645openalex-snapshot
Leftmost outside-in narrowing calculi
inferred← citeshttps://doi.org/10.1145/165180.165209openalex-snapshot
Towards lazy evaluation, sharing, and non-determinism in resolution based functional logic languages
inferred← citeshttps://doi.org/10.1145/174675.177889openalex-snapshot
Higher-order equational logic programming
inferred← citeshttps://doi.org/10.1145/258993.259015openalex-snapshot
Specialization of lazy functional logic programs
inferred← citeshttps://doi.org/10.1145/263699.263710openalex-snapshot
A unified computation model for functional and logic programming
inferred← citeshttps://doi.org/10.1145/291891.291896openalex-snapshot
Partial evaluation of functional logic programs
inferred← citeshttps://doi.org/10.1145/888251.888255openalex-snapshot
Conditional narrowing without conditions
inferred← citeshttps://doi.org/10.14279/depositonce-102openalex-snapshot
A set-based calculus and its implementation
inferred← citeshttps://doi.org/10.15760/etd.3564openalex-snapshot
Implementing a Functional Logic Programming Language via the Fair Scheme
inferred← citeshttps://doi.org/10.4995/thesis/10251/1888openalex-snapshot
Una aproximación offline a la evaluación parcial dirigida por narrowing
inferred← citeshttps://doi.org/10.4995/thesis/10251/1948openalex-snapshot
Rule-Based Software Verification and Correction.
inferred← citeshttps://doi.org/10.4995/thesis/10251/55796openalex-snapshot
Análisis semántico y transformación de programas lógico-funcionales.
inferred← citeshttps://doi.org/10.5281/zenodo.26359openalex-snapshot
Morphometrics As A Tool In Identification: A Case Study On A Myrmica From France (Hymenoptera, Formicidae).
inferred← citeshttps://doi.org/10.7551/mitpress/4298.003.0065openalex-snapshot
On Extra Variables in (Equational) Logic Programming
inferred← citeshttps://doi.org/10.7551/mitpress/4299.003.0016openalex-snapshot
Parallel Evaluation Strategies for Functional Logic Languages
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.