169 search results - page 1 / 34 » A type system for well-founded recursion |
POPL
2004
ACM
14 years 5 months ago
2004
ACM
In the interest of designing a recursive module extension to ML that is as simple and general as possible, we propose a novel type system for general recursion over effectful expr...
RTA
2004
Springer
13 years 10 months ago
2004
Springer
Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent type...
ENTCS
2007
13 years 4 months ago
2007
This paper is concerned with a proof-theoretic observation about two kinds of proof systems for regular cyclic objects. It is presented for the case of two formal systems that are...
ICFP
2007
ACM
14 years 4 months ago
2007
ACM
There has been much work in recent years on extending ML with recursive modules. One of the most difficult problems in the development of such an extension is the double vision pr...
TIC
2000
Springer
13 years 8 months ago
2000
Springer
Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a ...