Author: M. P. Fourman
Publisher: Cambridge University Press
Release Date: 1992-06-26
Category theory and related topics of mathematics have been increasingly applied to computer science in recent years. This book contains selected papers from the London Mathematical Society Symposium on the subject which was held at the University of Durham. Participants at the conference were leading computer scientists and mathematicians working in the area and this volume reflects the excitement and importance of the meeting. All the papers have been refereed and represent some of the most important and current ideas. Hence this book will be essential to mathematicians and computer scientists working in the applications of category theory.
This book constitutes the refereed proceedings of the Third International Symposium on Theoretical Aspects of Computer Software, TACS'97, held in Sendai, Japan, in September 1997. The book presents 20 revised full papers selected from a total of 46 submissions. Also included are seven invited papers by internationally leading scientists. Among the topics addressed are action calculi, polymorphisms, type theory, lambda calculi, refinement, finite transition systems, model checking, process algebras, logical frameworks, higher-order logics, etc.
Author: Ian David Bede Stark
Release Date: 1995
Genre: Functional programming (Computer science)
Abstract: "Many functional programming languages rely on the elimination of 'impure' features: assignment to variables, exceptions and even input/output. But some of these are genuinely useful, and it is of real interest to establish how they can be reintroducted [sic] in a controlled way. This dissertation looks in detail at one example of this: the addition to a functional language of dynamically generated names. Names are created fresh, they can be compared with each other and passed around, but that is all. As a very basic example of state, they capture the graduation between private and public, local and global, by their interaction with higher-order functions. The vehicle for this study is the nu-calculus, an extension of the simply-typed lambda calculus. The nu calculus is equivalent to a certain fragment of Standard ML, omitting side- effects, exceptions, datatypes and recursion. Even without all these features, the interaction of name creation with higher-order functions can be complex and subtle. Various operational and denotational methods for reasoning about the nu-calculus are developed. These include a computational metalanguage in the style of Moggi, which distinguishes in the type system between values and computations. This leads to categorical models that use a strong monad, and examples are devised based on functor categories. The idea of logical relations is used to derive powerful reasoning methods that capture some of the distinction between private and public names. These techniques are shown to be complete for establishing contextual equivalence between first-order expressions; they are also used to construct a correspondingly abstract categorical model All the work with the nu-calculus extends cleanly to Reduced ML, a larger language that introduces integer references: mutable storage cells that are dynamically allocated. It turns out that the step up is quite simple, and both the computational metalanguage and the simple categorical models can be reused."
Author: Graham Everest
Publisher: American Mathematical Soc.
Release Date: 2015-09-03
Recurrence sequences are of great intrinsic interest and have been a central part of number theory for many years. Moreover, these sequences appear almost everywhere in mathematics and computer science. This book surveys the modern theory of linear recurrence sequences and their generalizations. Particular emphasis is placed on the dramatic impact that sophisticated methods from Diophantine analysis and transcendence theory have had on the subject. Related work on bilinear recurrences and an emerging connection between recurrences and graph theory are covered. Applications and links to other areas of mathematics are described, including combinatorics, dynamical systems and cryptography, and computer science. The book is suitable for researchers interested in number theory, combinatorics, and graph theory.
Author: Sylvain E. Cappell
Publisher: Princeton University Press
Release Date: 2000
Surgery theory, the basis for the classification theory of manifolds, is now about forty years old. There have been some extraordinary accomplishments in that time, which have led to enormously varied interactions with algebra, analysis, and geometry. Workers in many of these areas have often lamented the lack of a single source that surveys surgery theory and its applications. Indeed, no one person could write such a survey. The sixtieth birthday of C. T. C. Wall, one of the leaders of the founding generation of surgery theory, provided an opportunity to rectify the situation and produce a comprehensive book on the subject. Experts have written state-of-the-art reports that will be of broad interest to all those interested in topology, not only graduate students and mathematicians, but mathematical physicists as well. Contributors include J. Milnor, S. Novikov, W. Browder, T. Lance, E. Brown, M. Kreck, J. Klein, M. Davis, J. Davis, I. Hambleton, L. Taylor, C. Stark, E. Pedersen, W. Mio, J. Levine, K. Orr, J. Roe, J. Milgram, and C. Thomas.