Typechecking safe process synchronization

Autores
Bonelli, Eduardo; Compagnoni, Adriana; Gunter, Elsa
Año de publicación
2005
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
Session types describe the interactions between two parties within multi-party communications. They constitute a communication protocol in the sense that the order and type of interactions between two parties are specified. For their part, correspondence assertions provide a mechanism for synchronization. When session types and correspondence assertions are combined, they are able to describe synchronization across different communication sessions, yielding a rich language for imposing expressive interaction patterns in multi-party communications. This paper studies the typechecking problem for Iris, a typed π-calculus that combines session types and correspondence assertions. We define a typechecking algorithm and prove that it is sound and complete with respect to the typing rules. Furthermore, we show that the typing system satisfies the minimum effects property. Although session types have been extensively studied in the past few years, to our knowledge this is the first proof of decidability of typechecking for a type system with session types.
Facultad de Informática
Materia
Ciencias Informáticas
π-calculus
Concurrency
Type systems
Typechecking
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/83379

id SEDICI_e96d73ed5851f0d139c6645e4387efad
oai_identifier_str oai:sedici.unlp.edu.ar:10915/83379
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Typechecking safe process synchronizationBonelli, EduardoCompagnoni, AdrianaGunter, ElsaCiencias Informáticasπ-calculusConcurrencyType systemsTypecheckingSession types describe the interactions between two parties within multi-party communications. They constitute a communication protocol in the sense that the order and type of interactions between two parties are specified. For their part, correspondence assertions provide a mechanism for synchronization. When session types and correspondence assertions are combined, they are able to describe synchronization across different communication sessions, yielding a rich language for imposing expressive interaction patterns in multi-party communications. This paper studies the typechecking problem for Iris, a typed π-calculus that combines session types and correspondence assertions. We define a typechecking algorithm and prove that it is sound and complete with respect to the typing rules. Furthermore, we show that the typing system satisfies the minimum effects property. Although session types have been extensively studied in the past few years, to our knowledge this is the first proof of decidability of typechecking for a type system with session types.Facultad de Informática2005info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf3-22http://sedici.unlp.edu.ar/handle/10915/83379enginfo:eu-repo/semantics/altIdentifier/issn/1571-0661info:eu-repo/semantics/altIdentifier/doi/10.1016/j.entcs.2005.05.002info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:15:46Zoai:sedici.unlp.edu.ar:10915/83379Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:15:46.899SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Typechecking safe process synchronization
title Typechecking safe process synchronization
spellingShingle Typechecking safe process synchronization
Bonelli, Eduardo
Ciencias Informáticas
π-calculus
Concurrency
Type systems
Typechecking
title_short Typechecking safe process synchronization
title_full Typechecking safe process synchronization
title_fullStr Typechecking safe process synchronization
title_full_unstemmed Typechecking safe process synchronization
title_sort Typechecking safe process synchronization
dc.creator.none.fl_str_mv Bonelli, Eduardo
Compagnoni, Adriana
Gunter, Elsa
author Bonelli, Eduardo
author_facet Bonelli, Eduardo
Compagnoni, Adriana
Gunter, Elsa
author_role author
author2 Compagnoni, Adriana
Gunter, Elsa
author2_role author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
π-calculus
Concurrency
Type systems
Typechecking
topic Ciencias Informáticas
π-calculus
Concurrency
Type systems
Typechecking
dc.description.none.fl_txt_mv Session types describe the interactions between two parties within multi-party communications. They constitute a communication protocol in the sense that the order and type of interactions between two parties are specified. For their part, correspondence assertions provide a mechanism for synchronization. When session types and correspondence assertions are combined, they are able to describe synchronization across different communication sessions, yielding a rich language for imposing expressive interaction patterns in multi-party communications. This paper studies the typechecking problem for Iris, a typed π-calculus that combines session types and correspondence assertions. We define a typechecking algorithm and prove that it is sound and complete with respect to the typing rules. Furthermore, we show that the typing system satisfies the minimum effects property. Although session types have been extensively studied in the past few years, to our knowledge this is the first proof of decidability of typechecking for a type system with session types.
Facultad de Informática
description Session types describe the interactions between two parties within multi-party communications. They constitute a communication protocol in the sense that the order and type of interactions between two parties are specified. For their part, correspondence assertions provide a mechanism for synchronization. When session types and correspondence assertions are combined, they are able to describe synchronization across different communication sessions, yielding a rich language for imposing expressive interaction patterns in multi-party communications. This paper studies the typechecking problem for Iris, a typed π-calculus that combines session types and correspondence assertions. We define a typechecking algorithm and prove that it is sound and complete with respect to the typing rules. Furthermore, we show that the typing system satisfies the minimum effects property. Although session types have been extensively studied in the past few years, to our knowledge this is the first proof of decidability of typechecking for a type system with session types.
publishDate 2005
dc.date.none.fl_str_mv 2005
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Articulo
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/83379
url http://sedici.unlp.edu.ar/handle/10915/83379
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/issn/1571-0661
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.entcs.2005.05.002
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
3-22
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844616030173790208
score 13.070432