We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
Silvano Dal-Zilio, Denis Lugiez, Charles Meyssonni...
Security protocols are small programs designed to ensure properties such as secrecy of messages or authentication of parties in a hostile environment. In this paper we investigate ...
d Abstract] Mikolaj Boja?nczyk Faculty of Mathematics, Informatics and Mechanics Warsaw University Poland Claire David LIAFA Universit?e Paris 7 France Anca Muscholl LIAFA Universi...
Mikolaj Bojanczyk, Claire David, Anca Muscholl, Th...
We describe an s-expression based syntax-extension framework much like Scheme macros, with a key additional facility: the ability to define static semantics, such as type systems ...
Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class...