Types for Proofs and Programs

TRAMA

These proceedings contain a selection of refereed papers presented at or - lated to the Annual Workshop of the TYPES project (EU coordination action 510996), which was held during March 26–29, 2008 in Turin, Italy. The topic of this workshop, and of all previous workshops of the same project, was f- mal reasoning and computer programming based on type theory: languages and computerized tools for reasoning, and applications in several domains such as analysis of programming languages, certi?ed software, mobile code, formali- tion of mathematics, mathematics education. The workshop was attended by more than 100 researchers and included more than 40 presentations. We also had three invited lectures, from A. Asperti (University of Bologna), G. Dowek (LIX, Ecole polytechnique, France) and J. W. Klop (Vrije Universiteit, A- terdam, The Netherlands). From 27 submitted papers, 19 were selected after a reviewing process. Each submitted paper was reviewed by three referees; the ?nal decisions were made by the editors. This workshop is the last of a series of meetings of the TYPES working group funded by the European Union (IST project 29001, ESPRIT Working Group 21900, ESPRIT BRA 6435).

SOMMARIO

Type Inference by Coinductive Logic Programming.- About the Formalization of Some Results by Chebyshev in Number Theory.- A New Elimination Rule for the Calculus of Inductive Constructions.- A Framework for the Analysis of Access Control Models for Interactive Mobile Devices.- Proving Infinitary Normalization.- First-Class Object Sets.- Monadic Translation of Intuitionistic Sequent Calculus.- Towards a Type Discipline for Answer Set Programming.- Type Inference for a Polynomial Lambda Calculus.- Local Theory Specifications in Isabelle/Isar.- Axiom Directed Focusing.- A Type System for Usage of Software Components.- Merging Procedural and Declarative Proof.- Using Structural Recursion for Corecursion.- Manifest Fields and Module Mechanisms in Intensional Type Theory.- A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq.- Coalgebraic Reasoning in Coq: Bisimulation and the ?-Coiteration Scheme.- A Process-Model for Linear Programs.- Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets.

ALTRE INFORMAZIONI

• Condizione: Nuovo
• ISBN: 9783642024436
• Collana: Lecture Notes in Computer Science
• Dimensioni: 235 x 155 mm Ø 510 gr
• Formato: Brossura
• Illustration Notes: VIII, 323 p.
• Pagine Arabe: 323
• Pagine Romane: viii