Book Volume 3125 2004

Mathematics of Program Construction

7th International Conference, MPC 2004, Stirling, Scotland, UK, July 12-14, 2004. Proceedings

Editors:

ISBN: 978-3-540-22380-1 (Print) 978-3-540-27764-4 (Online)

Table of contents (20 chapters)

  1. Front Matter

    Pages -

  2. Invited Talk

    1. No Access

      Chapter

      Pages 1-1

      Extended Static Checking for Java

  3. Contributed Papers

    1. No Access

      Chapter

      Pages 2-15

      Constructing Polymorphic Programs with Quotient Types

    2. No Access

      Chapter

      Pages 16-31

      Optimizing Generic Functions

    3. No Access

      Chapter

      Pages 32-53

      Inferring Type Isomorphisms Generically

    4. No Access

      Chapter

      Pages 54-84

      Friends Need a Bit More: Maintaining Invariants Over Shared State

    5. No Access

      Chapter

      Pages 85-109

      Chasing Bottoms

    6. No Access

      Chapter

      Pages 110-128

      Describing Gen/Kill Static Analysis Techniques with Kleene Algebra

    7. No Access

      Chapter

      Pages 129-141

      A Free Construction of Kleene Algebras with Tests

    8. No Access

      Chapter

      Pages 142-168

      Streaming Representation-Changers

    9. No Access

      Chapter

      Pages 169-185

      Probabilistic Predicative Programming

    10. No Access

      Chapter

      Pages 186-210

      An Algebra of Scans

    11. No Access

      Chapter

      Pages 211-227

      Compiling Exceptions Correctly

    12. No Access

      Chapter

      Pages 228-251

      Modelling Nondeterminism

    13. No Access

      Chapter

      Pages 252-273

      Lazy Kleene Algebra

    14. No Access

      Chapter

      Pages 274-288

      Augmenting Types with Unbounded Demonic and Angelic Nondeterminacy

    15. No Access

      Chapter

      Pages 289-313

      An Injective Language for Reversible Computation

    16. No Access

      Chapter

      Pages 314-333

      Prototyping Generic Programming in Template Haskell

    17. No Access

      Chapter

      Pages 334-356

      Transposing Relations: From Maybe Functions to Hash Tables

    18. No Access

      Chapter

      Pages 357-380

      Pointer Theory and Weakest Preconditions without Addresses and Heap

    19. No Access

      Chapter

      Pages 381-399

      Travelling Processes

  4. Back Matter

    Pages -