159 search results - page 7 / 32 » Semantics of Termination |
MOBIQUITOUS
2007
IEEE
14 years 2 months ago
2007
IEEE
— According to the IETF definition, “presence conveys the ability and willingness of a user to communicate across a set of devices”. In this paper we use semantic techniques ...
CALCO
2009
Springer
14 years 2 months ago
2009
Springer
Higher-order recursion schemes are equations defining recursively new operations from given ones called “terminals”. Every such recursion scheme is proved to have a least inte...
APLAS
2010
ACM
13 years 8 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
LOPSTR
2004
Springer
14 years 1 months ago
2004
Springer
Most logic programming languages actually provide some kind of dynamic scheduling to increase the expressive power and to control execution. Input consuming derivations have been i...
LOPSTR
2009
Springer
14 years 2 months ago
2009
Springer
We propose a new grouping operator for logic programs based on the group_by operator of SQL. The novelty of our proposal lies in the use of modes, which allows us to relax some rat...