License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.05021.2
URN: urn:nbn:de:0030-drops-4385
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2006/438/
Go to the corresponding Portal |
Coquand, Thierry
05021 Executive Summary -- Mathematics, Algorithms, Proofs
Abstract
This workshop was the third MAP meeting,
a continuation of the seminar "Verification and constructive algebra" held in Dagstuhl from 6 to 10 January 2003.
The goal of these meetings is to bring together people from the communities of formal proofs, constructive
mathematics and computer algebra (in a wide meaning).
The special
emphasis of the present meeting was on the constructive mathematics and efficient proofs in computer algebra.
BibTeX - Entry
@InProceedings{coquand:DagSemProc.05021.2,
author = {Coquand, Thierry},
title = {{05021 Executive Summary – Mathematics, Algorithms, Proofs}},
booktitle = {Mathematics, Algorithms, Proofs},
pages = {1--3},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {5021},
editor = {Thierry Coquand and Henri Lombardi and Marie-Fran\c{c}oise Roy},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2006/438},
URN = {urn:nbn:de:0030-drops-4385},
doi = {10.4230/DagSemProc.05021.2},
annote = {Keywords: Constructive mathematics, computer algebra, proof systems}
}
Keywords: |
|
Constructive mathematics, computer algebra, proof systems |
Collection: |
|
05021 - Mathematics, Algorithms, Proofs |
Issue Date: |
|
2006 |
Date of publication: |
|
17.01.2006 |