13 search results - page 3 / 3 » Strong Normalization of Typeable Rewrite Systems |
ICTAC
2004
Springer
13 years 10 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
POPL
2003
ACM
14 years 5 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
POPL
1994
ACM
13 years 9 months ago
1994
ACM
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...