1096 search results - page 32 / 220 » Type inference for atomicity |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following p...
ASPLOS
2006
ACM
14 years 1 months ago
2006
ACM
Concurrency bugs are among the most difficult to test and diagnose of all software bugs. The multicore technology trend worsens this problem. Most previous concurrency bug detect...
APAL
2007
13 years 7 months ago
2007
In this paper we consider a type system with a universal type ω where any term (whether open or closed, β-normalising or not) has type ω. We provide this type system with a rea...
MSCS
2008
13 years 7 months ago
2008
The idea of coercive subtyping, a theory of abbreviation for dependent type theories, is incorporated into the polymorphic type system in functional programming languages. The tra...
TCS
2008
13 years 7 months ago
2008
Interpretation and Types for Systems Biology Fran