Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Mordido, Andreia"'
We study the interaction of structural subtyping with parametric polymorphism and recursively defined type constructors. Although structural subtyping is undecidable in this setting, we describe a notion of parametricity for type constructors and the
Externí odkaz:
http://arxiv.org/abs/2307.13661
Publikováno v:
Leibniz International Proceedings in Informatics (LIPIcs), 34th International Conference on Concurrency Theory (CONCUR 2023), pp.11:1-11:19
Context-free session types describe structured patterns of communication on heterogeneously-typed channels, allowing the specification of protocols unconstrained by tail recursion. The enhanced expressive power provided by non-regular recursion comes
Externí odkaz:
http://arxiv.org/abs/2307.05661
Publikováno v:
EPTCS 378, 2023, pp. 1-13
We present a kind inference algorithm for the FREEST programming language. The input to the algorithm is FREEST source code with (possibly part of) kind annotations replaced by kind variables. The algorithm infers concrete kinds for all kind variable
Externí odkaz:
http://arxiv.org/abs/2304.06396
We propose algebraic protocols that enable the definition of protocol templates and session types analogous to the definition of domain-specific types with algebraic datatypes. Parameterized algebraic protocols subsume all regular as well as most con
Externí odkaz:
http://arxiv.org/abs/2304.03764
We study increasingly expressive type systems, from $F^\mu$ -- an extension of the polymorphic lambda calculus with equirecursive types -- to $F^{\mu;}_\omega$ -- the higher-order polymorphic lambda calculus with equirecursive types and context-free
Externí odkaz:
http://arxiv.org/abs/2301.08659
Publikováno v:
EPTCS 356, 2022, pp. 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:
http://arxiv.org/abs/2203.12877
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:
http://arxiv.org/abs/2201.10998
Publikováno v:
In Theoretical Computer Science 27 June 2024 1001
The popularity of smart contracts is on the rise, yet breaches in reliability and security linger. Among the many facets of smart contract reliability, we concentrate on faults rooted in out-of-order interactions with contract endpoints. We propose S
Externí odkaz:
http://arxiv.org/abs/2108.02672
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:
http://arxiv.org/abs/2106.06658