Handbook of theoretical computer science (vol. B): formal models and semantics
Handbook of theoretical computer science (vol. B): formal models and semantics
Logic programming with functions and predicates: the language Babel
Journal of Logic Programming
Static analysis of logic programs for independent and parallelism
Journal of Logic Programming
Fast strictness analysis based on demand propagation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Using regular approximations for generalisation during partial evalution
PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Journal of the ACM (JACM)
Efficient Lazy Narrowing using Demandedness Analysis
PLILP '93 Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming
Denotational Abstract Interpretation of Functional Logic Programs
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
The Theory and Practice of Transforming Call-by-need into Call-by-value
Proceedings of the Fourth 'Colloque International sur la Programmation' on International Symposium on Programming
Lazy Narrowing in a Graph Machine
Proceedings of the Second International Conference on Algebraic and Logic Programming
Extending Constructive Negation for Partial Functions in Lazy Functional-logic Languages
ELP '96 Proceedings of the 5th International Workshop on Extensions of Logic Programming
Fast narrowing-driven partial evaluation for inductively sequential programs
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |
To alleviate the inefficiencies caused by the interaction of the logic and functional sides, integrated languages may take advantage of demand information, i.e. knowing in advance which computations are needed and, to which extent, in a particular context. This work studies demand analysis – which is closely related to backwards strictness analysis – in a semantic framework of partial predicates, which in turn are constructive realizations of ideals in a domain. This will allow us to give a concise, unified presentation of demand analysis, to relate it to other analyses based on abstract interpretation or strictness logics, some hints for the implementation, and, more important, to prove the soundness of our analysis based on demand equations. There are also some innovative results. One of them is that a set constraint-based analysis has been derived in a stepwise manner using ideas taken from the area of program transformation. The other one is the possibility of using program transformation itself to perform the analysis, specially in those domains of properties where algorithms based on constraint solving are too weak.