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...
Prif Awdur: | Matache, C |
---|---|
Awduron Eraill: | Staton, S |
Fformat: | Traethawd Ymchwil |
Iaith: | English |
Cyhoeddwyd: |
2022
|
Pynciau: |
Eitemau Tebyg
-
Structural foundations for probabilistic programming languages
gan: Stein, DM
Cyhoeddwyd: (2021) -
On the semantics of intensionality and intensional recursion
gan: Kavvos, G
Cyhoeddwyd: (2017) -
Semantics of Higher-Order Recursion Schemes
gan: Jiri Adamek, et al.
Cyhoeddwyd: (2011-04-01) -
Introduction to categories homological algebra and sheaf cohomology /
gan: 310776 Strooker, Jan R.
Cyhoeddwyd: (1978) -
Structural foundations for differentiable programming
gan: Huot, M
Cyhoeddwyd: (2022)