[PDF][PDF] System with Context-free Session Types

D Poças, D Costa, A Mordido… - European Symposium …, 2023 - library.oapen.org
We study increasingly expressive type systems, from Fµ—an extension of the polymorphic
lambda calculus with equirecursive types—to Fµ; ω—the higher-order polymorphic lambda …

Syntactic soundness proof of a type-and-capability system with hidden state

F Pottier - Journal of functional programming, 2013 - cambridge.org
This paper presents a formal definition and machine-checked soundness proof for a very
expressive type-and-capability system, that is, a low-level type system that keeps precise …

System F-omega with equirecursive types for datatype-generic programming

Y Cai, PG Giarrusso, K Ostermann - … of the 43rd Annual ACM SIGPLAN …, 2016 - dl.acm.org
Traversing an algebraic datatype by hand requires boilerplate code which duplicates the
structure of the datatype. Datatype-generic programming (DGP) aims to eliminate such …

Numbering matters: First-order canonical forms for second-order recursive types

N Gauthier, F Pottier - ACM SIGPLAN Notices, 2004 - dl.acm.org
We study a type system equipped with universal types and equire-cursive types, which we
refer to as F͘. We show that type equality may be decided in time O (n log n), an …

System with Context-free Session Types

D Costa, A Mordido, D Poças… - arXiv preprint arXiv …, 2023 - arxiv.org
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 …

Polya: True type polymorphism for mobile ambients

T Amtoft, H Makholm, JB Wells - … of Theoretical Informatics: IFIP 18th World …, 2004 - Springer
Previous type systems for mobility calculi (the original Mobile Ambients, its variants and
descendants, eg, Boxed Ambients and Safe Ambients, and other related systems) offer little …

[PDF][PDF] Mobile processes with dependent communication types and singleton types for names and capabilities

T Amtoft, JB Wells - 2002 - Citeseer
There are many calculi for reasoning about concurrent communicating processes which
have locations and are mobile. Examples include the original Ambient Calculus and its …

Subtyping for f-bounded quantifiers and equirecursive types

N Glew - Logic and Program Semantics: Essays Dedicated to …, 2012 - Springer
Equirecursive types consider a recursive type to be equal to its unrolling and have no
explicit term-level coercions to change a term's type from the former to the latter or vice …

[PDF][PDF] System Fµ

We study increasingly expressive type systems, from Fµ—an extension of the polymorphic
lambda calculus with equirecursive types—to Fµ; ω—the higher-order polymorphic lambda …

[PDF][PDF] PolyA: True type polymorphism for mobile ambients

T Amtoft, H Makholm, JB Wells - Unpublished draft. Supersedes [AW02], 2003 - Citeseer
Previous type systems for mobility calculi (the original Mobile Ambients, its variants and
descendants, eg, Boxed Ambients and Safe Ambients, and other related systems) offer little …