Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Andreia Mordido"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 291, Iss Proc. PLACES 2019, Pp 12-23 (2019)
FreeST is an experimental concurrent programming language. Based on a core linear functional programming language, it features primitives to fork new threads, and for channel creation and communication. A powerful type system of context-free session
Externí odkaz:
https://doaj.org/article/d07842f85cea47d8909af9ef97cbe7e7
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 356:24-35
We present an extension of System F with higher-order context-free session types. The mixture of functional types with session types has proven to be a challenge for type equivalence formalization: whereas functional type equivalence is often rule-ba
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e14f5dbe4b5e01420ad7f2a3d30cc6b
https://doi.org/10.4204/eptcs.356.3
https://doi.org/10.4204/eptcs.356.3
Publikováno v:
Theoretical Computer Science. 897:23-48
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f46548e4aaf3b228941e37048e72fdc0
https://doi.org/10.1016/j.tcs.2021.08.005
https://doi.org/10.1016/j.tcs.2021.08.005
Publikováno v:
Programming Languages and Systems ISBN: 9783031300431
We study increasingly expressive type systems, from $$F^\mu $$ F μ —an extension of the polymorphic lambda calculus with equirecursive types—to $$F^{\mu ;}_\omega $$ F ω μ ; —the higher-order polymorphic lambda calculus with equirecursive t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8aadaad20fce62a9077116e4ee5ac5ba
https://doi.org/10.1007/978-3-031-30044-8_15
https://doi.org/10.1007/978-3-031-30044-8_15
Publikováno v:
PLACES@ETAPS
The original paper on Mixed Sessions introduce the side A of the tape: there is an encoding of classical sessions into mixed sessions. Here we present side B: there is a translation of (a subset of) mixed sessions into classical session types. We pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::053cf1d4d76a750466af71ebc7c75787
https://doi.org/10.4204/eptcs.314.5
https://doi.org/10.4204/eptcs.314.5
Publikováno v:
Programming Languages and Systems ISBN: 9783030993351
Polarization of types in call-by-push-value naturally leads to the separation of inductively defined observable values (classified by positive types), and coinductively defined computations (classified by negative types), with adjoint modalities medi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::49ca77e2b1beb1f3be457eb4f4342a7e
https://doi.org/10.1007/978-3-030-99336-8_16
https://doi.org/10.1007/978-3-030-99336-8_16
Context-free session types provide a typing discipline for recursive structured communication protocols on bidirectional channels. They overcome the restriction of regular session type systems to tail recursive protocols. This extension enables us to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eebd4bd92c90fb33473d35677b4529e8
http://arxiv.org/abs/2106.06658
http://arxiv.org/abs/2106.06658
Publikováno v:
Theoretical Computer Science. 781:39-62
We analyze a generalized probabilistic satisfiability problem ( GenPSAT ) which consists in deciding the satisfiability of linear inequalities involving probabilities of classical propositional formulas. GenPSAT is proved to be NP -complete and we pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b60fb56f1826bb9c9e52dccd1df840a6
https://doi.org/10.1016/j.tcs.2019.02.021
https://doi.org/10.1016/j.tcs.2019.02.021
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 291, Iss Proc. PLACES 2019, Pp 12-23 (2019)
PLACES@ETAPS
PLACES@ETAPS
FreeST is an experimental concurrent programming language. Based on a core linear functional programming language, it features primitives to fork new threads, and for channel creation and communication. A powerful type system of context-free session
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::778515aa39c401789d2b72a72e9e5890
https://doaj.org/article/d07842f85cea47d8909af9ef97cbe7e7
https://doaj.org/article/d07842f85cea47d8909af9ef97cbe7e7
Autor:
Andreia Mordido, Carlos Caleiro
Publikováno v:
Mathematical Structures in Computer Science. 29:872-895
We propose and study a probabilistic logic over an algebraic basis, including equations and domain restrictions. The logic combines aspects from classical logic and equational logic with an exogenous approach to quantitative probabilistic reasoning.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22f3961b14e3a66a2e464cf78981eeeb
https://doi.org/10.1017/s096012951800035x
https://doi.org/10.1017/s096012951800035x