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.
2017
European Symposium on Programming
Uppsala, Sweden
22-29 April 2017
Programming Languages and Systems
Springer
10201
804
830
978-3-662-54433-4
Padovani, Luca
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2318/1634961
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 14
  • ???jsp.display-item.citation.isi??? 11
social impact