Sciweavers

770 search results - page 64 / 154
» Dinatural Terms in System F
Sort
View
TSP
2010
14 years 4 months ago
Compressed sensing performance bounds under Poisson noise
Abstract--This paper describes performance bounds for compressed sensing (CS) where the underlying sparse or compressible (sparsely approximable) signal is a vector of nonnegative ...
Maxim Raginsky, Rebecca Willett, Zachary T. Harman...
POPL
2006
ACM
15 years 10 months ago
Modular set-based analysis from contracts
In PLT Scheme, programs consist of modules with contracts. The latter describe the inputs and outputs of functions and objects via predicates. A run-time system enforces these pre...
Philippe Meunier, Robert Bruce Findler, Matthias F...
POPL
2005
ACM
15 years 10 months ago
Associated types with class
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...
Manuel M. T. Chakravarty, Gabriele Keller, Simon L...
ICFP
2006
ACM
15 years 9 months ago
Static analysis for syntax objects
We describe an s-expression based syntax-extension framework much like Scheme macros, with a key additional facility: the ability to define static semantics, such as type systems ...
David Fisher, Olin Shivers
EDOC
2007
IEEE
15 years 4 months ago
Getting Rid of the OR-Join in Business Process Models
Abstract— In practice, the development of process-aware information systems suffers from a gap between conceptual business process models and executable workflow specifications...
Jan Mendling, Boudewijn F. van Dongen, Wil M. P. v...