218 search results - page 9 / 44 » Types and trace effects of higher order programs |
134
Voted
TLCA
2005
Springer
15 years 9 months ago
2005
Springer
In a series of articles, we developed a method to translate general recursive functions written in a functional programming style into constructive type theory. Three problems rema...
151
Voted
IFL
1998
Springer
15 years 7 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...
120
click to vote
CIE
2010
Springer
15 years 8 months ago
2010
Springer
Containers are a semantic way to talk about strictly positive types. In previous work it was shown that containers are closed under various constructions including products, coprod...
127
click to vote
FSEN
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...
114
Voted
FOSSACS
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We solve the problem of extending Bird and Paterson’s generalized folds for nested datatypes and its dual to inductive and coinductive constructors of arbitrarily high ...