Robert Giegerich, Peter Steffen (auth.), Eerke A. Boiten, Bernhard Möller (eds.)3540438572, 9783540438571
The 11 revised full papers presented were carefully reviewed and selected for inclusion in the book; also presented are one invited paper and the abstracts of two invited talks. Among the topics covered are programming methodology, program specification, program transformation, programming paradigms, programming calculi, and programming language semantics.
Table of contents :
Implementing Algebraic Dynamic Programming in the Functional and the Imperative Programming Paradigm….Pages 1-20
Some Results in Dynamic Model Theory….Pages 21-21
Mathematics in Computer Science Curricula….Pages 22-22
Logical Relations and Galois Connections….Pages 23-39
Transformational Derivation of Greedy Network Algorithms from Descriptive Specifications….Pages 40-67
Fine Control of Demand in Haskell….Pages 68-93
Reasoning about Timeouts….Pages 94-116
Eternity Variables to Simulate Specifications….Pages 117-130
Constructing Tournament Representations: An Exercise in Pointwise Relational Programming….Pages 131-147
Type-Indexed Data Types….Pages 148-174
Verification of Java’s AbstractCollection Class: A Case Study….Pages 175-194
Solving Regular Path Queries….Pages 195-208
Inverting Functions as Folds….Pages 209-232
From Kleene Algebra to Refinement Algebra….Pages 233-262
Reviews
There are no reviews yet.