Sciweavers

228 search results - page 16 / 46
» An effective theory of type refinements
Sort
View
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
14 years 1 months ago
Typed compilation of recursive datatypes
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
Joseph Vanderwaart, Derek Dreyer, Leaf Petersen, K...
CORR
2010
Springer
194views Education» more  CORR 2010»
13 years 5 months ago
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
TSP
2008
116views more  TSP 2008»
13 years 7 months ago
Nonideal Sampling and Regularization Theory
Shannon's sampling theory and its variants provide effective solutions to the problem of reconstructing a signal from its samples in some "shift-invariant" space, wh...
Sathish Ramani, Dimitri Van De Ville, Thierry Blu,...
NIPS
2008
13 years 9 months ago
One sketch for all: Theory and Application of Conditional Random Sampling
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
Ping Li, Kenneth Ward Church, Trevor Hastie
ICIS
2000
13 years 9 months ago
A framework of knowledge management systems: issues and challenges for theory and practice
As the basis of value creation increasingly depends on the leverage of the intangible assets of firms, Knowledge Management Systems (KMS) are emerging as powerful sources of compe...
Jungpil Hahn, Mani R. Subramani