<?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-30T14:29:15Z</responseDate>
  <request identifier="27033" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:27033</identifier>
        <datestamp>2026-07-30T09:16:25Z</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>Mendler Dialgebras and Recursion Schemes of Mixed Variance</dc:title>
          <dc:creator>Spahn, Stephan Alexander</dc:creator>
          <dc:subject>Mendler Algebra</dc:subject>
          <dc:subject>Dinatural Transformation</dc:subject>
          <dc:subject>Structured Recursion Scheme</dc:subject>
          <dc:subject>Grothendieck Fibration</dc:subject>
          <dc:subject>Higher-Order Abstract Syntax</dc:subject>
          <dc:description>We introduce the notion of Mendler dialgebra and provide a categorical semantics of recursion schemes of mixed variance in its terms. The Mendler-style approach - which employs second-order inference rules - to recursion schemes of mixed variance was championed by Uustalu and Vene in [Uustalu and Vene, 1999] using dinatural transformations, and we generalize their methods to include a variety of new recursion schemes including those presented by Ahn-Sheard in [Ahn and Sheard, 2011], and Stump et al. in [Aaron Stump et al., 2020]. We give sufficient criteria for reducibility of Mendler dialgebras to Lambek algebras [Joachim Lambek, 1968] which correspond to first-order inference rules. A similar reduction in elementary terms for the special case of the systems studied in [Uustalu and Vene, 1999] had been given by the authors, but our approach differs in that we use the language of two-sided fibrations [Street, 1974] to express the reduction for our generalization. This reveals that the "diagonal" of every two-sided fibration with a fibered initial object is isomorphic to a category of Lambek algebras; a dual version concerning reduction to Lambek coalgebras, as well as to bialgebras (inserters), [Joachim Lambek, 1970] is given. We also discuss various properties and examples of Mendler dialgebras, including higher-order abstract syntax which is paradigmatic for definitions of mixed variance. Generally, we regard the paper as a contribution to a more systematic understanding of the relation between higher-order and first-order inference rules.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Stephan Alexander Spahn</dc:contributor>
          <dc:date>2026</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 384, 31st International Conference on Types for Proofs and Programs (TYPES 2025)</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.TYPES.2025.15</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-270338</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TYPES.2025.15</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>
