4370 search results - page 396 / 874 » Algebra of Logic Programming |
132
click to vote
FOSSACS
2006
Springer
15 years 7 months ago
2006
Springer
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...
119
Voted
CTCS
1997
Springer
15 years 7 months ago
1997
Springer
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
116
click to vote
ICFP
1996
ACM
15 years 7 months ago
1996
ACM
An extension of the simply-typed lambda calculus is presented which contains both well-structured inductive and coinductive types, and which also identifies a class of types for w...
144
click to vote
TLDI
2009
ACM
16 years 7 days ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
129
click to vote
LATA
2009
Springer
15 years 10 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...