4757 search results - page 15 / 952 » Monads for Functional Programming |
ENTCS
2010
13 years 7 months ago
2010
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
GPCE
2005
Springer
2005
Springer
Multi-stage Programming with Functors and Monads: Eliminating Abstraction Overhead from Generic Code
14 years 1 months ago
PPDP
2005
Springer
14 years 1 months ago
2005
Springer
Lolli is a logic programming language based on the asynchronous propositions of intuitionistic linear logic. It uses a backward chaining, backtracking operational semantics. In th...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Following the idea developed by I. Simon in his theorem of Ramseyan factorisation forests, we develop a result of ‘deterministic factorisations’. This extra determinism propert...