Gratis Versand in ganz Österreich
Bookbot

Jeremy Gibbons

    Teaching formal methods
    Mathematics of program construction
    Generic and indexed programming
    Foundations of health information engineering and systems
    Algorithm design with Haskell
    • Algorithm design with Haskell

      • 450 Seiten
      • 16 Lesestunden
      4,4(3)Abgeben

      This book is devoted to five main principles of algorithm divide and conquer, greedy algorithms, thinning, dynamic programming, and exhaustive search. These principles are presented using Haskell, a purely functional language, leading to simpler explanations and shorter programs than would be obtained with imperative languages. Carefully selected examples, both new and standard, reveal the commonalities and highlight the differences between algorithms. The algorithm developments use equational reasoning where applicable, clarifying the applicability conditions and correctness arguments. Every chapter concludes with exercises (nearly 300 in total), each with complete answers, allowing the reader to consolidate their understanding and apply the techniques to a range of problems. The book serves students (both undergraduate and postgraduate), researchers, teachers, and professionals who want to know more about what goes into a good algorithm and how such algorithms can be expressed in purely functional terms.

      Algorithm design with Haskell
    • This book constitutes the thoroughly refereed post-conference proceedings of the Third International Symposium on Foundations of Health Information Engineering and Systems, FHIES 2013, held in Macau, China, in August 2013. The 19 revised full papers presented together with 1 invited talk in this volume were carefully reviewed and selected from 22 submissions. The papers are organized in following subjects: panel position statements, pathways, generation and certification, interoperability, patient safety, device safety, formal methods and HIV/AIDS and privacy.

      Foundations of health information engineering and systems
    • Generic and indexed programming

      • 266 Seiten
      • 10 Lesestunden

      Generic programming is about making programs more widely applicable via exotic kinds of parametrization---not just along the dimensions of values or of types, but also of things such as the shape of data, algebraic structures, strategies, computational paradigms, and so on. Indexed programming is a lightweight form of dependently typed programming, constraining flexibility by allowing one to state and check relationships between parameters: that the shapes of two arguments agree, that an encoded value matches some type, that values transmitted along a channel conform to the stated protocol, and so on. The two forces of genericity and indexing balance each other nicely, simultaneously promoting and controlling generality. The 5 lectures included in this book stem from the Spring School on Generic and Indexed Programming, held in Oxford, UK, in March 2010 as a closing activity of the generic and indexed programming project at Oxford which took place in the years 2006-2010.

      Generic and indexed programming
    • This book constitutes the refereed proceedings of the 11th International Conference on Mathematics of Program Construction, MPC 2012, held in Madrid, Spain, in June 2012. The 13 revised full papers presented together with three invited talks were carefully reviewed and selected from 27 submissions. The papers are organized in topical sections on security and information flow, synchronous and real-time systems, algorithms and games, program calculi, tool support, algebras and datatypes, and categorical functional programming.

      Mathematics of program construction
    • Teaching formal methods

      • 175 Seiten
      • 7 Lesestunden

      This volume presents the proceedings of TFM2009, the Second International FME Conference on Teaching Formal Methods, organized by the Subgroup of Education of the Formal Methods Europe (FME) association. Held in Eindhoven, The Netherlands, in November 2009 as part of the inaugural Formal Methods Week (FMWeek), TFM2009 served as a one-day forum to discuss the successes and challenges of formal method (FM) education while promoting collaborative projects to enhance training in this field. The event brought together lecturers, educators, and industry partners to share experiences, pedagogical methodologies, and best practices. Interest in FM teaching has been on the rise, following a series of related events, including two BCS-FACS TFM workshops in 2003 and 2006, the TFM2004 conference in Ghent, and several other workshops and conferences focused on FM education. Formal methods play a critical role in the development of complex computing systems, as recognized by industrial standards like IEC61508 and ISO/IEC15408. The increasing adoption of precise modeling notations and model-driven techniques highlights the growing demand for software engineers skilled in mathematical abstractions, inference, and proof.

      Teaching formal methods