English

The Lambda Calculus is Quantifiable

Logic in Computer Science 2024-11-19 v1 Programming Languages Logic

Abstract

In this paper we introduce several quantitative methods for the lambda-calculus based on partial metrics, a well-studied variant of standard metric spaces that have been used to metrize non-Hausdorff topologies, like those arising from Scott domains. First, we study quantitative variants, based on program distances, of sensible equational theories for the λ\lambda-calculus, like those arising from B\"ohm trees and from the contextual preorder. Then, we introduce applicative distances capturing higher-order Scott topologies, including reflexive objects like the DD_\infty model. Finally, we provide a quantitative insight on the well-known connection between the B\"ohm tree of a λ\lambda-term and its Taylor expansion, by showing that the latter can be presented as an isometric transformation.

Keywords

Cite

@article{arxiv.2411.11809,
  title  = {The Lambda Calculus is Quantifiable},
  author = {Valentin Maestracci and Paolo Pistone},
  journal= {arXiv preprint arXiv:2411.11809},
  year   = {2024}
}