On the public citation graph
Denotational abstract interpretation of functional logic programs
0 signed · 28 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/3-540-09981-6_19openalex-snapshot
The theory and practice of transforming call-by-need into call-by-value
inferredcites →https://doi.org/10.1007/3-540-18317-5_24openalex-snapshot
Evaluation transformers — A model for the parallel evaluation of functional languages (extended abstract)
inferredcites →https://doi.org/10.1007/3-540-57186-8_78openalex-snapshot
Efficient lazy narrowing using demandedness analysis
inferredcites →https://doi.org/10.1007/bfb0032046openalex-snapshot
Algebraic properties of idempotent substitutions
inferredcites →https://doi.org/10.1016/0304-3975(94)00248-3openalex-snapshot
Modularity in noncopying term rewriting
inferredcites →https://doi.org/10.1016/0743-1066(94)90034-5openalex-snapshot
The integration of functions into logic programming: From theory to practice
inferredcites →https://doi.org/10.1145/177492.177650openalex-snapshot
Denotational abstract interpretation of logic programs
inferredcites →https://doi.org/10.1145/218570.218573openalex-snapshot
Fast strictness analysis based on demand propagation
inferredcites →https://doi.org/10.1145/263699.263710openalex-snapshot
A unified computation model for functional and logic programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10705424_23openalex-snapshot
A Semantics for Program Analysis in Narrowing-Based Functional Logic Languages
inferred← citeshttps://doi.org/10.1007/3-540-46584-7_5openalex-snapshot
Using Static Analysis to Compile Non-sequential Functional Logic Programs?
inferred← citeshttps://doi.org/10.1007/978-3-642-22531-4_1openalex-snapshot
KiCS2: A New Compiler from Curry to Haskell
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.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/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/s1471068404002303openalex-snapshot
Specialization of functional logic programs based on needed narrowing
inferred← citeshttps://doi.org/10.1017/s1471068406002882openalex-snapshot
Demand analysis with partial predicates
inferred← citeshttps://doi.org/10.1017/s1471068412000373openalex-snapshot
Rewriting and narrowing for constructor systems with call-time choice semantics
inferred← citeshttps://doi.org/10.1145/2103746.2103763openalex-snapshot
Well-typed narrowing with extra variables in functional-logic programming
inferred← citeshttps://doi.org/10.1145/317636.317910openalex-snapshot
Specialization of inductively sequential functional logic programs
inferred← citeshttps://doi.org/10.4230/lipics.iclp.2012.130openalex-snapshot
Improving Lazy Non-Deterministic Computations by Demand Analysis
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).
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.