1017 search results - page 18 / 204 » Higher-Order Logic Programming Languages with Constraints: A... |
PLDI
2004
ACM
15 years 3 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
SARA
2009
Springer
15 years 2 months ago
2009
Springer
An important challenge in constraint programming is to rewrite constraint models into executable programs calculating the solutions. This phase of constraint processing may requir...
HASKELL
2006
ACM
15 years 3 months ago
2006
ACM
In this article we present GenI, a chart based surface realisation tool implemented in Haskell. GenI takes as input a set of first order terms (the input semantics) and a grammar...
ENTCS
2002
14 years 9 months ago
2002
Practical declarative multi-paradigm languages combine the main features of functional, logic and concurrent programming (e.g., laziness, sharing, higher-order, logic variables, n...
ICLP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...