1017 search results - page 34 / 204 » Higher-Order Logic Programming Languages with Constraints: A... |
TACS
2001
Springer
15 years 2 months ago
2001
Springer
We give a logic programming language based on Fiore, Plotkin and Turi’s binding algebras. In this language, we can use not only first-order terms but also terms involving variab...
BIRTHDAY
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We develop a logic for reasoning about object-oriented programs. The logic is for a language with an imperative semantics and aliasing, and accounts for self-reference in...
136
click to vote
PLPV
2011
ACM
14 years 14 days ago
2011
ACM
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
CL
2000
Springer
14 years 9 months ago
2000
Springer
Recent logic programming languages employ dynamic scheduling of calls to improve e ciency of programs. Dynamic scheduling is realized by allowing some calls to be dynamically &quo...
ESOP
2005
Springer
15 years 3 months ago
2005
Springer
Abadi-Leino Logic is a Hoare-calculus style logic for a simple imperative and object-based language where every object comes with its own method suite. Consequently, methods need t...