Recursion and Sequentiality in Categories of Sheaves

05/05/2021
by   Cristina Matache, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/31/2022

Concrete categories and higher-order recursion (With applications including probability, differentiability, and full abstraction)

We study concrete sheaf models for a call-by-value higher-order language...
research
02/16/2023

Weak Similarity in Higher-Order Mathematical Operational Semantics

Higher-order abstract GSOS is a recent extension of Turi and Plotkin's f...
research
03/16/2023

Kreisel's counter-example to full abstraction of the set-theoretical model of Goedel's system T

The set-theoretical model of Goedel's system T is not fully abstract. We...
research
05/01/2018

Probabilistic Stable Functions on Discrete Cones are Power Series (long version)

We study the category Cstabm of measurable cones and measurable stable f...
research
06/26/2020

The Fox and the Hound: Comparing Fully Abstract and Robust Compilation

We prove a theorem relating fully abstract compilation (FAC) to robust c...
research
01/21/2021

Complete trace models of state and control

We consider a hierarchy of four typed call-by-value languages with eithe...
research
11/07/2021

Pattern-based Subterm Selection in Isabelle

This article presents a pattern-based language designed to select (a set...

Please sign up or login with your details

Forgot password? Click here to reset