169 search results - page 3 / 34 » A type system for well-founded recursion |
CSL
2004
Springer
13 years 11 months 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 ...
CONCUR
2006
Springer
13 years 10 months ago
2006
Springer
We extend a previous type system for the -calculus that guarantees deadlock-freedom. The previous type systems for deadlockfreedom either lacked a reasonable type inference algorit...
MST
2008
13 years 6 months ago
2008
Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalised throu...
LICS
2000
IEEE
13 years 9 months ago
2000
IEEE
Equality and subtyping of recursive types have been studied in the 1990s by Amadio and Cardelli; Kozen, Palsberg, and Schwartzbach; Brandt and Henglein; and others. Potential appl...
ICFP
2004
ACM
14 years 6 months ago
2004
ACM
We study a type system equipped with universal types and equirecursive types, which we refer to as F?. We show that type equality may be decided in time O(n log n), an improvement...