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

DOI10.1145/3531130.3533370MaRDI QIDQ6649494

Sean Moss, Cristina Matache, Sam Staton

Publication date: 6 December 2024

zbMATH Keywords

domainscategoryrecursionhigher-orderlogical relationssynthetic domain theoryconcrete sheaves

Mathematics Subject Classification ID

Presheaves and sheaves, stacks, descent conditions (category-theoretic aspects) (18F20) Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A constructive manifestation of the Kleene-Kreisel continuous functionals
• Two models of synthetic domain theory
• Notions of computation and monads
• Partial map classifiers and partial cartesian closed categories
• Modelling environments in call-by-value programming languages.
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Computational adequacy for recursive types in models of intuitionistic set theory
• Kripke logical relations and PCF
• Correctness of automatic differentiation via diffeologies and categorical gluing
• Reverse AD at higher types: pure, principled and denotationally correct
• A relational account of call-by-value sequentiality
• Nominal sets. Names and symmetry in computer science
• Convenient categories of smooth spaces
• On a Topological Topos
• A uniform approach to domain theory in realizability models
• Axiomatic Domain Theory in Categories of Partial Maps
• Full Abstraction for Probabilistic PCF
• Presheaf Models of Quantum Computation: An Outline
• On the Versatility of Open Logical Relations
• A Convenient Category for Higher-Order Probability Theory
• Probabilistic Stable Functions on Discrete Cones are Power Series
• Semantics of Probabilistic Programming: A Gentle Introduction
• Application ofComputable Distributions to the Semantics of Probabilistic Programs
• Comparative Smootheology
• Amb Breaks Well-Pointedness, Ground Amb Doesn't

This page was built for publication: Concrete categories and higher-order recursion. With applications including probability, differentiability, and full abstraction

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