๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Semantics and logics of computation: [... summer school on Semantics and Logics of Computation at the Isaac Newton Institute for Mathematical Sciences, Cambridge UK, in September 1995]

โœ Scribed by Pitts Andrew M., Dybjer P. (eds.)


Publisher
Cambridge University Press
Year
1997
Tongue
English
Leaves
373
Series
Isaac Newton Institute for Mathematical Sciences <Cambridge>. Publications of the Newton Institute ; 14
Edition
1. publ
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Table of Contents


Content: List of contributors
Preface
1. Semantics of interaction: an introduction to game semantics Samson Abramsky
2. Computational content of classical logic Thierry Coquand
3. Syntax and semantics of dependent types Martin Hofmann
4. Game semantics Martin Hyland
5. Metalanguages and applications Eugenio Moggi
6. Operationally-based theories of program equivalence Andrew Pitts
7. Categories in concurrency Glynn Winskel and Mogens Nielsen
Index.

โœฆ Subjects


Formale Semantik.;Kategorielle Logik.


๐Ÿ“œ SIMILAR VOLUMES


Semantics and logics of computation
โœ Andrew M. Pitts, P. Dybjer ๐Ÿ“‚ Library ๐Ÿ“… 2009 ๐Ÿ› Cambridge University Press ๐ŸŒ English

This accessible and comprehensive volume addresses modern developments in semantics and logic of computation and will be an important source for graduate students and researchers working in this area.

Truth, Deduction, and Computation: Logic
โœ Davis R.E. ๐Ÿ“‚ Library ๐Ÿ“… 1989 ๐Ÿ› Computer Science Press ๐ŸŒ English

Truth, Deduction, and Computation Logic and Semantics for Computer Science. Ruth E. Davis. Copyright 1989, Computer Science Press, NY. ISBN/ASIN/LOC 0716782014. Hardcover in very good condition. Binding is secure, cover and spine are clean with minimal wear. NO writing or highlighting was observerd

Computability Theory, Semantics, and Log
โœ Melvin Fitting ๐Ÿ“‚ Library ๐Ÿ“… 1987 ๐Ÿ› Oxford University Press ๐ŸŒ English

This book describes computability theory and provides an extensive treatment of data structures and program correctness. It makes accessible some of the author's work on generalized recursion theory, particularly the material on the logic programming language PROLOG, which is currently of great int