Sciweavers

1458 search results - page 27 / 292
» Monads for incremental computing
Sort
View
ENTCS
2010
117views more  ENTCS 2010»
13 years 10 months ago
Categorifying Computations into Components via Arrows as Profunctors
The notion of arrow by Hughes is an axiomatization of the algebraic structure possessed by structured computations in general. We claim that an arrow also serves as a basic compon...
Kazuyuki Asada, Ichiro Hasuo
AAAI
2008
14 years 5 days ago
Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation
Abductive diagnosis is an important method to identify explanations for a given set of observations. Unfortunately, most of the algorithmic problems in this area are intractable. ...
Georg Gottlob, Reinhard Pichler, Fang Wei

Book
594views
15 years 8 months ago
A Gentle Introduction to Haskell
The book covers the following topics: Values, Types, Functions, Case Expressions and Pattern Matching, Type Classes and Overloading, Input/Output, Standard Haskell Classes Monads,...
Paul Hudak, John Peterson, Joseph Fasel