FEEDBACK Smiley face
Normal view MARC view ISBD view

Mathematics of Program Construction [electronic resource] :8th International Conference, MPC 2006, Kuressaare, Estonia, July 3-5, 2006. Proceedings /

Contributor(s): Uustalu, Tarmo [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 4014Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006.Description: X, 458 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540356325.Subject(s): Computer science | Software engineering | Programming languages (Electronic computers) | Computers | Computer logic | Mathematical logic | Computer Science | 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, InterpretersOnline resources: Click here to access online
Contents:
Invited Talks -- What Is a Good Process Semantics? -- Refunctionalization at Work -- Aspects and Data Refinement -- Contributed Papers -- Towards Generic Programming with Sized Types -- Relational Semantics for Higher-Order Programs -- Proofs of Randomized Algorithms in Coq -- Exercises in Quantifier Manipulation -- Improving Saddleback Search: A Lesson in Algorithm Design -- Loopless Functional Algorithms -- Compositional Reasoning for Pointer Structures -- Progress in Deriving Concurrent Programs: Emphasizing the Role of Stable Guards -- Fission for Program Comprehension -- “Scrap Your Boilerplate” Revolutions -- Generic Views on Data Types -- Recursion Schemes for Dynamic Programming -- Bimonadic Semantics for Basic Pattern Matching Calculi -- Nondeterministic Folds -- A Datastructure for Iterated Powers -- Continuous Action System Refinement -- The Linear Algebra of UTP -- The Shadow Knows: Refinement of Ignorance in Sequential Programs -- Swapping Arguments and Results of Recursive Functions -- Refinement Algebra with Operators for Enabledness and Termination -- Constructing Rewrite-Based Decision Procedures for Embeddings and Termination -- Quantum Predicative Programming.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

Invited Talks -- What Is a Good Process Semantics? -- Refunctionalization at Work -- Aspects and Data Refinement -- Contributed Papers -- Towards Generic Programming with Sized Types -- Relational Semantics for Higher-Order Programs -- Proofs of Randomized Algorithms in Coq -- Exercises in Quantifier Manipulation -- Improving Saddleback Search: A Lesson in Algorithm Design -- Loopless Functional Algorithms -- Compositional Reasoning for Pointer Structures -- Progress in Deriving Concurrent Programs: Emphasizing the Role of Stable Guards -- Fission for Program Comprehension -- “Scrap Your Boilerplate” Revolutions -- Generic Views on Data Types -- Recursion Schemes for Dynamic Programming -- Bimonadic Semantics for Basic Pattern Matching Calculi -- Nondeterministic Folds -- A Datastructure for Iterated Powers -- Continuous Action System Refinement -- The Linear Algebra of UTP -- The Shadow Knows: Refinement of Ignorance in Sequential Programs -- Swapping Arguments and Results of Recursive Functions -- Refinement Algebra with Operators for Enabledness and Termination -- Constructing Rewrite-Based Decision Procedures for Embeddings and Termination -- Quantum Predicative Programming.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in