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...
Autor principal: | Matache, C |
---|---|
Outros Autores: | Staton, S |
Formato: | Tese |
Idioma: | English |
Publicado em: |
2022
|
Assuntos: |
Registros relacionados
-
Structural foundations for probabilistic programming languages
por: Stein, DM
Publicado em: (2021) -
On the semantics of intensionality and intensional recursion
por: Kavvos, G
Publicado em: (2017) -
Semantics of Higher-Order Recursion Schemes
por: Jiri Adamek, et al.
Publicado em: (2011-04-01) -
Introduction to categories homological algebra and sheaf cohomology /
por: 310776 Strooker, Jan R.
Publicado em: (1978) -
Structural foundations for differentiable programming
por: Huot, M
Publicado em: (2022)