000 04022nam a22006015i 4500
001 978-3-540-70594-9
003 DE-He213
005 20240730193931.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540705949
_9978-3-540-70594-9
024 7 _a10.1007/978-3-540-70594-9
_2doi
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
082 0 4 _a005.11
_223
245 1 0 _aMathematics of Program Construction
_h[electronic resource] :
_b9th International Conference, MPC 2008 Marseille, France, July 15-18, 2008 Proceedings /
_cedited by Philippe Audebaud, Christine Paulin-Mohring.
250 _a1st ed. 2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2008.
300 _aX, 423 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5133
505 0 _aExploiting Unique Fixed Points -- Scrap Your Type Applications -- Programming with Effects in Coq -- Verifying a Semantic ??-Conversion Test for Martin-Löf Type Theory -- The Capacity-C Torch Problem -- Recounting the Rationals: Twice! -- Zippy Tabulations of Recursive Functions -- Unfolding Abstract Datatypes -- Circulations, Fuzzy Relations and Semirings -- Asynchronous Exceptions as an Effect -- The Böhm-Jacopini Theorem Is False, Propositionally -- The Expression Lemma -- Nested Datatypes with Generalized Mendler Iteration: Map Fusion and the Example of the Representation of Untyped Lambda Calculus with Explicit Flattening -- Probabilistic Choice in Refinement Algebra -- Algebra of Programming Using Dependent Types -- Safe Modification of Pointer Programs in Refinement Calculus -- A Hoare Logic for Call-by-Value Functional Programs -- Synthesis of Optimal Control Policies for Some Infinite-State Transition Systems -- Modal Semirings Revisited -- Asymptotic Improvement of Computations over Free Monads -- Symmetric and Synchronous Communication in Peer-to-Peer Networks.
520 _aThis book constitutes the refereed proceedings of the 9th International Conference on Mathematics of Program Construction, MPC 2008, held in Marseille, France in July 2008. The 18 revised full papers presented together with 1 invited talk were carefully reviewed and selected from 41 submissions. Issues addressed range from algorithmics to support for program construction in programming languages and systems. Topics of special interest are type systems, program analysis and transformation, programming language semantics, program logics.
650 0 _aComputer programming.
_94169
650 0 _aSoftware engineering.
_94138
650 0 _aCompilers (Computer programs).
_93350
650 0 _aComputer science.
_99832
650 0 _aMachine theory.
_9155046
650 1 4 _aProgramming Techniques.
_9155047
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aCompilers and Interpreters.
_931853
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aFormal Languages and Automata Theory.
_9155048
700 1 _aAudebaud, Philippe.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9155049
700 1 _aPaulin-Mohring, Christine.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9155050
710 2 _aSpringerLink (Online service)
_9155051
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540705932
776 0 8 _iPrinted edition:
_z9783540866695
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5133
_9155052
856 4 0 _uhttps://doi.org/10.1007/978-3-540-70594-9
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94936
_d94936