Skip to main content
SpringerLink
Log in
Book cover

Types for Proofs and Programs

International Conference, TYPES 2008 Torino, Italy, March 26-29, 2008 Revised Selected Papers

  • Conference proceedings
  • © 2009

Overview

Editors:
  1. Stefano Berardi

    1. Dipartimento di Informatica, Università di Torino, Torino, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Ferruccio Damiani

    1. Dipartimento di Informatica, Università di Torino, Torino, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Ugo de’Liguoro

    1. Dipartimento di Informatica, Università di Torino, Torino, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5497)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: TYPES 2008.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (19 papers)

  1. Front Matter

    Download chapter PDF

  2. Type Inference by Coinductive Logic Programming

    • Davide Ancona, Giovanni Lagorio, Elena Zucca
    Pages 1-18

  3. About the Formalization of Some Results by Chebyshev in Number Theory

    • Andrea Asperti, Wilmer Ricciotti
    Pages 19-31

  4. A New Elimination Rule for the Calculus of Inductive Constructions

    • Bruno Barras, Pierre Corbineau, Benjamin Grégoire, Hugo Herbelin, Jorge Luis Sacchini
    Pages 32-48

  5. A Framework for the Analysis of Access Control Models for Interactive Mobile Devices

    • Juan Manuel Crespo, Gustavo Betarte, Carlos Luna
    Pages 49-63

  6. Proving Infinitary Normalization

    • Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Roel de Vrijer
    Pages 64-82

  7. First-Class Object Sets

    • Erik Ernst
    Pages 83-99

  8. Monadic Translation of Intuitionistic Sequent Calculus

    • José Espírito Santo, Ralph Matthes, Luís Pinto
    Pages 100-116

  9. Towards a Type Discipline for Answer Set Programming

    • Camillo Fiorentini, Alberto Momigliano, Mario Ornaghi
    Pages 117-135

  10. Type Inference for a Polynomial Lambda Calculus

    • Marco Gaboardi, Simona Ronchi Della Rocca
    Pages 136-152

  11. Local Theory Specifications in Isabelle/Isar

    • Florian Haftmann, Makarius Wenzel
    Pages 153-168

  12. Axiom Directed Focusing

    • Clément Houtmann
    Pages 169-185

  13. A Type System for Usage of Software Components

    • Dag Hovland
    Pages 186-202

  14. Merging Procedural and Declarative Proof

    • Cezary Kaliszyk, Freek Wiedijk
    Pages 203-219

  15. Using Structural Recursion for Corecursion

    • Yves Bertot, Ekaterina Komendantskaya
    Pages 220-236

  16. Manifest Fields and Module Mechanisms in Intensional Type Theory

    • Zhaohui Luo
    Pages 237-255

  17. A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq

    • Eelis van der Weegen, James McKinna
    Pages 256-271

  18. Coalgebraic Reasoning in Coq: Bisimulation and the λ-Coiteration Scheme

    • Milad Niqui
    Pages 272-288

  19. A Process-Model for Linear Programs

    • Luca Paolini, Mauro Piccolo
    Pages 289-305

  20. Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets

    • Luca Roversi, Luca Vercelli
    Pages 306-322
Back to top

Other volumes

  1. Types for Proofs and Programs

Keywords

About this book

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

Editors and Affiliations

  • Dipartimento di Informatica, Università di Torino, Torino, Italy

    Stefano Berardi, Ferruccio Damiani, Ugo de’Liguoro

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation