Types for Proofs and Programs International Workshop, TYPES 2003, Torino, Italy, April 30 - May 4, 2003, Revised Selected Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Berardi, Stefano (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Coppo, Mario (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Damiani, Ferruccio (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
• Έκδοση: 1st ed. 2004.
• Σειρά: Lecture Notes in Computer Science, 3085
• Θέματα: Programming languages (Electronic computers).; Computer logic.; Mathematical logic.; Artificial intelligence.; Programming Languages, Compilers, Interpreters.; Logics and Meanings of Programs.; Mathematical Logic and Formal Languages.; Artificial Intelligence.

These 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...

Πίνακας περιεχομένων:

• A 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.