56 search results - page 3 / 12 » Typed compilation of recursive datatypes |
ICFP
2001
ACM
14 years 6 months ago
2001
ACM
Standard ML is a statically typed programming language that is suited for the construction of both small and large programs. "Programming in the small" is captured by St...
CSL
2008
Springer
13 years 8 months ago
2008
Springer
Type-based termination is a semantically intuitive method that ensures termination of recursive definitions by tracking the size of datatype elements, and by checking that recursiv...
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 ...
SAS
1993
Springer
13 years 10 months ago
1993
Springer
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
APSEC
1999
IEEE
13 years 10 months ago
1999
IEEE
For the practical development of provably correct software for embedded systems the close integration of CASE tools and verification tools is required. This paper describes the co...