scientific article; zbMATH DE number 7700630

DOI10.4230/LIPICS.FSCD.2021.25MaRDI QIDQ6159941zbMATH OpenFDO

Authors Cristina Matache, Sean Moss, Sam Staton

Publication date 23 June 2023

Full work available at URL https://arxiv.org/abs/2105.02156

zbMATH Keywords

full abstractionrecursiondenotational semanticssheaf toposesCPOs

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx) Computer science (68-XX)

Cited in

(4)

• Sheaf models for choice sequences
• Foundations of Software Science and Computation Structures
• Cost-sensitive computational adequacy of higher-order recursion in synthetic domain theory
• Concrete categories and higher-order recursion. With applications including probability, differentiability, and full abstraction

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6159941)