English

Sequence Types and Infinitary Semantics

Logic in Computer Science 2021-12-16 v2 Programming Languages

Abstract

We introduce a new representation of non-idempotent intersection types, using \textbf{sequences} (families indexed with natural numbers) instead of lists or multisets. This allows scaling up \textbf{intersection type} theory to the infinitary λ\lambda-calculus. We thus characterize hereditary head normalization, which gives a positive answer to a question known as \textbf{Klop's Problem}. On our way, we use \textbf{non-idempotent intersection} to retrieve some well-known results on infinitary terms.

Keywords

Cite

@article{arxiv.2102.07515,
  title  = {Sequence Types and Infinitary Semantics},
  author = {Pierre Vial},
  journal= {arXiv preprint arXiv:2102.07515},
  year   = {2021}
}

Comments

68 pages, 18 figures