4757 search results - page 777 / 952 » Monads for Functional Programming |
158
click to vote
WADS
2009
Springer
15 years 10 months ago
2009
Springer
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
186
click to vote
WFLP
2009
Springer
15 years 10 months ago
2009
Springer
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
129
click to vote
EPIA
2009
Springer
15 years 10 months ago
2009
Springer
Inductive Logic Programming (ILP) [1] systems are general purpose learners that have had significant success on solving a number of relational problems, particularly from the biol...
132
click to vote
FCT
2009
Springer
15 years 10 months ago
2009
Springer
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...
119
click to vote
FCT
2009
Springer
15 years 10 months ago
2009
Springer
The n-ary first and second recursion theorems formalize two distinct, yet similar, notions of self-reference. Roughly, the n-ary first recursion theorem says that, for any n algo...