Martin Hofmann

The refereed proceedings of the 6th International Conference on Typed Lambda Calculi and Applications, TLCA 2003, held in Valencia, Spain in June 2003. The 21 revised full papers presented were carefully reviewed and selected from 40 submissions. The volume reports research results on all current aspects of typed lambda calculi, ranging from theoretical and methodological issues to the application of proof assistants.

6th International Conference, TLCA 2003, Valencia, Spain, June 10-12, 2003, Proceedings

Typed Lambda Calculi and Applications

Martin Lange

Das Buch beschäftigt sich mit der Theorie endlicher Automaten und den klassischen Resultaten wie den Sätzen von Richard Büchi und Michael Rabin. Die vier Teile des Buchs sind den unterschiedlichen Strukturen gewidmet: endliche Wörter, Bäume, endliche und unendliche Bäume. Jeder Teil endet mit Übungsaufgaben zum behandelten Stoff sowie Hinweisen auf weiterführende Literatur. Soweit Vorkenntnisse zur Theorie formaler Sprachen vorhanden sind, kann das Buch ohne weitere Hilfsmittel durchgearbeitet werden.

Automatentheorie und Logik

This book constitutes the refereed proceedings of the 14th International Conference on Foundations of Software Science and computational Structures, FOSSACS 2011, held in Saarbrücken, Germany, March 26—April 3, 2011, as part of ETAPS 2011, the European Joint Conferences on Theory and Practice of Software. The 30 revised full papers presented together with one full-paper length invited talk were carefully reviewed and selected from 100 submissions. The papers are organized in topical sections on coalgebra and computability, type theory, process calculi, automata theory, semantics, binding, security, and program analysis.

14th International Conference, FOSSACS 2011, Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26--April 3, 2011, Proceedings

Foundations of Software Science and Computational Structures

Axel Rauschmayer

Martin Wirsing

Global computing refers to computation over “global computers,” i.e., com- tational infrastructures available globally and able to provide uniform services with variable guarantees for communication, cooperation and mobility, resource usage, security policies and mechanisms, etc., with particular regard to explo- ing their universal scale and the programmability of their services. As the scope and computational power of such global infrastructures continue to grow, it - comes more and more important to develop methods, theories and techniques for trustworthy systems running on global computers. This book constitutes the thoroughly refereed proceedings of the ?fth e- tion of the International Symposium on Trustworthy Global Computing (TGC 2010)thatwasheldinMunich,Germany,February24-26,2010.TheSymposium on Trustworthy Global Computing is an international annual venue dedicated to safe and reliable computation in global computers. It focuses on providing frameworks, tools, and protocols for constructing well-behaved applications and on reasoning rigorouslyabout their behavior and properties. The related models of computation incorporate code and data mobility over distributed networks with highly dynamic topologies and heterogeneous devices.

5th International Symposium, TGC 2010, Munich, Germany, February 24-26, 2010, Revised Selected Papers

Trustworthy Global Computing

Extensional Constructs in Intensional Type Theory presents a novel approach to the treatment of equality in Martin-Loef type theory (a basis for important work in mechanised mathematics and program verification). Martin Hofmann attempts to reconcile the two different ways that type theories deal with identity types. The book will be of interest particularly to researchers with mainly theoretical interests and implementors of type theory based proof assistants, and also fourth year undergraduates who will find it useful as part of an advanced course on type theory.

Martin Hofmann

About

Books

Join the club