pith. sign in

arxiv: 1109.2548 · v1 · pith:X4AWPJMDnew · submitted 2011-09-12 · 💻 cs.PL · cs.LO

RedAlert: Determinacy Inference for Prolog

classification 💻 cs.PL cs.LO
keywords determinacyinferencemethodproblemredalertabstractedaddressinganalysis
0
0 comments X
read the original abstract

This paper revisits the problem of determinacy inference addressing the problem of how to uniformly handle cut. To this end a new semantics is introduced for cut, which is abstracted to systematically derive a backward analysis that derives conditions sufficient for a goal to succeed at most once. The method is conceptionally simpler and easier to implement than existing techniques, whilst improving the latter's handling of cut. Formal arguments substantiate correctness and experimental work, and a tool called 'RedAlert' demonstrates the method's generality and applicability.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.