4743 search results - page 774 / 949 » Introduction to Functional Programming |
229
click to vote
WFLP
2009
Springer
16 years 1 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...
162
click to vote
EPIA
2009
Springer
16 years 1 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...
160
click to vote
FCT
2009
Springer
16 years 1 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...
143
click to vote
FCT
2009
Springer
16 years 1 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...
160
click to vote
FSEN
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...