My Account Log in

1 option

Mathematics of Program Construction : 6th International Conference, MPC 2002, Dagstuhl Castle, Germany, July 8-10, 2002. Proceedings / edited by Eerke A. Boiten, Bernhard Möller.

LIBRA Q341 .P7 2004
Loading location information...

Available from offsite location This item is stored in our repository but can be checked out.

Log in to request item
Format:
Book
Contributor:
Boiten, Eerke A., editor.
Möller, Bernhard, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 2386.
Lecture Notes in Computer Science, 0302-9743 ; 2386
Language:
English
Subjects (All):
Computer logic.
Logic, Symbolic and mathematical.
Software engineering.
Computers.
Programming languages (Electronic computers).
Logics and Meanings of Programs.
Mathematical Logic and Formal Languages.
Software Engineering.
Computation by Abstract Devices.
Programming Languages, Compilers, Interpreters.
Local Subjects:
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, 266 pages).
Edition:
First edition 2002.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
System Details:
text file PDF
Contents:
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.
Other Format:
Printed edition:
ISBN:
978-3-540-45442-7
9783540454427
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.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account