850 search results - page 35 / 170 » A Logic Programming Language Based on Binding Algebras |
108
click to vote
CSL
2006
Springer
15 years 5 months ago
2006
Springer
The goal of this note is to provide a background and references for the invited lecture presented at Computer Science Logic 2006. We briefly discuss motivations that led to the eme...
122
click to vote
PPDP
2005
Springer
15 years 6 months ago
2005
Springer
The paper develops a self-tuning resource aware partial evaluation technique for Prolog programs, which derives its own control strategies tuned for the underlying computer archit...
JSW
2006
15 years 1 months ago
2006
Abstract-- This paper describes a technique combining higher order functions, algebraic datatypes, and monads to incrementally implement syntax driven logics. Extensions can be com...
129
click to vote
CADE
2004
Springer
16 years 1 months ago
2004
Springer
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
122
click to vote
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...