LEADER 05700nam 22007215 450 001 9910144152703321 005 20200702143522.0 010 $a3-540-24849-8 010 $a3-540-22164-6 024 7 $a10.1007/b98246 035 $a(CKB)1000000000212433 035 $a(SSID)ssj0000327461 035 $a(PQKBManifestationID)11232959 035 $a(PQKBTitleCode)TC0000327461 035 $a(PQKBWorkID)10302054 035 $a(PQKB)11525944 035 $a(DE-He213)978-3-540-24849-1 035 $a(MiAaPQ)EBC3087980 035 $a(PPN)155204149 035 $a(EXLCZ)991000000000212433 100 $a20121227d2004 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTypes for Proofs and Programs $eInternational Workshop, TYPES 2003, Torino, Italy, April 30 - May 4, 2003, Revised Selected Papers /$fedited by Stefano Berardi, Mario Coppo, Ferruccio Damiani 205 $a1st ed. 2004. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2004. 215 $a1 online resource (X, 412 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v3085 300 $aBibliographic Level Mode of Issuance: Monograph 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aA Modular Hierarchy of Logical Frameworks -- Tailoring Filter Models -- Locales and Locale Expressions in Isabelle/Isar -- to PAF!, a Proof Assistant for ML Programs Verification -- A Constructive Proof of Higman?s Lemma in Isabelle -- A Core Calculus of Higher-Order Mixins and Classes -- Type Inference for Nested Self Types -- Inductive Families Need Not Store Their Indices -- Modules in Coq Are and Will Be Correct -- Rewriting Calculus with Fixpoints: Untyped and First-Order Systems -- First-Order Reasoning in the Calculus of Inductive Constructions -- Higher-Order Linear Ramified Recurrence -- Confluence and Strong Normalisation of the Generalised Multiary ?-Calculus -- Wellfounded Trees and Dependent Polynomial Functors -- Classical Proofs, Typed Processes, and Intersection Types -- ?Wave-Style? Geometry of Interaction Models in Rel Are Graph-Like Lambda-Models -- Coercions in Hindley-Milner Systems -- Combining Incoherent Coercions for ? -Types -- Induction and Co-induction in Sequent Calculus -- QArith: Coq Formalisation of Lazy Rational Arithmetic -- Mobility Types in Coq -- Some Algebraic Structures in Lambda-Calculus with Inductive Types -- A Concurrent Logical Framework: The Propositional Fragment -- Formal Proof Sketches -- Applied Type System. 330 $aThese proceedings contain a selection of refereed papers presented at or related to the 3rd Annual Workshop of the Types Working Group (Computer-Assisted Reasoning Based on Type Theory, EU IST project 29001), which was held d- ing April 30 to May 4, 2003, in Villa Gualino, Turin, Italy. The workshop was attended by about 100 researchers. Out of 37 submitted papers, 25 were selected after a refereeing process. The ?nal choices were made by the editors. Two previous workshops of the Types Working Group under EU IST project 29001 were held in 2000 in Durham, UK, and in 2002 in Berg en Dal (close to Nijmegen), The Netherlands. These workshops followed a series of meetings organized in the period 1993?2002 within previous Types projects (ESPRIT BRA 6435 and ESPRIT Working Group 21900). The proceedings of these e- lier workshops were also published in the LNCS series, as volumes 806, 996, 1158, 1512, 1657, 2277, and 2646. ESPRIT BRA 6453 was a continuation of ESPRIT Action 3245, Logical Frameworks: Design, Implementation and Ex- riments. Proceedings for annual meetings under that action were published by Cambridge University Press in the books ?Logical Frameworks?, and ?Logical Environments?, edited by G. Huet and G. Plotkin. We are very grateful to the members of the research group ?Semantics and Logics of Computation? of the Computer Science Department of the University of Turin, who helped organize the Types 2003 meeting in Torino. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v3085 606 $aProgramming languages (Electronic computers) 606 $aComputer logic 606 $aMathematical logic 606 $aArtificial intelligence 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 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 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 615 0$aProgramming languages (Electronic computers). 615 0$aComputer logic. 615 0$aMathematical logic. 615 0$aArtificial intelligence. 615 14$aProgramming Languages, Compilers, Interpreters. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 615 24$aArtificial Intelligence. 676 $a004/.01/5113 702 $aBerardi$b Stefano$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aCoppo$b Mario$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aDamiani$b Ferruccio$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910144152703321 996 $aTypes for Proofs and Programs$9771867 997 $aUNINA