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 |
Μορφή: | Thesis |
Γλώσσα: | 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)