constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate o...
Abstract. We introduce the concept of guarded saturated sets, saturated sets of strongly normalizing terms closed under folding of corecursive functions. Using this tool, we can mo...
Abstract. We pair session types and contracts using two encodings. The encoding of session types accommodates width and depth subtyping, two properties that partially hold in contr...
Abstract— The problem of exact null-controllability is considered for a wide class of linear neutral type systems with distributed delay. The main tool of the analysis is the app...
Abstract. We add name groups and group creation to the typed ambient calculus. Group creation is surprisingly interesting: it has the e ect of statically preventing certain communi...