199 search results - page 6 / 40 » Combining Strict and Soft Typing in Functional Programming |
CORR
2006
Springer
15 years 11 days ago
2006
Springer
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...
94
Voted
FPCA
1989
15 years 4 months ago
1989
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
124
Voted
IFL
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. In this report a new backward strictness analysis for functional languages is presented. It is called higher order demand propagation and is applicable to a realistic non...
APLAS
2004
ACM
15 years 5 months ago
2004
ACM
Abstract. Region-based memory management scheme has been proposed for the programming language ML. In this scheme, a compiler statically estimates the lifetime of each object by pe...
PPDP
2001
Springer
15 years 4 months ago
2001
Springer
Cyclic data structures can be tricky to create and manipulate in declarative programming languages. In a declarative setting, a natural way to view cyclic structures is as denotin...