66 search results - page 2 / 14 » Strong Normalization and Equi-(Co)Inductive Types |
LPAR
2010
Springer
13 years 4 months ago
2010
Springer
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
LFCS
1994
Springer
13 years 10 months ago
1994
Springer
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
ENTCS
2002
13 years 6 months ago
2002
This paper presents a new lambda-calculus with singleton types, called {}. The main novelty of
TIC
1998
Springer
13 years 10 months ago
1998
Springer
HOA
1993
13 years 10 months ago
1993
This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewri...