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
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

05/13/2022

Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines

We present fully abstract encodings of the call-by-name and call-by-valu...
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...
01/21/2021

Complete trace models of state and control

We consider a hierarchy of four typed call-by-value languages with eithe...
09/23/2020

Local Higher-Order Fixpoint Iteration

Local fixpoint iteration describes a technique that restricts fixpoint i...
11/07/2021

Pattern-based Subterm Selection in Isabelle

This article presents a pattern-based language designed to select (a set...
01/20/2020

Modular coinduction up-to for higher-order languages via first-order transition systems

The bisimulation proof method can be enhanced by employing `bisimulation...
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...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.