On the public citation graph
A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems
0 signed · 47 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/10722311openalex-snapshot
Analysis and Visualization Tools for Constraint Programming
inferredcites →https://doi.org/10.1007/10722311_2openalex-snapshot
An Assertion Language for Constraint Logic Programs
inferredcites →https://doi.org/10.1007/11603023_9openalex-snapshot
Adding Constraint Solving to Mercury
inferredcites →https://doi.org/10.1007/3-540-16492-8openalex-snapshot
Third International Conference on Logic Programming
inferredcites →https://doi.org/10.1007/3-540-44957-4_9openalex-snapshot
A New Module System for Prolog
inferredcites →https://doi.org/10.1007/3-540-50667-5_74openalex-snapshot
Babel: A functional and logic programming language based on constructor discipline and narrowing
inferredcites →https://doi.org/10.1007/3-540-50820-1openalex-snapshot
Programming Languages Implementation and Logic Programming
inferredcites →https://doi.org/10.1007/3-540-54444-5_84openalex-snapshot
Adding equations to NU-Prolog
inferredcites →https://doi.org/10.1007/978-3-540-24836-1_7openalex-snapshot
Improved Compilation of Prolog to C Using Moded Types and Determinism Information
inferredcites →https://doi.org/10.1007/978-3-540-30502-6_7openalex-snapshot
Hiord: A Type-Free Higher-Order Logic Programming Language with Predicate Abstraction
inferredcites →https://doi.org/10.1016/0743-1066(86)90014-2openalex-snapshot
The relation between logic and functional languages: a survey
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/0743-1066(94)90031-0openalex-snapshot
1983–1993: The wonder years of sequential Prolog implementation
inferredcites →https://doi.org/10.1016/j.scico.2005.02.006openalex-snapshot
Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
inferredcites →https://doi.org/10.1016/s0743-1066(96)00068-4openalex-snapshot
The execution algorithm of mercury, an efficient purely declarative logic programming language
inferredcites →https://doi.org/10.1016/s1571-0661(05)80103-3openalex-snapshot
The Ciao Modular, Standalone Compiler and Its Generic Program Processing Library
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/iccl.1990.63777openalex-snapshot
Lazy evaluation in logic programming
inferredcites →https://doi.org/10.1111/j.1468-0394.1992.tb00386.xopenalex-snapshot
The Craft of Prolog
inferredcites →https://doi.org/10.1145/174675.177883openalex-snapshot
Analyzing logic programs with dynamic scheduling
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-05998-9_6openalex-snapshot
Improving Residuation in Declarative Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-90318-3_41openalex-snapshot
Inference Methods for Evaluable Knowledge Bases
inferred← citeshttps://doi.org/10.1007/978-3-031-35254-6_24openalex-snapshot
Logical English for Law and Education
inferred← citeshttps://doi.org/10.1007/978-3-031-71294-4_2openalex-snapshot
Improving Logic Programs by Adding Functions
inferred← citeshttps://doi.org/10.1007/978-3-032-04848-6_4openalex-snapshot
Extending the FSyntax/Hiord Approach with Imperative Notation
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_14openalex-snapshot
An Overview of the Ciao Multiparadigm Language and Program Development Environment and Its Design Philosophy
inferred← citeshttps://doi.org/10.1007/978-3-540-74610-2_5openalex-snapshot
Multi-paradigm Declarative Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-77442-6_16openalex-snapshot
Towards a High-Level Implementation of Execution Primitives for Unrestricted, Independent And-Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-540-78769-3_10openalex-snapshot
Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-88737-9_11openalex-snapshot
A Semantic Web Reasoner for Rules, Equations and Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-92995-6_16openalex-snapshot
Towards a Complete Scheme for Tabled Execution Based on Program Transformation
inferred← citeshttps://doi.org/10.1007/978-3-642-32211-2_10openalex-snapshot
Modular Extensions for Modular (Logic) Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-45284-0_14openalex-snapshot
Reversible Language Extensions and Their Application in Debugging
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.03.080openalex-snapshot
Functions and Lazy Evaluation in Prolog
inferred← citeshttps://doi.org/10.1017/s0956796809990086openalex-snapshot
Monadic constraint programming
inferred← citeshttps://doi.org/10.1017/s1471068411000457openalex-snapshot
An overview of Ciao and its design philosophy
inferred← citeshttps://doi.org/10.1017/s1471068414000672openalex-snapshot
Description and Optimization of Abstract Machines in a Dialect of Prolog
inferred← citeshttps://doi.org/10.1017/s1471068422000187openalex-snapshot
From Logic to Functional Logic Programs
inferred← citeshttps://doi.org/10.1145/1176760.1176794openalex-snapshot
High-level languages for small devices
inferred← citeshttps://doi.org/10.1145/1328408.1328418openalex-snapshot
A practical type analysis for verification of modular prolog programs
inferred← citeshttps://doi.org/10.1145/1389449.1389455openalex-snapshot
Comparing tag scheme variations using an abstract machine generator
inferred← citeshttps://doi.org/10.4204/eptcs.306.26openalex-snapshot
Lazy Stream Programming 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.