Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Mathematics of program construction : 9th international conference, MPC 2008, Marseille, France, July 15-18, 2008 : proceedings / / Philippe Audebaud, Christine Paulin-Mohring (eds.)
| Mathematics of program construction : 9th international conference, MPC 2008, Marseille, France, July 15-18, 2008 : proceedings / / Philippe Audebaud, Christine Paulin-Mohring (eds.) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2008 |
| Descrizione fisica | 1 online resource (X, 423 p.) |
| Disciplina | 005.11 |
| Altri autori (Persone) |
AudebaudPhilippe
Paulin-MohringChristine <1962-> |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Computer programming
Computer science - Mathematics |
| ISBN | 3-540-70594-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Exploiting 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. |
| Altri titoli varianti | MPC 2008 |
| Record Nr. | UNINA-9910767552803321 |
| Berlin, : Springer, 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Types for proofs and programs : international workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004 : revised selected papers / / Jean-Christophe Filliatre, Christine Paulin-Mohring, Benjamin Werner (eds.)
| Types for proofs and programs : international workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004 : revised selected papers / / Jean-Christophe Filliatre, Christine Paulin-Mohring, Benjamin Werner (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, 2006 |
| Descrizione fisica | 1 online resource (VIII, 280 p.) |
| Disciplina | 005.131 |
| Altri autori (Persone) |
FilliatreJean-Christophe
Paulin-MohringChristine <1962-> WernerBenjamin |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Automatic theorem proving
Computer programming |
| ISBN | 3-540-31429-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Formalized Metatheory with Terms Represented by an Indexed Family of Types -- A Content Based Mathematical Search Engine: Whelp -- A Machine-Checked Formalization of the Random Oracle Model -- Extracting a Normalization Algorithm in Isabelle/HOL -- A Structured Approach to Proving Compiler Optimizations Based on Dataflow Analysis -- Formalising Bitonic Sort in Type Theory -- A Semi-reflexive Tactic for (Sub-)Equational Reasoning -- A Uniform and Certified Approach for Two Static Analyses -- Solving Two Problems in General Topology Via Types -- A Tool for Automated Theorem Proving in Agda -- Surreal Numbers in Coq -- A Few Constructions on Constructors -- Tactic-Based Optimized Compilation of Functional Programs -- Interfaces as Games, Programs as Strategies -- ?Z: Zermelo’s Set Theory as a PTS with 4 Sorts -- Exploring the Regular Tree Types -- On Constructive Existence. |
| Altri titoli varianti | TYPES 2004 |
| Record Nr. | UNINA-9910483584903321 |
| Berlin ; ; New York, : Springer, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||