DeepAI AI Chat
Log In Sign Up

Extended Addressing Machines for PCF, with Explicit Substitutions

by   Benedetto Intrigila, et al.
Université Paris 13
University of Rome Tor Vergata

Addressing machines have been introduced as a formalism to construct models of the pure, untyped lambda-calculus. We extend the syntax of their programs by adding instructions for executing arithmetic operations on natural numbers, and introduce a reflection principle allowing certain machines to access their own address and perform recursive calls. We prove that the resulting extended addressing machines naturally model a weak call-by-name PCF with explicit substitutions. Finally, we show that they are also well-suited for representing regular PCF programs (closed terms) computing natural numbers.


Addressing Machines as models of lambda-calculus

Turing machines and register machines have been used for decades in theo...

Recovering Purity with Comonads and Capabilities

In this paper, we take a pervasively effectful (in the style of ML) type...

String Diagrams for Regular Logic (Extended Abstract)

Regular logic can be regarded as the internal language of regular catego...

Structural Operational Semantics for Control Flow Graph Machines

Compilers use control flow graph (CFG) representations of low-level prog...

Hilbert's Tenth Problem in Coq

We formalise the undecidability of solvability of Diophantine equations,...

Semantics, Verification, and Efficient Implementations for Tristate Numbers

Extended Berkeley Packet Filter(BPF)is an in-kernel, register-based virt...

Recursion does not always help

We show that, under mild assumptions, adding recursion does not increase...