Sciweavers

77 search results - page 9 / 16
» Algebras for Parameterised Monads
Sort
View
LFP
1990
96views more  LFP 1990»
13 years 8 months ago
Comprehending Monads
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970�...
Philip Wadler
IJIIDS
2010
136views more  IJIIDS 2010»
13 years 2 months ago
Kleisli category and database mappings
Abstract. This paper presents the semantics of database mappings in the relational database (DB) category, based on the power-view monad T and monadic algebras. The semantics can b...
Zoran Majkic, Bhanu Prasad
LICS
2008
IEEE
14 years 1 months ago
Caterpillar Duality for Constraint Satisfaction Problems
The study of constraint satisfaction problems definable in various fragments of Datalog has recently gained considerable importance. We consider constraint satisfaction problems ...
Catarina Carvalho, Víctor Dalmau, Andrei A....
DLT
2004
13 years 8 months ago
Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey
New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly a...
Bruno Courcelle
FPLE
1995
13 years 11 months ago
Explaining Algebraic Theory with Functional Programs
Abstract. A hierarchy of six important structures from abstract algebra (groups, rings, fields etc.) is introduced as Gofer class definitions and laws about them. Many instance d...
Jeroen Fokker