159 search results - page 22 / 32 » Semantics of Termination |
IWMMDBMS
1996
13 years 9 months ago
1996
We introduce a constraint-driven methodology for the automated assembly, organization and playout of presentations from multimedia databases. We use inclusion and exclusion constr...
ICFP
2010
ACM
13 years 9 months ago
2010
ACM
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is simil...
ENTCS
2010
13 years 8 months ago
2010
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the mod...
ENTCS
2008
13 years 8 months ago
2008
Graph transformation units are an approach-independent concept for programming by applying rules and imported transformation units to graphs, starting in an initial and ending in ...
FUIN
2006
13 years 8 months ago
2006
Redundant call elimination has been an important program optimisation process as it can produce super-linear speedup in optimised programs. In this paper, we investigate use of the...