Sciweavers

90 search results - page 11 / 18
» rules 1995
Sort
View
TYPES
1995
Springer
13 years 11 months ago
A Natural Deduction Approach to Dynamic Logic
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory,...
Furio Honsell, Marino Miculan
RR
2007
Springer
14 years 1 months ago
Decidability Under the Well-Founded Semantics
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...
Natalia Cherchago, Pascal Hitzler, Steffen Hö...
CONCUR
1995
Springer
13 years 11 months ago
Bisimulations for a Calculus of Broadcasting Systems
We develop a theory of bisimulation equivalence for the broadcast calculus CBS. Both the strong and weak versions of bisimulation congruence we study are justi ed in terms of a cha...
Matthew Hennessy, Julian Rathke
DBPL
1995
Springer
144views Database» more  DBPL 1995»
13 years 11 months ago
An Algebraic Framework for Physical OODB Design
Physical design for object-oriented databases is still in its infancy. Implementation decisions often intrude into the conceptual design (such as inverse links and object decompos...
Leonidas Fegaras, David Maier
FPCA
1995
13 years 11 months ago
Shortcut Deforestation in Calculational Form
In functional programming, intermediate data structures are often used to “glue’) together small programs. Deforestation is a program transformation to remove these intermedia...
Akihiko Takano, Erik Meijer