Lambda lifting: transforming programs to recursive equations
Proc. of a conference on Functional programming languages and computer architecture
Unfold/fold program transformations
Algebraic methods in semantics
A survey and classification of some program transformation approaches and techniques
The IFIP TC2/WG 2.1 Working Conference on Program specification and transformation
Deforestation: transforming programs to eliminate trees
Proceedings of the Second European Symposium on Programming
Preservation of stronger equivalence in unfold/fold logic program transformation
Theoretical Computer Science - Special issue on the international conference on fifth generation computer systems. Tokyo, 1988
Sequentiality in orthogonal term rewriting systems
Journal of Symbolic Computation
Logic programming with functions and predicates: the language Babel
Journal of Logic Programming
A transformation system for deductive database modules with perfect model semantics
Theoretical Computer Science
Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
Towards an automated tupling strategy
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Total correctness by local improvement in the transformation of functional programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Rules and strategies for transforming functional and logic programs
ACM Computing Surveys (CSUR)
Call by need computations to root-stable form
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Controlling generalization and polyvariance in partial deduction of normal logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Term rewriting and all that
Partial evaluation of functional logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Specialization of inductively sequential functional logic programs
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Program improvement by internal specialization
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Synchronisation Analysis to Stop Tulping
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
Automatic Optimization of Multi-paradigm Declarative Programs
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
A Transformation System for Lazy Functional Logic Programs
FLOPS '99 Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming
Proceedings of the Third International Conference on Algebraic and Logic Programming
Safe Folding/Unfolding with Conditional Narrowing
ALP '97-HOA '97 Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming
Homeomorphic embedding for online termination of symbolic methods
The essence of computation
Listlessness is better than laziness: an algorithm that transforms applicative programs to eliminate intermediate lists
Specialization of functional logic programs based on needed narrowing
Theory and Practice of Logic Programming
Loop detection in term rewriting using the eliminating unfoldings
Theoretical Computer Science
An improved reductant calculus using fuzzy partial evaluation techniques
Fuzzy Sets and Systems
Optimizing Fuzzy Logic Programs by Unfolding, Aggregation and Folding
Electronic Notes in Theoretical Computer Science (ENTCS)
A hybrid programming scheme combining fuzzy-logic and functional-logic resources
Fuzzy Sets and Systems
Thresholded Tabulation in a Fuzzy Logic Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
Unfolding-based Improvements on Fuzzy Logic Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
A fold/unfold transformation framework for rewrite theories extended to CCT
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
On fuzzy unfolding: A multi-adjoint approach
Fuzzy Sets and Systems
Detecting non-termination of term rewriting systems using an unfolding operator
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
An integrated framework for the diagnosis and correction of rule-based programs
Theoretical Computer Science
Transformation and debugging of functional logic programs
A 25-year perspective on logic programming
A static preprocess for improving fuzzy thresholded tabulation
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
Building a fuzzy transformation system
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Determinization of conditional term rewriting systems
Theoretical Computer Science
Hi-index | 5.23 |
This work introduces a transformation methodology for functional logic programs based on needed narrowing, the optimal and complete operational principle for modern declarative languages which integrate the best features of functional and logic programming. We provide correctness results for the transformation system w.r.t, the set of computed values and answer substitutions and show that the prominent properties of needed narrowing--namely, the optimality w.r.t, the length of derivations and the number of computed solutions--carry over to the transformation process and the transformed programs. We illustrate the power of the system by taking on in our setting two well-known transformation strategies (composition and tupling). We also provide an implementation of the transformation system which, by means of some experimental results, highlights the potentiality of our approach.