The Functional Machine Calculus III: Choice (Early Announcement)
Logic in Computer Science
2024-11-08 v1
Abstract
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.
Cite
@article{arxiv.2411.04615,
title = {The Functional Machine Calculus III: Choice (Early Announcement)},
author = {Willem Heijltjes},
journal= {arXiv preprint arXiv:2411.04615},
year = {2024}
}