Types for Proofs and Programs (eBook, PDF)

International Conference, TYPES 2008 Torino, Italy, March 26-29, 2008 Revised Selected Papers
Redaktion: Berardi, Stefano; De Liguoro, Ugo; Damiani, Ferruccio

• Format: PDF

Produktbeschreibung

This book constitutes the thoroughly refereed post-conference proceedings of TYPES 2008, the last of a series of meetings of the TYPES working group funded by the European Union between 1993 and 2008; the workshop has been held in Torino, Italy, in March 2008.

The 19 revised full papers presented were carefully reviewed and selected from 27 submissions. The topic of the workshop was formal 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, certified software, mobile code, formalization of mathematics, mathematics education.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Berlin Heidelberg
• Seitenzahl: 323
• Erscheinungstermin: 7. Juni 2009
• Englisch
• ISBN-13: 9783642024443
• Artikelnr.: 44131591

Inhaltsangabe

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.