19 search results - page 4 / 4 » On Strong Normalization of the Calculus of Constructions wit... |
CSL
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. For nested or heterogeneous datatypes, terminating recursion schemes considered so far have been instances of iteration, excluding efficient definitions of fixed-point ...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...
FOSSACS
2003
Springer
14 years 23 days ago
2003
Springer
Abstract. We solve the problem of extending Bird and Paterson’s generalized folds for nested datatypes and its dual to inductive and coinductive constructors of arbitrarily high ...
ICFP
2010
ACM
13 years 7 months ago
2010
ACM
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...