3119 search results - page 438 / 624 » General Default Logic |
181
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
155
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
184
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
187
click to vote
CIE
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
175
click to vote
PPDP
2007
Springer
16 years 19 days ago
2007
Springer
Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption and more generally to optimize a given program. Essentially it con...