Towards a verified determinacy analysis for Prolog including cut
The question of determinacy is constantly on the mind of a good Prolog programmer. To write correct, efficient programs, it is extremely important to understand how many different answers a goal will compute and whether it will compute the same answer more than once. This thesis presents a backward...
| Main Author: | |
|---|---|
| Published: |
University of Kent
2014
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.655653 |