Sciweavers

120 search results - page 23 / 24
» Theorems for Free!
Sort
View
102
Voted
TLCA
2009
Springer
15 years 6 months ago
Parametricity for Haskell with Imprecise Error Semantics
Types play an important role both in reasoning about Haskell and for its implementation. For example, the Glasgow Haskell Compiler performs certain fusion transformations that are...
Florian Stenger, Janis Voigtländer
TNN
2008
74views more  TNN 2008»
14 years 11 months ago
Pattern Representation in Feature Extraction and Classifier Design: Matrix Versus Vector
The matrix, as an extended pattern representation to the vector, has proven to be effective in feature extraction. But the subsequent classifier following the matrix-pattern-orien...
Zhe Wang, Songcan Chen, Jun Liu, Daoqiang Zhang
POPL
2010
ACM
15 years 9 months ago
Contracts Made Manifest
Since Findler and Felleisen [2002] introduced higher-order contracts, many variants have been proposed. Broadly, these fall into two groups: some follow Findler and Felleisen in u...
Benjamin C. Pierce, Michael Greenberg, Stephanie W...
SPAA
2009
ACM
16 years 6 days ago
Buffer management for colored packets with deadlines
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the...
Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Mosci...
109
Voted
ICFP
2005
ACM
15 years 11 months ago
A computational approach to reflective meta-reasoning about languages with bindings
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...