1151 search results - page 131 / 231 » Collaborative Programming: Applications of Logic and Automat... |
220
click to vote
ENTCS
2007
15 years 3 months ago
2007
Computing with failures is a typical programming technique in functional logic programs. However, there are also situations where a program should not fail (e.g., in a determinist...
129
click to vote
RR
2007
Springer
15 years 9 months ago
2007
Springer
The well-founded semantics (WFS) for logic programs is one of the few major paradigms for closed-world reasoning. With the advent of the Semantic Web, it is being used as part of r...
138
Voted
CSL
2009
Springer
15 years 10 months ago
2009
Springer
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level language...
141
click to vote
LOPSTR
1994
Springer
15 years 7 months ago
1994
Springer
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
119
click to vote
PLILP
1995
Springer
15 years 7 months ago
1995
Springer
We use Girard's linear logic (LL) to produce a semantics for Gamma, a multiset transformation language. The semantics improves on the existing structured operational semantics...