This book presents the proceedings of the Sixth International Conference on Category Theory and Computer Science, CTCS '95, held in Cambridge, UK in August 1995. The 15 revised full papers included in the volume document the exploitation of links between logic and category theory leading to a solid basis for much of the understanding of the semantics of computation. Notable amongst other advances is the introduction of linear logic and other substructural logics, providing a new approach to proof theory. Further aspects covered are semantics of lambda calculi and type theories, program specification and development, and domain theory.
Category Theory and Computer Science
and over one million other books are available for Amazon Kindle.
Learn more
FREE Two-Day Shipping for students on millions of items. Learn more |
| |||||||||||||||
Book Description
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
bisimulation morphisms, replete objects, realized posets, plumb classes, proper factorization system, sober simulation, irredundant automata, replete construction, lax colimit, relational set theory, mutual recursion theorem, reachable automata, balanced sequent, polynomial categories, reduced transition systems, exponential ideal, categorical programming language, schizophrenic object, dual adjunction, convex powerdomain, partial map classifier, safe recursion, admissible monos, synthetic domain theory, rolling rule Key Phrases - Capitalized Phrases (CAPs): (learn more)
University of Edinburgh, Effective Applicative Structure, Cambridge University Press, Basic Recursive Function Theory, Eindhoven University of Technology, North Holland, Suppose Res New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
bisimulation morphisms, replete objects, realized posets, plumb classes, proper factorization system, sober simulation, irredundant automata, replete construction, lax colimit, relational set theory, mutual recursion theorem, reachable automata, balanced sequent, polynomial categories, reduced transition systems, exponential ideal, categorical programming language, schizophrenic object, dual adjunction, convex powerdomain, partial map classifier, safe recursion, admissible monos, synthetic domain theory, rolling rule Key Phrases - Capitalized Phrases (CAPs): (learn more)
University of Edinburgh, Effective Applicative Structure, Cambridge University Press, Basic Recursive Function Theory, Eindhoven University of Technology, North Holland, Suppose Res New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
So You'd Like to...
Look for Similar Items by Category
- Books > Computers & Technology > Computer Science > Software Engineering
- Books > Computers & Technology > Hardware > Microprocessors & System Design
- Books > Computers & Technology > Programming > Languages & Tools
- Books > Computers & Technology > Programming > Software Design, Testing & Engineering > Software Development
- Books > New & Used Textbooks > Computer Science > Programming Languages
- Books > New & Used Textbooks > Computer Science > Software Design & Engineering
- Books > New & Used Textbooks > Science & Mathematics > Mathematics > Algebra & Trigonometry
- Books > Science & Math > Mathematics
