4370 search results - page 321 / 874 » Algebra of Logic Programming |
117
Voted
ESOP
2010
Springer
15 years 10 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...
FLOPS
2004
Springer
15 years 6 months ago
2004
Springer
Restricting polymorphism to values is now the standard way to obtain soundness in ML-like programming languages with imperative features. While this solution has undeniable advant...
131
Voted
ESOP
2010
Springer
15 years 10 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...
100
Voted
TARK
2005
Springer
15 years 6 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...
121
click to vote
JAR
2010
14 years 7 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 ...