144 search results - page 4 / 29 » Nondeterminism Analysis of Functional Logic Programs |
GLVLSI
1996
IEEE
14 years 2 months ago
1996
IEEE
Inthispaperweintroduceanondeterministiccounterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually...
PLILP
1997
Springer
14 years 1 months ago
1997
Springer
We introduce a framework for managing as a whole the space of a narrowing computation. The aim of our framework is to find a finite representation of an infinite narrowing space...
POPL
2011
ACM
13 years 19 days ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
PPDP
2007
Springer
14 years 3 months ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
IFIP
1994
Springer
14 years 1 months ago
1994
Springer