On the public citation graph
Definitional trees
0 signed · 93 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-08531-9openalex-snapshot
Computing in systems described by equations
inferredcites →https://doi.org/10.1007/3-540-51081-8_117openalex-snapshot
Optimization by non-deterministic, lazy rewriting
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/3-540-53162-9_47openalex-snapshot
Lazy narrowing in a graph machine
inferredcites →https://doi.org/10.1007/3-540-54317-1_102openalex-snapshot
Design strategies for rewrite rules
inferredcites →https://doi.org/10.1016/0168-0072(89)90024-9openalex-snapshot
Sequential evaluation strategies for parallel-or and related reduction systems
inferredcites →https://doi.org/10.1016/0743-1066(92)90024-wopenalex-snapshot
Logic programming with functions and predicates: The language Babel
inferredcites →https://doi.org/10.1016/0890-5401(87)90050-2openalex-snapshot
A refinement of strong sequentiality for term rewriting with constructors
inferredcites →https://doi.org/10.1017/cbo9780511569777.005openalex-snapshot
Implementing algebraic specifications
inferredcites →https://doi.org/10.1109/iccl.1990.63777openalex-snapshot
Lazy evaluation in logic programming
inferredcites →https://doi.org/10.1109/lics.1990.113749openalex-snapshot
Programming in equational logic: beyond strong sequentiality
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
inferredcites →https://doi.org/10.1145/800017.800522openalex-snapshot
Implementation of an interpreter for abstract equations
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.2002.3176openalex-snapshot
Context-Sensitive Rewriting Strategies
inferred← citeshttps://doi.org/10.1007/10705424_10openalex-snapshot
A Transformation System for Lazy Functional Logic Programs
inferred← citeshttps://doi.org/10.1007/10720084_12openalex-snapshot
Compiling Multi-paradigm Declarative Programs into Prolog
inferred← citeshttps://doi.org/10.1007/11431664_7openalex-snapshot
A Virtual Machine for Functional Logic Computations
inferred← citeshttps://doi.org/10.1007/11506676_7openalex-snapshot
Natural Rewriting for General Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/11559306_10openalex-snapshot
Declarative Constraint Programming with Definitional Trees
inferred← citeshttps://doi.org/10.1007/11676935_11openalex-snapshot
Programming with Fuzzy Logic and Mathematical Functions
inferred← citeshttps://doi.org/10.1007/11799573_9openalex-snapshot
Overlapping Rules and Logic Variables in Functional Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-44404-1_24openalex-snapshot
Using an Abstract Representation to Specialize Functional Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-44464-5_17openalex-snapshot
Improving Functional Logic Programs by Difference-Lists
inferred← citeshttps://doi.org/10.1007/3-540-44716-4_21openalex-snapshot
A Practical Partial Evaluator for a Multi-Paradigm Declarative Language
inferred← citeshttps://doi.org/10.1007/3-540-45013-0_17openalex-snapshot
Forward Slicing of Multi-paradigm Declarative Programs Based on Partial Evaluation
inferred← citeshttps://doi.org/10.1007/3-540-45142-0_7openalex-snapshot
Measuring the Effectiveness of Partial Evaluation in Functional Logic Languages
inferred← citeshttps://doi.org/10.1007/3-540-45406-3_5openalex-snapshot
Functional and Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_31openalex-snapshot
Functional Logic Programming with Failure: A Set-Oriented View
inferred← citeshttps://doi.org/10.1007/3-540-45788-7_13openalex-snapshot
Narrowing Failure in Functional Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-45788-7_15openalex-snapshot
Dynamic-Cut with Definitional Trees
inferred← citeshttps://doi.org/10.1007/3-540-46562-6_26openalex-snapshot
Extensions: A Technique for Structuring Functional-Logic Programs
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/3-540-48242-3_23openalex-snapshot
A Partial Evaluation Framework for Curry Programs
inferred← citeshttps://doi.org/10.1007/3-540-48483-3_9openalex-snapshot
Parallel Admissible Graph Rewriting
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_36openalex-snapshot
Normalization by leftmost innermost rewriting
inferred← citeshttps://doi.org/10.1007/3-540-57186-8_79openalex-snapshot
A demand driven computation strategy for lazy narrowing
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-60939-3_19openalex-snapshot
Efficient translation of lazy functional logic programs into Prolog
inferred← citeshttps://doi.org/10.1007/3-540-60983-0_19openalex-snapshot
A definitional approach to functional logic programming
inferred← citeshttps://doi.org/10.1007/978-3-031-24841-2_1openalex-snapshot
RICE: An Optimizing Curry Compiler
inferred← citeshttps://doi.org/10.1007/978-3-319-14125-1_12openalex-snapshot
Compiling a Functional Logic Language: The Fair Scheme
inferred← citeshttps://doi.org/10.1007/978-3-319-51676-9_1openalex-snapshot
Eliminating Irrelevant Non-determinism in Functional Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-63139-4_6openalex-snapshot
A New Functional-Logic Compiler for Curry: Sprite
inferred← citeshttps://doi.org/10.1007/978-3-540-24725-8_9openalex-snapshot
A Memoizing Semantics for Functional Logic Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-24754-8_12openalex-snapshot
Implementing Natural Rewriting and Narrowing Efficiently
inferred← citeshttps://doi.org/10.1007/978-3-540-24754-8_6openalex-snapshot
Analysing Definitional Trees: Looking for Determinism
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_21openalex-snapshot
Natural Narrowing for General Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-70590-1_5openalex-snapshot
A Needed Rewriting Strategy for Data-Structures with Pointers
inferred← citeshttps://doi.org/10.1007/978-3-540-71410-1_6openalex-snapshot
Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-74130-5_15openalex-snapshot
Automatic Partial Inversion of Inductively Sequential Functions
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-76786-2_5openalex-snapshot
Generic Programming in Ωmega
inferred← citeshttps://doi.org/10.1007/978-3-540-87405-8_7openalex-snapshot
Inductively Sequential Term-Graph Rewrite Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-00515-2_4openalex-snapshot
A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-29822-6_5openalex-snapshot
Compiling a Functional Logic Language: The Basic Scheme
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/978-3-642-40787-1_1openalex-snapshot
Executing Specifications Using Synthesis and Constraint Solving
inferred← citeshttps://doi.org/10.1007/bf03037257openalex-snapshot
The narrowing-driven approach to functional logic program specialization
inferred← citeshttps://doi.org/10.1007/bfb0027000openalex-snapshot
Optimal non-deterministic functional logic computations
inferred← citeshttps://doi.org/10.1007/bfb0032739openalex-snapshot
Denotational abstract interpretation of functional logic programs
inferred← citeshttps://doi.org/10.1007/bfb0033854openalex-snapshot
Teaching functional and logic programming with a single computation model
inferred← citeshttps://doi.org/10.1007/s00200-010-0122-4openalex-snapshot
Termination of narrowing via termination of rewriting
inferred← citeshttps://doi.org/10.1007/s10990-007-9000-6openalex-snapshot
Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.10.033openalex-snapshot
Rules + strategies for transforming lazy functional logic programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.008openalex-snapshot
Complete symbolic reachability analysis using back-and-forth narrowing
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00265-8openalex-snapshot
Evaluation Strategies for Functional Logic Programming
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00269-5openalex-snapshot
Compact Normalisation Trace via Lazy Rewriting
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00273-7openalex-snapshot
Reduction Strategies for Declarative Programming
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.1016/s1571-0661(04)80347-5openalex-snapshot
Improving the Efficiency of Non-Deterministic Computations1 1Supported in part by NSF grants INT-9981317 and CCR-0110496 and by the Spanish Knowledge Society Foundation, the Spanish Research Funding Agency (CICYT) TIC 2001-2705-C03-01, by Acción Integrade Hispano-Italiana HI2000-0161, and the…
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80350-5openalex-snapshot
Defining Actions in Concurrent Declarative Programming
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80353-0openalex-snapshot
Lazy Rewriting and Context-Sensitive Rewriting
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80691-1openalex-snapshot
A Monadic Semantics for Core Curry1 1This work has been supported in part by the National Science Foundation under grants CCR-0110496 and CCR-0218224
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80697-2openalex-snapshot
Failure and Equality in Functional Logic Programming1 1Work partially supported by the Spanish project TIC2002-01167 ‘MELODIAS’
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80698-4openalex-snapshot
A Narrowing-based Instantiation Rule for Rewriting-based Fold/Unfold Transformations
inferred← citeshttps://doi.org/10.1017/s1471068406002870openalex-snapshot
Forward slicing of functional logic programs by partial evaluation
inferred← citeshttps://doi.org/10.1017/s1471068406002924openalex-snapshot
Constraint functional logic programming over finite domains
inferred← citeshttps://doi.org/10.1017/s1471068411000263openalex-snapshot
On the correctness of pull-tabbing
inferred← citeshttps://doi.org/10.1017/s1471068422000187openalex-snapshot
From Logic to Functional Logic Programs
inferred← citeshttps://doi.org/10.1023/b:lisp.0000029447.02190.42openalex-snapshot
Cost-Augmented Partial Evaluation of Functional Logic Programs
inferred← citeshttps://doi.org/10.1109/icsmc.2002.1167972openalex-snapshot
A partial evaluation tool for multi-paradigm declarative languages
inferred← citeshttps://doi.org/10.1145/3677999.3678279openalex-snapshot
Making a Curry Interpreter using Effects and Handlers
inferred← citeshttps://doi.org/10.4204/eptcs.183.2openalex-snapshot
Needed Computations Shortcutting Needed Steps
inferred← citeshttps://doi.org/10.4204/eptcs.200.2openalex-snapshot
Termination of canonical context-sensitive rewriting and productivity of rewrite systems
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.