David E. Rydeheard – författare
Visar alla böcker från författaren David E. Rydeheard. Handla med fri frakt och snabb leverans.
4 produkter
4 produkter
Häftad, Engelska, 1987
546 kr
Skickas inom 10-15 vardagar
Häftad, Engelska, 1989
529 kr
Skickas inom 10-15 vardagar
Häftad, Engelska, 1991
546 kr
Skickas inom 10-15 vardagar
The papers in this volume were presented at the fourthbiennial Summer Conference on Category Theory and ComputerScience, held in Paris, September3-6, 1991. Category theorycontinues to be an important tool in foundationalstudies incomputer science. It has been widely applied by logicians toget concise interpretations of many logical concepts. Linksbetween logic and computer science have been developed nowfor over twenty years, notably via the Curry-Howardisomorphism which identifies programs with proofs and typeswith propositions. The triangle category theory - logic -programming presents a rich world of interconnections.Topics covered in this volume include the following. Typetheory: stratification of types and propositions can bediscussed in a categorical setting. Domain theory: syntheticdomain theory develops domain theory internally in theconstructive universe of the effective topos. Linear logic:the reconstruction of logic based on propositions asresources leads to alternatives to traditional syntaxes. Theproceedings of the previous three category theoryconferences appear as Lecture Notes in Computer ScienceVolumes 240, 283 and 389.
Häftad, Engelska, 1995
562 kr
Skickas inom 10-15 vardagar
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.