Applications of Categories in Computer Science

Proceedings of the London Mathematical Society Symposium, Durham 1991
Author: London Mathematical Society. Symposium
Publisher: Cambridge University Press
ISBN: 9780521427265
Category: Mathematics
Page: 339
View: 8543
DOWNLOAD NOW »
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.

Automata, Languages and Programming

33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings
Author: Michele Bugliesi,Bart Preneel,Vladimiro Sassone,Ingo Wegener
Publisher: Springer Science & Business Media
ISBN: 3540359079
Category: Computers
Page: 612
View: 8155
DOWNLOAD NOW »
The two-volume set LNCS 4051 and LNCS 4052 constitutes the refereed proceedings of the 33rd International Colloquium on Automata, Languages and Programming, ICALP 2006, held in Venice, Italy, July 2006. In all, these volumes present more 100 papers and lectures. Volume II (4052) presents 2 invited papers and 2 additional conference tracks with 24 papers each, focusing on algorithms, automata, complexity and games as well as on security and cryptography foundation.

Internationale Mathematische Nachrichten


Author: N.A
Publisher: N.A
ISBN: N.A
Category: Mathematics
Page: N.A
View: 9477
DOWNLOAD NOW »


Theoretical Aspects of Computer Software

Third International Symposium, TACS'97, Sendai, Japan, September 23 - 26, 1997, Proceedings
Author: Martin Abadi,Takayasu Ito
Publisher: Springer
ISBN: N.A
Category: Computer software
Page: 639
View: 832
DOWNLOAD NOW »
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.

ICFP


Author: N.A
Publisher: N.A
ISBN: 9780897917704
Category: Functional programming languages
Page: 273
View: 6862
DOWNLOAD NOW »


Names and Higher-order Functions


Author: Ian David Bede Stark,University of Cambridge. Computer Laboratory
Publisher: N.A
ISBN: N.A
Category: Functional programming (Computer science)
Page: 140
View: 4835
DOWNLOAD NOW »
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."

Games and Full Abstraction for a Functional Metalanguage with Recursive Types


Author: Guy McCusker
Publisher: Springer Science & Business Media
ISBN: 1447106156
Category: Computers
Page: 189
View: 7143
DOWNLOAD NOW »
This book is a minor revision of the thesis submitted in August 1996; no major changes have been made. However, I would like to take this opportunity to mention that since the thesis was written, discoveries have been made which would allow a substantial simplification and strengthening of the results in Chapters 3 and 6. In particular, it is now possible to model sums correctly in the category I as well as in £, which means that the definability results of Chapter 6 can be stated and proved at the intensional level, making them simpler and much closer in spirit to the original proofs of Abramsky, Jagadeesan, Malacaria, Hyland, Ong and Nickau [10,61,79]. This also leads quite straightforwardly to an understanding of call-by-value languages. Details of these improvements can be found in [14,73]. It is also worth mentioning that progress has been made on some of the topics suggested for future research in Chapter 7. In particular, fully abstract models have been found for various kinds of languages with local variables [8,13-16], and a fully complete games model of the polymorphic language System F has been constructed by Hughes [59]. Guy McCusker February 1998 Acknowledgements First of all, I must thank my supervisor, Samson Abramsky. It was he who first introduced me to game semantics and suggested avenues of research in the area; this book would certainly not exist were it not for him.

Applications of categories in computer science

proceedings of the LMS Symposium, Durham 1991
Author: London Mathematical Society
Publisher: N.A
ISBN: 9780521427265
Category: Computers
Page: 339
View: 1502
DOWNLOAD NOW »


The Cumulative Book Index


Author: N.A
Publisher: N.A
ISBN: N.A
Category: American literature
Page: N.A
View: 9930
DOWNLOAD NOW »


国立国会図書館所蔵科学技術関係欧文会議錄目錄


Author: 国立国会図書館 (Japan)
Publisher: N.A
ISBN: N.A
Category: Science
Page: 1730
View: 2470
DOWNLOAD NOW »