A Tutorial on Proof Theoretic Foundations of Logic Programming
Bruscoli, P. and Guglielmi, A., 2003. A Tutorial on Proof Theoretic Foundations of Logic Programming. Springer, pp. 109-127. (Lecture Notes in Computer Science)
Related documents:This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.
Abstract logic programming is about designing logic programming languages via the proof theoretic notion of uniform provability. It allows the design of purely logical, very expressive logic programming languages, endowed with a rich meta theory. This tutorial intends to expose the main ideas of this discipline in the most direct and simple way.
|Item Type||Conference or Workshop Items (UNSPECIFIED)|
|Creators||Bruscoli, P.and Guglielmi, A.|
|Departments||Faculty of Science > Computer Science|
Actions (login required)