<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-20T02:32:05Z</responseDate>
  <request identifier="438" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:438</identifier>
        <datestamp>2024-03-06T11:06:07Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>05021 Executive Summary – Mathematics, Algorithms, Proofs</dc:title>
          <dc:creator>Coquand, Thierry</dc:creator>
          <dc:subject>Constructive mathematics</dc:subject>
          <dc:subject>computer algebra</dc:subject>
          <dc:subject>proof systems</dc:subject>
          <dc:description>This workshop was the third MAP meeting, &#13;
a continuation of the seminar "Verification and constructive algebra" held in Dagstuhl from 6 to 10 January 2003.&#13;
The goal of these meetings is to bring together people from the communities of formal proofs, constructive &#13;
mathematics and computer algebra (in a wide meaning).&#13;
The special&#13;
emphasis of the present meeting was on the constructive mathematics and efficient proofs in computer algebra.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Thierry Coquand</dc:contributor>
          <dc:date>2006</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 5021, Mathematics, Algorithms, Proofs (2006)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.05021.2</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-4385</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05021.2</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
