203 search results - page 16 / 41 » Datatype-Generic Termination Proofs |
126
click to vote
TLCA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We investigate the question of what constitutes a proof when quantifiers and multiplicative units are both present. On the technical level this paper provides two new as...
118
click to vote
IFIP
2004
Springer
15 years 7 months ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
103
click to vote
CSL
2001
Springer
15 years 6 months ago
2001
Springer
We introduce a method of extending arbitrary categories by a terminal object and apply this method in various type theoretic settings. In particular, we show that categories that a...
145
Voted
FOSSACS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
113
click to vote
TACAS
2010
Springer
15 years 9 months ago
2010
Springer
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...