Some interesting communication protocols can be precisely described only by context-free session types, an extension of conventional session types with a general form of sequential composition. The complex metatheory of context-free session types, however, hinders the definition of corresponding checking and inference algorithms. In this work we address and solve these problems introducing a new type system for context-free session types of which we provide two OCaml embeddings.
Context-Free Session Type Inference
PADOVANI, Luca
2017-01-01
Abstract
Some interesting communication protocols can be precisely described only by context-free session types, an extension of conventional session types with a general form of sequential composition. The complex metatheory of context-free session types, however, hinders the definition of corresponding checking and inference algorithms. In this work we address and solve these problems introducing a new type system for context-free session types of which we provide two OCaml embeddings.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
chp%3A10.1007%2F978-3-662-54434-1_30.pdf
Accesso riservato
Tipo di file:
PDF EDITORIALE
Dimensione
871.62 kB
Formato
Adobe PDF
|
871.62 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
main_4aperto.pdf
Open Access dal 01/05/2018
Tipo di file:
POSTPRINT (VERSIONE FINALE DELL’AUTORE)
Dimensione
754.15 kB
Formato
Adobe PDF
|
754.15 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.