Invited Talks.- Implementing Algebraic Dynamic Programming in the Functional and the Imperative Programming Paradigm.- Some Results in Dynamic Model Theory.- Mathematics in Computer Science Curricula.- Contributed Papers.- Logical Relations and Galois Connections.- Transformational Derivation of Greedy Network Algorithms from Descriptive Specifications.- Fine Control of Demand in Haskell.- Reasoning about Timeouts.- Eternity Variables to Simulate Specifications.- Constructing Tournament Representations: An Exercise in Pointwise Relational Programming.- Type-Indexed Data Types.- Verification of Java's AbstractCollection Class: A Case Study.- Solving Regular Path Queries.- Inverting Functions as Folds.- From Kleene Algebra to Refinement Algebra.
Inhaltsverzeichnis
Invited Talks. - Implementing Algebraic Dynamic Programming in the Functional and the Imperative Programming Paradigm. - Some Results in Dynamic Model Theory. - Mathematics in Computer Science Curricula. - Contributed Papers. - Logical Relations and Galois Connections. - Transformational Derivation of Greedy Network Algorithms from Descriptive Specifications. - Fine Control of Demand in Haskell. - Reasoning about Timeouts. - Eternity Variables to Simulate Specifications. - Constructing Tournament Representations: An Exercise in Pointwise Relational Programming. - Type-Indexed Data Types. - Verification of Java s AbstractCollection Class: A Case Study. - Solving Regular Path Queries. - Inverting Functions as Folds. - From Kleene Algebra to Refinement Algebra.