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...
المؤلف الرئيسي: | Matache, C |
---|---|
مؤلفون آخرون: | Staton, S |
التنسيق: | أطروحة |
اللغة: | English |
منشور في: |
2022
|
الموضوعات: |
مواد مشابهة
-
Structural foundations for probabilistic programming languages
حسب: Stein, DM
منشور في: (2021) -
On the semantics of intensionality and intensional recursion
حسب: Kavvos, G
منشور في: (2017) -
Semantics of Higher-Order Recursion Schemes
حسب: Jiri Adamek, وآخرون
منشور في: (2011-04-01) -
Introduction to categories homological algebra and sheaf cohomology /
حسب: 310776 Strooker, Jan R.
منشور في: (1978) -
Structural foundations for differentiable programming
حسب: Huot, M
منشور في: (2022)