66 search results - page 7 / 14 » Strong Normalization and Equi-(Co)Inductive Types |
CIE
2008
Springer
13 years 9 months ago
2008
Springer
Having principal typings (for short PT) is an important property of type systems. This property guarantees the possibility of type deduction which means it is possible to develop a...
CSL
2008
Springer
13 years 9 months ago
2008
Springer
Type-based termination is a semantically intuitive method that ensures termination of recursive definitions by tracking the size of datatype elements, and by checking that recursiv...
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
We provide a strong normalization result for MLF , a type system generalizing ML with first-class polymorphism as in system F. The proof is achieved by translating MLF into a calc...
CSL
2005
Springer
14 years 1 months ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
TIT
2002
13 years 7 months ago
2002
This paper considers the problem of estimating the parameters of real-valued two-dimensional (2-D) sinusoidal signals observed in colored noise. This problem is a special case of t...