Sciweavers

4842 search results - page 403 / 969
» A Calculus for Data Mapping
Sort
View
ENTCS
2007
121views more  ENTCS 2007»
15 years 6 months ago
Incremental Parametric Development of Greedy Algorithms
The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properti...
Dominique Cansell, Dominique Méry
ENTCS
2007
98views more  ENTCS 2007»
15 years 6 months ago
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
Jesper Bengtson, Joachim Parrow
JUCS
2006
145views more  JUCS 2006»
15 years 6 months ago
Computer Science, Logic, Informatics Education
: Our aim is to discuss what, when and, how deep logic should be taught in the computer science education in connection with the so called "Bologna process". We survey th...
Katalin Pásztor-Varga, Magda Várter&...
LMCS
2006
79views more  LMCS 2006»
15 years 6 months ago
Computably Based Locally Compact Spaces
tract Stone Duality) is a re-axiomatisation of general topology in which the topology on a space is treated, not as an infinitary lattice, but as an exponential object of the same...
Paul Taylor 0002
APAL
2004
78views more  APAL 2004»
15 years 6 months ago
Ternary relations and relevant semantics
Modus ponens provides the central theme. There are laws, of the form A C. A logic (or other theory) L collects such laws. Any datum A (or theory T incorporating such data) provid...
Robert K. Meyer