3481 search results - page 259 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
148
Voted
SLP
1994
15 years 5 months ago
1994
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive ...
151
click to vote
ESOP
2010
Springer
16 years 1 months ago
2010
Springer
In search for a foundational framework for reasoning about observable behavior of programs that may not terminate, we have previously devised a trace-based big-step semantics for W...
161
click to vote
ESOP
2010
Springer
16 years 1 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
136
click to vote
TARK
2005
Springer
15 years 9 months ago
2005
Springer
The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighb...
154
click to vote
JAR
2010
14 years 11 months ago
2010
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves ...