Mathematics of Program Construction 6th International Conference, MPC 2002, Dagstuhl Castle, Germany, July 8-10, 2002. Proceedings /
Mathematics of Program Construction 6th International Conference, MPC 2002, Dagstuhl Castle, Germany, July 8-10, 2002. Proceedings / [electronic resource] :
edited by Eerke A. Boiten, Bernhard Möller.
- 1st ed. 2002.
- X, 266 p. online resource.
- Lecture Notes in Computer Science, 2386 1611-3349 ; .
- Lecture Notes in Computer Science, 2386 .
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.
9783540454427
10.1007/3-540-45442-X doi
Computer science.
Machine theory.
Software engineering.
Compilers (Computer programs).
Computer Science Logic and Foundations of Programming.
Formal Languages and Automata Theory.
Software Engineering.
Theory of Computation.
Compilers and Interpreters.
QA75.5-76.95
004.0151
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.
9783540454427
10.1007/3-540-45442-X doi
Computer science.
Machine theory.
Software engineering.
Compilers (Computer programs).
Computer Science Logic and Foundations of Programming.
Formal Languages and Automata Theory.
Software Engineering.
Theory of Computation.
Compilers and Interpreters.
QA75.5-76.95
004.0151