You have Guest access.
Log In
Philippe Audebaud and Christine Paulin-Mohring
Front matter
1
Exploiting Unique Fixed Points
2-27
Scrap Your Type Applications
28
Programming with Effects in Coq
29-56
Verifying a Semantic βη -Conversion Test for Martin-Löf Type Theory
57-78
The Capacity- C Torch Problem
79-91
Recounting the Rationals: Twice!
92-109
Zippy Tabulations of Recursive Functions
110-133
Unfolding Abstract Datatypes
134-152
Circulations, Fuzzy Relations and Semirings
153-176
Asynchronous Exceptions as an Effect
177-192
The Böhm–Jacopini Theorem Is False, Propositionally
193-219
The Expression Lemma
220-242
Nested Datatypes with Generalized Mendler Iteration: Map Fusion and the Example of the Representation of Untyped Lambda Calculus with Explicit Flattening
243-267
Probabilistic Choice in Refinement Algebra
268-283
Algebra of Programming Using Dependent Types
284-304
Safe Modification of Pointer Programs in Refinement Calculus
305-335
A Hoare Logic for Call-by-Value Functional Programs
336-359
Synthesis of Optimal Control Policies for Some Infinite-State Transition Systems
360-387
Modal Semirings Revisited
388-403
Asymptotic Improvement of Computations over Free Monads
404-421
Symmetric and Synchronous Communication in Peer-to-Peer Networks
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info