| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 534.11 KB | Adobe PDF |
Autores
Orientador(es)
Resumo(s)
Context-free session types allow syntactic validation of communication protocols. These offer
an extension over regular session types in making it possible to have nested protocols. With
the introduction of polymorphism in the language of context-free session types, the addition of
abstraction over types takes expressiveness a step further.
This paper focuses on extending context-free session types to full polymorphism, tackling the
challenges that arise with the inclusion of polymorphic session types. Enabling the programmer
to define types such as ∀α.T and its dual type, ∃β.U, where T and U are session types. With this
extended universe of types, we want to enable sequential composition of polymorphic types and
other session types.
The current state of the art of session types and type equivalence was studied, and a novel type
equivalence system was designed, based on canonical renaming and conversion of types to simple
grammars, implemented and evaluated in the FREEST language.
Descrição
Tese de mestrado, Informática, 2025, Universidade de Lisboa, Faculdade de Ciências
Palavras-chave
Polimorfismo Tipos de sessão livres de contexto Equivalência de tipos Renomeação canónica FREEST Teses de mestrado - 2025
