Publicação

The Session Abstract Machine

Ver documento

Detalhes bibliográficos
Resumo:We build on a fine-grained analysis of session-based interaction as provided by the linear logic typing disciplines to introduce the SAM, an abstract machine for mechanically executing session-typed processes. A remarkable feature of the SAM’s design is its ability to naturally segregate and coordinate sequential with concurrent session behaviours. In particular, implicitly sequential parts of session programs may be efficiently executed by deterministic sequential application of SAM transitions, amenable to compilation, and without concurrent synchronisation mechanisms. We provide an intuitive discussion of the SAM structure and its underlying design, and state and prove its correctness for executing programs in a session calculus corresponding to full classical linear logic CLL. We also discuss extensions and applications of the SAM to the execution of linear and session-based programming languages.
Autores principais:Caires, Luís
Outros Autores:Toninho, Bernardo
Assunto:Abstract machine Linear Logic Session Types Theoretical Computer Science General Computer Science
Ano:2024
País:Portugal
Tipo de documento:documento de conferência
Tipo de acesso:acesso aberto
Instituição associada:Universidade Nova de Lisboa
Idioma:inglês
Origem:Repositório Institucional da UNL
_version_ 1868982709629485056
author Caires, Luís
author2 Toninho, Bernardo
author2_role author
author_facet Caires, Luís
Toninho, Bernardo
author_role author
contributor_name_str_mv NOVALincs
RUN
country_str PT
creators_json_txt [{\"Person.name\":\"Caires, Luís\"},{\"Person.name\":\"Toninho, Bernardo\"}]
datacite.contributors.contributor.contributorName.fl_str_mv NOVALincs
RUN
datacite.creators.creator.creatorName.fl_str_mv Caires, Luís
Toninho, Bernardo
datacite.date.Accepted.fl_str_mv 2024-01-01T00:00:00Z
datacite.date.available.fl_str_mv 2025-03-13T21:21:22Z
datacite.date.embargoed.fl_str_mv 2025-03-13T21:21:22Z
datacite.rights.fl_str_mv http://purl.org/coar/access_right/c_abf2
datacite.subjects.subject.fl_str_mv Abstract machine
Linear Logic
Session Types
Theoretical Computer Science
General Computer Science
datacite.titles.title.fl_str_mv The Session Abstract Machine
dc.contributor.none.fl_str_mv NOVALincs
RUN
dc.creator.none.fl_str_mv Caires, Luís
Toninho, Bernardo
dc.date.Accepted.fl_str_mv 2024-01-01T00:00:00Z
dc.date.available.fl_str_mv 2025-03-13T21:21:22Z
dc.date.embargoed.fl_str_mv 2025-03-13T21:21:22Z
dc.format.none.fl_str_mv application/pdf
dc.identifier.none.fl_str_mv http://hdl.handle.net/10362/180622
dc.language.none.fl_str_mv eng
dc.publisher.none.fl_str_mv Springer Science and Business Media Deutschland GmbH
dc.rights.none.fl_str_mv http://purl.org/coar/access_right/c_abf2
dc.subject.none.fl_str_mv Abstract machine
Linear Logic
Session Types
Theoretical Computer Science
General Computer Science
dc.title.fl_str_mv The Session Abstract Machine
dc.type.none.fl_str_mv http://purl.org/coar/resource_type/c_c94f
description We build on a fine-grained analysis of session-based interaction as provided by the linear logic typing disciplines to introduce the SAM, an abstract machine for mechanically executing session-typed processes. A remarkable feature of the SAM’s design is its ability to naturally segregate and coordinate sequential with concurrent session behaviours. In particular, implicitly sequential parts of session programs may be efficiently executed by deterministic sequential application of SAM transitions, amenable to compilation, and without concurrent synchronisation mechanisms. We provide an intuitive discussion of the SAM structure and its underlying design, and state and prove its correctness for executing programs in a session calculus corresponding to full classical linear logic CLL. We also discuss extensions and applications of the SAM to the execution of linear and session-based programming languages.
dirty 0
eu_rights_str_mv openAccess
format conferenceObject
fulltext.url.fl_str_mv https://run.unl.pt/bitstreams/e462534c-72df-499b-9239-1ba24bd4e8b5/download
id run_9e6e1ce2a4ffae1b40ba40093aaa8bfe
identifier.url.fl_str_mv http://hdl.handle.net/10362/180622
inst_facet_str urn:organizationAcronym:unl{{{_:::_}}}Universidade Nova de Lisboa
instacron_str unl
institution Universidade Nova de Lisboa
instname_str Universidade Nova de Lisboa
language eng
network_acronym_str run
network_name_str Repositório Institucional da UNL
oai_identifier_str oai:run.unl.pt:10362/180622
organization_str_mv urn:organizationAcronym:unl
person_str_mv Caires, Luís
Toninho, Bernardo
publishDate 2024
publisher.none.fl_str_mv Springer Science and Business Media Deutschland GmbH
repo_facet_str urn:repositoryAcronym:run{{{_:::_}}}Repositório Institucional da UNL
reponame_str Repositório Institucional da UNL
repository_id_str urn:repositoryAcronym:run
service_str_mv urn:repositoryAcronym:run
spelling engSpringer Science and Business Media Deutschland GmbHenWe build on a fine-grained analysis of session-based interaction as provided by the linear logic typing disciplines to introduce the SAM, an abstract machine for mechanically executing session-typed processes. A remarkable feature of the SAM’s design is its ability to naturally segregate and coordinate sequential with concurrent session behaviours. In particular, implicitly sequential parts of session programs may be efficiently executed by deterministic sequential application of SAM transitions, amenable to compilation, and without concurrent synchronisation mechanisms. We provide an intuitive discussion of the SAM structure and its underlying design, and state and prove its correctness for executing programs in a session calculus corresponding to full classical linear logic CLL. We also discuss extensions and applications of the SAM to the execution of linear and session-based programming languages.application/pdfenThe Session Abstract MachineCaires, LuísToninho, BernardoNOVALincsHostingInstitutionOrganizationalRUNe-mailmailto:run@unl.ptrun@unl.ptISBNIsPartOf9783031572616ISSNIsPartOf0302-9743URNIsPartOfPURE: 106546404URNIsPartOfPURE UUID: 8e38f59e-72e3-447a-a01e-9a88b58acfc5URNIsPartOfScopus: 85192201283URNIsPartOfORCID: /0000-0002-0746-7514/work/180026314DOIIsPartOf10.1007/978-3-031-57262-3_92025-03-13T21:21:22Z20242024-01-01T00:00:00ZHandlehttp://hdl.handle.net/10362/180622http://purl.org/coar/access_right/c_abf2open accessAbstract machineLinear LogicSession TypesTheoretical Computer ScienceGeneral Computer Science778390 bytesother research producthttp://purl.org/coar/resource_type/c_c94fconference objecthttp://purl.org/coar/access_right/c_abf2application/pdffulltexthttps://run.unl.pt/bitstreams/e462534c-72df-499b-9239-1ba24bd4e8b5/download
spellingShingle The Session Abstract Machine
Caires, Luís
Abstract machine
Linear Logic
Session Types
Theoretical Computer Science
General Computer Science
status SINGLETON
subject.fl_str_mv Abstract machine
Linear Logic
Session Types
Theoretical Computer Science
General Computer Science
title The Session Abstract Machine
title_full The Session Abstract Machine
title_fullStr The Session Abstract Machine
title_full_unstemmed The Session Abstract Machine
title_short The Session Abstract Machine
title_sort The Session Abstract Machine
topic Abstract machine
Linear Logic
Session Types
Theoretical Computer Science
General Computer Science
topic_facet Abstract machine
Linear Logic
Session Types
Theoretical Computer Science
General Computer Science
url http://hdl.handle.net/10362/180622
visible 1