License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSCD.2023.29
URN: urn:nbn:de:0030-drops-180137
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/18013/
Go to the corresponding LIPIcs Volume Portal

Pautasso, Daniele ; Ronchi Della Rocca, Simona

A Quantitative Version of Simple Types

pdf-format:
LIPIcs-FSCD-2023-29.pdf (0.8 MB)

Abstract

This work introduces a quantitative version of the simple type assignment system, starting from a suitable restriction of non-idempotent intersection types. The resulting system is decidable and has the same typability power as the simple type system; thus, assigning types to terms supplies the very same qualitative information given by simple types, but at the same time can provide some interesting quantitative information. It is well known that typability for simple types is equivalent to unification; we prove a similar result for the newly introduced system. More precisely, we show that typability is equivalent to a unification problem which is a non-trivial extension of the classical one: in addition to unification rules, our typing algorithm makes use of an expansion operation that increases the cardinality of multisets whenever needed.

BibTeX - Entry

@InProceedings{pautasso_et_al:LIPIcs.FSCD.2023.29,
  author =	{Pautasso, Daniele and Ronchi Della Rocca, Simona},
  title =	{{A Quantitative Version of Simple Types}},
  booktitle =	{8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023)},
  pages =	{29:1--29:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-277-8},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{260},
  editor =	{Gaboardi, Marco and van Raamsdonk, Femke},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2023/18013},
  URN =		{urn:nbn:de:0030-drops-180137},
  doi =		{10.4230/LIPIcs.FSCD.2023.29},
  annote =	{Keywords: \lambda-calculus, intersection types, unification}
}

Keywords: λ-calculus, intersection types, unification
Collection: 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023)
Issue Date: 2023
Date of publication: 28.06.2023

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI