1 option
Mathematics of Program Construction : 7th International Conference, MPC 2004, Stirling, Scotland, UK, July 12-14, 2004, Proceedings / edited by Dexter Kozen, Carron Shankland.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 3125.
- Lecture Notes in Computer Science, 0302-9743 ; 3125
- Language:
- English
- Subjects (All):
- Software engineering.
- Computer logic.
- Logic, Symbolic and mathematical.
- Computers.
- Programming languages (Electronic computers).
- Software Engineering/Programming and Operating Systems.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Software Engineering.
- Computation by Abstract Devices.
- Programming Languages, Compilers, Interpreters.
- Local Subjects:
- Software Engineering/Programming and Operating Systems.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Software Engineering.
- Computation by Abstract Devices.
- Programming Languages, Compilers, Interpreters.
- Physical Description:
- 1 online resource (X, 404 pages).
- Edition:
- First edition 2004.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
- System Details:
- text file PDF
- Contents:
- Invited Talk
- Extended Static Checking for Java
- Contributed Papers
- Constructing Polymorphic Programs with Quotient Types
- Optimizing Generic Functions
- Inferring Type Isomorphisms Generically
- Friends Need a Bit More: Maintaining Invariants Over Shared State
- Chasing Bottoms
- Describing Gen/Kill Static Analysis Techniques with Kleene Algebra
- A Free Construction of Kleene Algebras with Tests
- Streaming Representation-Changers
- Probabilistic Predicative Programming
- An Algebra of Scans
- Compiling Exceptions Correctly
- Modelling Nondeterminism
- Lazy Kleene Algebra
- Augmenting Types with Unbounded Demonic and Angelic Nondeterminacy
- An Injective Language for Reversible Computation
- Prototyping Generic Programming in Template Haskell
- Transposing Relations: From Maybe Functions to Hash Tables
- Pointer Theory and Weakest Preconditions without Addresses and Heap
- Travelling Processes.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-27764-4
- 9783540277644
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.