203 search results - page 23 / 41 » Datatype-Generic Termination Proofs |
186
click to vote
POPL
2005
ACM
16 years 2 months ago
2005
ACM
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
104
click to vote
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
ITP
2010
15 years 5 months ago
2010
Abstract. Rippling is a heuristic used to guide rewriting and is typically used for inductive theorem proving. We introduce a method to support case-analysis within rippling. Like ...
CSL
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for ...
192
Voted
ESOP
2006
Springer
15 years 5 months ago
2006
Springer
Using a call-by-value functional language as an example, this article illustrates the use of coinductive definitions and proofs in big-step operational semantics, enabling it to d...