1763 search results - page 263 / 353 » A Formalization of Polytime Functions |
162
click to vote
POPL
2005
ACM
15 years 10 months ago
2005
ACM
Haskell's type classes allow ad-hoc overloading, or typeindexing, of functions. A natural generalisation is to allow type-indexing of data types as well. It turns out that th...
125
click to vote
POPL
2003
ACM
15 years 10 months ago
2003
ACM
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
OSDI
2004
ACM
15 years 10 months ago
2004
ACM
A fundamental piece of information required in intelligent storage systems is the liveness of data. We formalize the notion of liveness within storage, and present two classes of ...
ICSE
2003
IEEE-ACM
15 years 10 months ago
2003
IEEE-ACM
Methods to assess and ensure system usability are becoming increasingly important as market edge becomes less dependent on function and more dependent on ease of use, and as recog...
ICFP
2008
ACM
15 years 9 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...