66 search results - page 6 / 14 » Strong Normalization and Equi-(Co)Inductive Types |
133
Voted
CVPR
2010
IEEE
15 years 3 months ago
2010
IEEE
We propose a new algorithm for learning kernels for variants of the Normalized Cuts (NCuts) objective – i.e., given a set of training examples with known partitions, how should ...
128
Voted
LFCS
1994
Springer
15 years 7 months ago
1994
Springer
We study the cube of type assignment systems, as introduced in [13], and confront it with Barendregt's typed -cube [4]. The first is obtained from the latter through applying...
117
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
A type-based approach to termination uses sized types: an ordinal bound for the size of a data structure is stored in its type. A recursive function over a sized type is accepted i...
152
Voted
TYPES
2004
Springer
15 years 9 months ago
2004
Springer
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
146
Voted
ENTCS
2002
15 years 3 months ago
2002
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...