LEADER 05575nam 22008055 450 001 996465660003316 005 20240327181034.0 010 $a3-540-38413-8 024 7 $a10.1007/BFb0013452 035 $a(CKB)1000000000233706 035 $a(SSID)ssj0000321776 035 $a(PQKBManifestationID)11233994 035 $a(PQKBTitleCode)TC0000321776 035 $a(PQKBWorkID)10281031 035 $a(PQKB)10019071 035 $a(DE-He213)978-3-540-38413-7 035 $a(PPN)155188216 035 $a(EXLCZ)991000000000233706 100 $a20121227d1991 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCategory Theory and Computer Science$b[electronic resource] $eParis, France, September 3-6, 1991. Proceedings /$fedited by David H. Pitt, Pierre-Louis Curien, Samson Abramsky, Andrew Pitts, Axel Poigne, David E. Rydeheard 205 $a1st ed. 1991. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1991. 215 $a1 online resource (VIII, 304 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v530 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-54495-X 327 $aStone duality for stable functions -- Bifinite domains: Stable case -- Local variables and non-interference in algol-like languages -- Categories of information systems -- Collapsing graph models by preorders -- Linear logic and interference control -- Higher dimensional word problem -- BCK-formulas having unique proofs -- Proof nets and coherence theorems -- A modular approach to denotational semantics -- Programs in partial algebras ? A categorical approach -- Tail recursion from universal invariants -- A direct proof of the intuitionistic Ramsey Theorem -- Constructions and predicates -- Relating models of impredicative type theories -- Two results on set-theoretic polymorphism -- An algebra of graphs and graph rewriting -- Dataflow networks are fibrations -- Applications of the calculus of trees to process description languages. 330 $aThe papers in this volume were presented at the fourth biennial Summer Conference on Category Theory and Computer Science, held in Paris, September3-6, 1991. Category theory continues to be an important tool in foundationalstudies in computer science. It has been widely applied by logicians to get concise interpretations of many logical concepts. Links between logic and computer science have been developed now for over twenty years, notably via the Curry-Howard isomorphism which identifies programs with proofs and types with propositions. The triangle category theory - logic - programming presents a rich world of interconnections. Topics covered in this volume include the following. Type theory: stratification of types and propositions can be discussed in a categorical setting. Domain theory: synthetic domain theory develops domain theory internally in the constructive universe of the effective topos. Linear logic: the reconstruction of logic based on propositions as resources leads to alternatives to traditional syntaxes. The proceedings of the previous three category theory conferences appear as Lecture Notes in Computer Science Volumes 240, 283 and 389. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v530 606 $aMathematics 606 $aComputers 606 $aComputer logic 606 $aMathematical logic 606 $aProgramming languages (Electronic computers) 606 $aSoftware engineering 606 $aMathematics, general$3https://scigraph.springernature.com/ontologies/product-market-codes/M00009 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 615 0$aMathematics. 615 0$aComputers. 615 0$aComputer logic. 615 0$aMathematical logic. 615 0$aProgramming languages (Electronic computers). 615 0$aSoftware engineering. 615 14$aMathematics, general. 615 24$aTheory of Computation. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aSoftware Engineering. 676 $a005.1 702 $aPitt$b David$g(David H.),$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aCurien$b Pierre-Louis$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aAbramsky$b Samson$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPitts$b Andrew$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPoigne$b Axel$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRydeheard$b David E$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aSummer Conference on Category Theory and Computer Science$d(4th :$f1991 :$eParis, France) 906 $aBOOK 912 $a996465660003316 996 $aCategory theory and computer science$9382680 997 $aUNISA