Warren's abstract machine: a tutorial reconstruction
Warren's abstract machine: a tutorial reconstruction
A simple code improvement scheme for Prolog
Journal of Logic Programming
Deriving descriptions of possible values of program variables by means of abstract interpretation
Journal of Logic Programming
Live-structure dataflow analysis for Prolog
ACM Transactions on Programming Languages and Systems (TOPLAS)
Backtracking without trailing in CLP ( RLin )
ACM Transactions on Programming Languages and Systems (TOPLAS)
Herbrand constraint solving in HAL
Proceedings of the 1999 international conference on Logic programming
Comparing trailing and copying for constraint programming
Proceedings of the 1999 international conference on Logic programming
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Hi-index | 0.00 |
Trailing of bindings in the PARMA variable representation is expensive in time and space. Two schemes are presented that lower its cost: the first is a technique that halves the space cost of trailing in PARMA. It can be used with conditional and unconditional trailing. It is illustrated and evaluated in the context of dProlog and in the Mercury backend of HAL. The second scheme combines a variant of a previously developed trailing analysis with the first technique. Empirical evidence shows the usefulness of these schemes and that the combination is more effective than each scheme apart.