1286 search results - page 28 / 258 » From System F to Typed Assembly Language |
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
We propose an extension of Haskell's type class system with bstractions in the type language. Type inference for our extension relies on a novel constrained unification proce...
ESOP
2010
Springer
14 years 5 months ago
2010
Springer
Affine type systems manage resources by preventing some values from being used more than once. This offers expressiveness and performance benefits, but difficulty arises in intera...
TIC
2000
Springer
13 years 11 months ago
2000
Springer
Singleton kinds provide an elegant device for expressing type equality information resulting from modern module languages, but they can severely complicate the metatheory of langu...
ICFP
2004
ACM
14 years 7 months ago
2004
ACM
We study a type system equipped with universal types and equirecursive types, which we refer to as F?. We show that type equality may be decided in time O(n log n), an improvement...
HASKELL
2009
ACM
14 years 2 months ago
2009
ACM
It is common for compilers to derive the calling convention of a function from its type. Doing so is simple and modular but misses many optimisation opportunities, particularly in...