Skip to main content

Mutual Exclusion by Interpolation: 11th International Symposium, FLOPS 2012, Kobe, Japan, May 23-25, 2012, Proceedings

Kriener, Jael and King, Andy (2012) Mutual Exclusion by Interpolation: 11th International Symposium, FLOPS 2012, Kobe, Japan, May 23-25, 2012, Proceedings. In: Schrijvers, Tom and Thiemann, Peter, eds. Functional and Logic Programming. Lecture Notes in Computer Science, 7294 . Springer, pp. 182-196. ISBN 978-3-642-29821-9. (doi:10.1007/978-3-642-29822-6_16)

Abstract

The question of what constraints must hold for a predicate to behave as a (partial) function, is key to understanding the behaviour of a logic program. It has been shown how this question can be answered by combining backward analysis, a form of analysis that propagates determinacy requirements against the control flow, with a component for deriving so-called mutual exclusion conditions. The latter infers conditions sufficient to ensure that if one clause yields an answer then another cannot. This paper addresses the challenge of how to compute these conditions by showing that this problem can be reformulated as that of vertex enumeration. Whilst directly applicable in logic programming, the method might well also find application in reasoning about type classes.

Item Type: Book section
DOI/Identification number: 10.1007/978-3-642-29822-6_16
Subjects: A General Works
Divisions: Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User: Andy King
Date Deposited: 12 Dec 2013 21:03 UTC
Last Modified: 29 May 2019 11:40 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/37588 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year