Recursion and Sequentiality in Categories of Sheaves
Programming Languages
2021-07-07 v1 Logic in Computer Science
Category Theory
Abstract
We present a fully abstract model of a call-by-value language with higher-order functions, recursion and natural numbers, as an exponential ideal in a topos. Our model is inspired by the fully abstract models of O'Hearn, Riecke and Sandholm, and Marz and Streicher. In contrast with semantics based on cpo's, we treat recursion as just one feature in a model built by combining a choice of modular components.
Cite
@article{arxiv.2105.02156,
title = {Recursion and Sequentiality in Categories of Sheaves},
author = {Cristina Matache and Sean Moss and Sam Staton},
journal= {arXiv preprint arXiv:2105.02156},
year = {2021}
}