Quantitative polynomial functors

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

4 Downloads (Pure)

Abstract

We investigate containers and polynomial functors in Quantitative Type Theory, and give initial algebra semantics of inductive data types in the presence of linearity. We show that reasoning by induction is supported, and equivalent to initiality, also in the linear setting.

Original languageEnglish
Title of host publication9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021)
EditorsFabio Gadducci, Alexandra Silva
Place of PublicationDagstuhl, Germany
Pages22:1-22:5
Number of pages5
DOIs
Publication statusPublished - 3 Sep 2021
Event9th Conference on Algebra and Coalgebra in Computer Science, CALCO 2021 - Virtual, Salzburg, Austria
Duration: 31 Aug 20213 Sep 2021

Publication series

NameLeibniz International Proceedings in Informatics (LIPIcs)
PublisherSchloss Dagstuhl
Volume211
ISSN (Print)1868-8969

Conference

Conference9th Conference on Algebra and Coalgebra in Computer Science, CALCO 2021
Country/TerritoryAustria
CityVirtual, Salzburg
Period31/08/213/09/21

Keywords

  • inductive data types
  • polynomial functors
  • quantitative type theory

Fingerprint

Dive into the research topics of 'Quantitative polynomial functors'. Together they form a unique fingerprint.
  • Quantitative polynomial functors

    Nakov, G. & Nordvall Forsberg, F., 4 Aug 2022, 27th International Conference on Types for Proofs and Programs (TYPES 2021). Basold, H., Cockx, J. & Ghilezan, S. (eds.). Dagstuhl, Germany, Vol. 239. p. 10:1--10:22 22 p. 10. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 239).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution book

    Open Access
    File
    4 Downloads (Pure)

Cite this