๐ฎ
๐ฎ
The Ethereal
The Lambda Calculus is Quantifiable
November 18, 2024 ยท The Ethereal ยท ๐ Annual Conference for Computer Science Logic
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Valentin Maestracci, Paolo Pistone
arXiv ID
2411.11809
Category
cs.LO: Logic in CS
Cross-listed
cs.PL,
math.LO
Citations
1
Venue
Annual Conference for Computer Science Logic
Last Checked
5 months ago
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 $ฮป$-calculus, like those arising from Bรถhm trees and from the contextual preorder. Then, we introduce applicative distances capturing higher-order Scott topologies, including reflexive objects like the $D_\infty$ model. Finally, we provide a quantitative insight on the well-known connection between the Bรถhm tree of a $ฮป$-term and its Taylor expansion, by showing that the latter can be presented as an isometric transformation.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Logic in CS
๐ฎ
๐ฎ
The Ethereal
Safe Reinforcement Learning via Shielding
๐ฎ
๐ฎ
The Ethereal
Formal Verification of Piece-Wise Linear Feed-Forward Neural Networks
๐ฎ
๐ฎ
The Ethereal
Heterogeneous substitution systems revisited
๐ฎ
๐ฎ
The Ethereal
Omega-Regular Objectives in Model-Free Reinforcement Learning
๐ฎ
๐ฎ
The Ethereal