143 search results - page 27 / 29 » Termination of Well-Typed Logic Programs |
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
LOPSTR
2007
Springer
14 years 1 months ago
2007
Springer
Homeomorphic Embedding (HEm) has proven to be very powerful for supervising termination of computations, provided that such computations are performed over a finite signature, i.e...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
Nested datatypes are families of datatypes that are indexed over all types and where the datatype constructors relate different members of the family. This may be used to represent...
TLCA
2005
Springer
14 years 26 days ago
2005
Springer
We explore foundational typing support for strong updates — updating a memory cell to hold values of unrelated types at different points in time. We present a simple, but expres...
ICLP
1997
Springer
13 years 11 months ago
1997
Springer
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...