2024/11/07 by Willem Heijltjes, Heijltjes, Willem · 1 citation
Computer Science · #Computability, Logic, AI Algorithms
paper · pdf · doi:10.48550/arxiv.2411.04615
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.