<?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-22T18:45:13Z</responseDate>
  <request identifier="5972" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:5972</identifier>
        <datestamp>2024-03-06T10:37:24Z</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>Normalisation by Evaluation for Dependent Types</dc:title>
          <dc:creator>Altenkirch, Thorsten</dc:creator>
          <dc:creator>Kaposi, Ambrus</dc:creator>
          <dc:subject>normalisation by evaluation</dc:subject>
          <dc:subject>dependent types</dc:subject>
          <dc:subject>internal type theory</dc:subject>
          <dc:subject>logical relations</dc:subject>
          <dc:subject>Agda</dc:subject>
          <dc:description>We develop normalisation by evaluation (NBE) for dependent types based&#13;
on presheaf categories. Our construction is formulated using internal&#13;
type theory using quotient inductive types. We use a typed&#13;
presentation hence there are no preterms or realizers in our&#13;
construction. NBE for simple types is using a logical relation between&#13;
the syntax and the presheaf interpretation. In our construction, we&#13;
merge the presheaf interpretation and the logical relation into a&#13;
proof-relevant logical predicate. We have formalized parts of the&#13;
construction in Agda.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Thorsten Altenkirch and Ambrus Kaposi</dc:contributor>
          <dc:date>2016</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 52, 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)</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/LIPIcs.FSCD.2016.6</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-59727</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2016.6</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
