106
click to vote
FPCA
15 years 4 months ago
1991 
Hannan. Making Abstract Machines Less Abstract . In Proc. of FPCA'91, LNCS 523, pages
FPCA
15 years 4 months ago
1991 
We develop a calculus for lazy functional programming based on recursion operators associated with data type de nitions. For these operators we derive various algebraic laws that ...
86
Voted
FPCA
15 years 4 months ago
1991
Objects with dynamic types allow the integration of operations that essentially require runtime type-checking into statically-typed languages. This article presents two extensions...
FPCA
15 years 4 months ago
1991 
We tackle the problem of detecting global variables in functional programs. We present syntactic criteria for single-threading which improves upon previous solutions (both syntact...
|
Programming Languages