213 search results - page 16 / 43 » Automated Termination Analysis for Logic Programs with Cut |
179
click to vote
CADE
2011
Springer
13 years 11 months ago
2011
Springer
Android is a programming language based on Java and an operating system for embedded or mobile devices whose upper layers are written in that language. It features an extended even...
RR
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we present an embedding of propositional production systems into µ-calculus, and first-order production systems into fixed-point logic, with the aim of using these...
101
click to vote
LOPSTR
2004
Springer
15 years 5 months ago
2004
Springer
Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and have ...
CSL
2009
Springer
15 years 6 months ago
2009
Springer
We develop a polarised variant of Curien and Herbelin’s ¯λµ˜µ calculus suitable for sequent calculi that admit a focalising cut elimination (i.e. whose proofs are focalised ...
CADE
2001
Springer
16 years 7 hour ago
2001
Springer
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...