233 search results - page 34 / 47 » Computational Lambda-Calculus and Monads |
AAAI
2008
2008
Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation
13 years 9 months ago
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. ...
Book
The book covers the following topics: Values, Types, Functions, Case Expressions and Pattern Matching, Type Classes and Overloading, Input/Output, Standard Haskell Classes
Monads,...
ENTCS
2008
13 years 7 months ago
2008
We argue that a realistic model for quantum computations should be general with respect to measurements, and complete with respect to the information flow between the quantum and ...
BIRTHDAY
2006
Springer
13 years 11 months ago
2006
Springer
d Abstract) Gordon Plotkin1, LFCS, School of Informatics, University of Edinburgh, UK. The application of ideas from universal algebra to computer science has long been a major the...
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
Nested Pushdown Trees are unfoldings of pushdown graphs with an additional jump-relation. These graphs are closely related to collapsible pushdown graphs. They enjoy decidable µ-c...