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...
1. Verfasser: | Matache, C |
---|---|
Weitere Verfasser: | Staton, S |
Format: | Abschlussarbeit |
Sprache: | English |
Veröffentlicht: |
2022
|
Schlagworte: |
Ähnliche Einträge
-
Structural foundations for probabilistic programming languages
von: Stein, DM
Veröffentlicht: (2021) -
On the semantics of intensionality and intensional recursion
von: Kavvos, G
Veröffentlicht: (2017) -
Semantics of Higher-Order Recursion Schemes
von: Jiri Adamek, et al.
Veröffentlicht: (2011-04-01) -
Introduction to categories homological algebra and sheaf cohomology /
von: 310776 Strooker, Jan R.
Veröffentlicht: (1978) -
Structural foundations for differentiable programming
von: Huot, M
Veröffentlicht: (2022)