Stability Property for the Call-by-Value $λ$-calculus through Taylor Expansion
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910609762680832 |
|---|---|
| author | Barbarossa, Davide |
| author_facet | Barbarossa, Davide |
| contents | We prove the Stability Property for the call-by-value $λ$-calculus (CbV in the following). This result states necessary conditions under which the contexts of the CbV $λ$-calculus commute with intersections of approximants. This is an important non-trivial result, which implies the sequentiality of the calculus. We prove it via the tool of Taylor-resource approximation, whose power has been shown in several recent papers. This technique is usually conceived for the ordinary $λ$-calculus, but it can be easily defined for the CbV setting. Our proof is the adaptation of the one for the ordinary calculus using the same technique, with some minimal technical modification due to the fact that in the CbV setting one linearises terms in a slightly different way than usual (cfr. $!(A\multimap B)$ vs $!A\multimap B$). The content of this article is taken from the PhD thesis of the author. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_11572 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Stability Property for the Call-by-Value $λ$-calculus through Taylor Expansion Barbarossa, Davide Logic in Computer Science We prove the Stability Property for the call-by-value $λ$-calculus (CbV in the following). This result states necessary conditions under which the contexts of the CbV $λ$-calculus commute with intersections of approximants. This is an important non-trivial result, which implies the sequentiality of the calculus. We prove it via the tool of Taylor-resource approximation, whose power has been shown in several recent papers. This technique is usually conceived for the ordinary $λ$-calculus, but it can be easily defined for the CbV setting. Our proof is the adaptation of the one for the ordinary calculus using the same technique, with some minimal technical modification due to the fact that in the CbV setting one linearises terms in a slightly different way than usual (cfr. $!(A\multimap B)$ vs $!A\multimap B$). The content of this article is taken from the PhD thesis of the author. |
| title | Stability Property for the Call-by-Value $λ$-calculus through Taylor Expansion |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2409.11572 |