Sciweavers

41 search results - page 6 / 9
» Product Operations in Strong Monads
Sort
View
LICS
2006
IEEE
14 years 2 months ago
Boolean Algebras for Lambda Calculus
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
Giulio Manzonetto, Antonino Salibra
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
14 years 9 months ago
Toward a general theory of quantum games
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
Gus Gutoski, John Watrous
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
14 years 8 months ago
Distributed data-parallel computing using a high-level programming language
The Dryad and DryadLINQ systems offer a new programming model for large scale data-parallel computing. They generalize previous execution environments such as SQL and MapReduce in...
Michael Isard, Yuan Yu
TAMC
2010
Springer
14 years 1 months ago
Algebraic Proofs over Noncommutative Formulas
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
Iddo Tzameret
CCE
2005
13 years 8 months ago
On-line monitoring of a sugar crystallization process
The present paper reports a comparative evaluation of four multivariate statistical process control (SPC) techniques for the on-line monitoring of an industrial sugar crystallizat...
A. Simoglou, Petia Georgieva, E. B. Martin, A. J. ...