Samson Abramsky

This book constitutes the refereed proceedings of the 5th International Conference on Typed Lambda Calculi and Applications, TLCA 2001, held in Krakow, Poland in May 2001. The 28 revised full papers presented were carefully reviewed and selected from 55 submissions. The volume reports research results on all current aspects of typed lambda calculi. Among the topics addressed are type systems, subtypes, coalgebraic methods, pi-calculus, recursive games, various types of lambda calculi, reductions, substitutions, normalization, linear logic, cut-elimination, prelogical relations, and mu calculus.

5th International Conference, TLCA 2001 Krakow, Poland, May 2-5, 2001 Proceedings

Typed Lambda Calculi and Applications

Andrew Pitts

Pierre-Louis Curien

David H. Pitt

Axel Poigne

David E. Rydeheard

The papers in this volume were presented at the fourth biennial Summer Conference on Category Theory and Computer Science, held in Paris, September3-6, 1991. Category theory continues to be an important tool in foundationalstudies in computer science. It has been widely applied by logicians to get concise interpretations of many logical concepts. Links between logic and computer science have been developed now for over twenty years, notably via the Curry-Howard isomorphism which identifies programs with proofs and types with propositions. The triangle category theory - logic - programming presents a rich world of interconnections. Topics covered in this volume include the following. Type theory: stratification of types and propositions can be discussed in a categorical setting. Domain theory: synthetic domain theory develops domain theory internally in the constructive universe of the effective topos. Linear logic: the reconstruction of logic based on propositions as resources leads to alternatives to traditional syntaxes. The proceedings of the previous three category theory conferences appear as Lecture Notes in Computer Science Volumes 240, 283 and 389.

Paris, France, September 3-6, 1991. Proceedings

Category Theory and Computer Science

Thomas S. E. Maibaum

"TAPSOFT '91 is the Fourth International Joint Conference on Theory and Practice of Software Development. It was held in Brighton, April 8-12, 1991, and was organized by the Department of Computing, Imperial College, London. The proceedings of TAPSOFT '91 are organized into three parts: - Advances in Distributed Computing (ADC) - Colloquium on Trees in Algebra and Programming (CAAP) - Colloquium on Combining Paradigms for Software Development (CCPSD) The proceedings are published in two volumes. The first volume (LNCS, Vol. 493) contains the papers from CAAP. The second volume (LNCS, Vol. 494) contains the papers from the ADC and CCPSD. The ADC talks by distinguished invited speakers surveys current developments in distributed computing, including the integration of different paradigms for concurrency, algebraic, logical and operational foundations, and applications to software engineering and formal methods. The CCPSD papers address aspects of the trend in software enginering towards unification and synthesis combining theory and practice, and merging hitherto diverse approaches."--PUBLISHER'S WEBSITE.

Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Development (CCPSD).

TAPSOFT '91 - Volume 2

Cyril Gavoille

Claude Kirchner

Friedhelm Meyer auf der Heide

Paul Spirakis

The two-volume set LNCS 6198 and LNCS 6199 constitutes the refereed proceedings of the 37th International Colloquium on Automata, Languages and Programming, ICALP 2010, held in Bordeaux, France, in July 2010. The 106 revised full papers (60 papers for track A, 30 for track B, and 16 for track C) presented together with 6 invited talks were carefully reviewed and selected from a total of 389 submissions. The papers are grouped in three major tracks on algorithms, complexity and games; on logic, semantics, automata, and theory of programming; as well as on foundations of networked computation: models, algorithms and information management. LNCS 6198 contains 60 contributions of track A selected from 222 submissions as well as 2 invited talks.

37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings

Automata, Languages and Programming

Annotation The two-volume set LNCS 6198 and LNCS 6199 constitutes the refereed proceedings of the 37th International Colloquium on Automata, Languages and Programming, ICALP 2010, held in Bordeaux, France, in July 2010. The 106 revised full papers (60 papers for track A, 30 for track B, and 16 for track C) presented together with 6 invited talks were carefully reviewed and selected from a total of 389 submissions. The papers are grouped in three major tracks on algorithms, complexity and games; on logic, semantics, automata, and theory of programming; as well as on foundations of networked computation: models, algorithms and information management. LNCS 6198 contains 60 contributions of track A selected from 222 submissions as well as 2 invited talks.

37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I

Jouko Väänänen

Heribert Vollmer

Juha Kontinen

In this volume, different aspects of logics for dependence and independence are discussed, including both the logical and computational aspects of dependence logic, and also applications in a number of areas, such as statistics, social choice theory, databases, and computer security. The contributing authors represent leading experts in this relatively new field, each of whom was invited to write a chapter based on talks given at seminars held at the Schloss Dagstuhl Leibniz Center for Informatics in Wadern, Germany (in February 2013 and June 2015) and an Academy Colloquium at the Royal Netherlands Academy of Arts and Sciences (March 2014). Altogether, these chapters provide the most up-to-date look at this developing and highly interdisciplinary field and will be of interest to a broad group of logicians, mathematicians, statisticians, philosophers, and scientists. Topics covered include a comprehensive survey of many propositional, modal, and first-order variants of dependence logic; new results concerning expressive power of several variants of dependence logic with different sets of logical connectives and generalized dependence atoms; connections between inclusion logic and the least-fixed point logic; an overview of dependencies in databases by addressing the relationships between implication problems for fragments of statistical conditional independencies, embedded multivalued dependencies, and propositional logic; various Markovian models used to characterize dependencies and causality among variables in multivariate systems; applications of dependence logic in social choice theory; and an introduction to the theory of secret sharing, pointing out connections to dependence and independence logic.

Theory and Applications

Dependence Logic

Samson Abramsky

About

Books

Join the club