237 search results - page 24 / 48 » Coercions in a polymorphic type system |
CORR
2004
Springer
13 years 8 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
WOLLIC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. The λ-calculus with de Bruijn indices, called λdB, assembles each α-class of λ-terms into a unique term, using indices instead of variable names. Intersection types p...
ICCCN
2007
IEEE
14 years 3 months ago
2007
IEEE
—Worms are a significant threat to network systems, both through resource consumption and malicious activity. This paper examines the spread of a class of hitlist-based worms tha...
APLAS
2010
ACM
13 years 9 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
LFP
1994
13 years 10 months ago
1994
We present a method, adapted to polymorphically typed functional languages, to detect and collect more garbage than existing GCs. It can be applied to strict or lazy higher order ...