884 search results - page 46 / 177 » A Proof Theory for DL-Lite |
FASE
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Abstraction is essential in the formal specification of programs. A common way of writing abstract specifications is to specify implementations in terms of basic mathem...
102
click to vote
IFM
2007
Springer
15 years 6 months ago
2007
Springer
We present an approach to modelling Abadi–Cardelli-style object calculi as Unifying Theories of Programming (UTP) designs. Here we provide a core object calculus with an operatio...
LFCS
2009
Springer
15 years 4 months ago
2009
Springer
A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are compatible. Bialgebras are usually studied over a ...
ICFP
1996
ACM
15 years 4 months ago
1996
ACM
Concurrent ML (CML) is an extension of Standard ML of New Jersey with concurrent features similar to those of process algebra. In this paper, we build upon John Reppy's reduc...
ACL
1993
15 years 1 months ago
1993
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...