The Functional Machine Calculus III: Choice (Early Announcement)
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909379711729664 |
|---|---|
| author | Heijltjes, Willem |
| author_facet | Heijltjes, Willem |
| contents | The Functional Machine Calculus (Heijltjes 2022) is an extension of the lambda-calculus that preserves confluent reduction and typed termination, while enabling both call-by-name and call-by-value reduction behaviour and encoding the computational effects of mutable higher-order store, input/output, and probabilistic computation. In this note the calculus is extended to capture exception handling and loop constructs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_04615 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Functional Machine Calculus III: Choice (Early Announcement) Heijltjes, Willem Logic in Computer Science The Functional Machine Calculus (Heijltjes 2022) is an extension of the lambda-calculus that preserves confluent reduction and typed termination, while enabling both call-by-name and call-by-value reduction behaviour and encoding the computational effects of mutable higher-order store, input/output, and probabilistic computation. In this note the calculus is extended to capture exception handling and loop constructs. |
| title | The Functional Machine Calculus III: Choice (Early Announcement) |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2411.04615 |