2701 search results - page 61 / 541 » On the form of witness terms |
282
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
This paper proposes a lightweight fusion method for general recursive function definitions. Compared with existing proposals, our method has several significant practical features...
170
click to vote
TYPES
2007
Springer
16 years 9 days ago
2007
Springer
We present a procedure for computing normal forms of terms in Abadi and Cardelli’s functional object calculus. Even when equipped with simple types, terms of this calculus are no...
146
click to vote
WOLLIC
2007
Springer
16 years 9 days ago
2007
Springer
Hydra games were introduced by Kirby and Paris, for the formulation of a result which is independent from Peano arithmetic but depends on the transfinite structure of 0. Tree ordi...
175
click to vote
CLEF
2005
Springer
15 years 11 months ago
2005
Springer
This document describes the CLIPS experiments in the CLEF 2005 campaign. We used a surface-syntactic parser in order to extract new indexing terms. These terms are considered synta...
143
click to vote
CSL
2004
Springer
15 years 11 months ago
2004
Springer
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a...