Concrete sheaf models of higher-order recursion
<p>This thesis studies denotational models, in the form of sheaf categories, of functional programming languages with higher-order functions and recursion. We give a general method for building such models and show how the method includes examples such as existing models of probabilistic and d...
Auteur principal: | Matache, C |
---|---|
Autres auteurs: | Staton, S |
Format: | Thèse |
Langue: | English |
Publié: |
2022
|
Sujets: |
Documents similaires
-
Structural foundations for probabilistic programming languages
par: Stein, DM
Publié: (2021) -
On the semantics of intensionality and intensional recursion
par: Kavvos, G
Publié: (2017) -
Semantics of Higher-Order Recursion Schemes
par: Jiri Adamek, et autres
Publié: (2011-04-01) -
Introduction to categories homological algebra and sheaf cohomology /
par: 310776 Strooker, Jan R.
Publié: (1978) -
Structural foundations for differentiable programming
par: Huot, M
Publié: (2022)