66 search results - page 2 / 14 » Strong Normalization and Equi-(Co)Inductive Types |
121
click to vote
LPAR
2010
Springer
15 years 1 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...
137
Voted
LFCS
1994
Springer
15 years 7 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...
100
Voted
ENTCS
2002
15 years 3 months ago
2002
This paper presents a new lambda-calculus with singleton types, called {}. The main novelty of
122
click to vote
HOA
1993
15 years 7 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...