Universality of proofs - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2017

Universality of proofs

Résumé

This report documents the program and the outcomes of Dagstuhl Seminar 16421 Universality of Proofs which took place October 16-21, 2016. The seminar was motivated by the fact that it is nowadays difficult to exchange proofs from one proof assistant to another one. Thus a formal proof cannot be considered as a universal proof, reusable in different contexts. The seminar aims at providing a comprehensive overview of the existing techniques for interoperability and going further into the development of a common objective and framework for proof developments that support the communication, reuse and interoperability of proofs. The seminar included participants coming from different fields of computer science such as logic, proof engineering, program verification, formal mathematics. It included overview talks, technical talks and breakout sessions. This report collects the abstracts of talks and summarizes the outcomes of the breakout sessions
Fichier non déposé

Dates et versions

hal-01678845 , version 1 (09-01-2018)

Identifiants

  • HAL Id : hal-01678845 , version 1

Citer

Gilles Dowek, Catherine Dubois, Brigitte Pientka, Florian Rabe. Universality of proofs. [Research Report] Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise; Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (Institut Mines-Télécom-Télécom SudParis-CNRS); INRIA Saclay - Ile de France (INRIA); Jacobs University [Bremen]; École normale supérieure - Cachan; McGill University / Université McGill. 2017, pp.24. ⟨hal-01678845⟩
173 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More