A framework for computing finite SLD trees
From MaRDI portal
Publication:2258840
DOI10.1016/j.jlamp.2014.11.006zbMath1319.68055OpenAlexW2115949022MaRDI QIDQ2258840
Publication date: 27 February 2015
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2014.11.006
Related Items (2)
Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems ⋮ Can you answer while you wait?
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cost analysis of object-oriented bytecode programs
- Narrowing vs. SLD-resolution
- From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic
- A general criterion for avoiding infinite unfolding during partial deduction
- A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs
- Termination Graphs for Java Bytecode
- A Finite Representation of the Narrowing Space
- Towards Erlang Verification by Term Rewriting
- Automated termination analysis for logic programs with cut
- Test case generation for object-oriented imperative languages in CLP
- Partial evaluation in logic programming
- Transformation of logic programs: Foundations and techniques
- The integration of functions into logic programming: From theory to practice
- Resource-Driven CLP-Based Test Case Generation
- Annotation of logic programs for independent AND-parallelism by partial evaluation
- Conjunctive partial deduction: foundations, control, algorithms, and experiments
- Lazy abstraction
- Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
- Automated Termination Analysis of Java Bytecode by Term Rewriting
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- A practical framework for theabstract interpretation of logic programs
This page was built for publication: A framework for computing finite SLD trees
