1776 search results - page 35 / 356 » Using a Logic Programming Language with Persistence and Cont... |
176
click to vote
FSTTCS
1999
Springer
15 years 10 months ago
1999
Springer
The λ-calculus has been much used to study the theory of substitution in logical systems and programming languages. However, with explicit substitutions, it is possible to get fi...
168
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
271
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
165
click to vote
ICECCS
2006
IEEE
15 years 12 months ago
2006
IEEE
This paper formalizes the notion of a design model structurally conforming to a design pattern by representing the model as a logic program whilst the pattern as a query. The conf...
157
click to vote
PPDP
2007
Springer
16 years 20 hour ago
2007
Springer
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...