Sciweavers

15779 search results - page 2617 / 3156
» Change-oriented software engineering
Sort
View
FOSSACS
2010
Springer
15 years 11 months ago
A Hierarchy for Delimited Continuations in Call-by-Name
Λµ-calculus was introduced as a Böhm-complete extension of Parigot's λµ-calculus. Λµ-calculus, contrarily to Parigot's calculus, is a calculus of CBN delimited con...
Alexis Saurin
FOSSACS
2010
Springer
15 years 11 months ago
Solvability in Resource Lambda-Calculus
Abstract. The resource calculus is an extension of the λ-calculus allowing to model resource consumption. Namely, the argument of a function comes as a finite multiset of resourc...
Michele Pagani, Simona Ronchi Della Rocca
FOSSACS
2010
Springer
15 years 11 months ago
The Complexity of Synchronous Notions of Information Flow Security
The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one i...
Franck Cassez, Ron van der Meyden, Chenyi Zhang
FOSSACS
2010
Springer
15 years 11 months ago
Parameterised Multiparty Session Types
For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time. T...
Nobuko Yoshida, Pierre-Malo Deniélou, Andi ...
FOSSACS
2010
Springer
15 years 11 months ago
Monads Need Not Be Endofunctors
Abstract. We introduce a generalisation of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vect...
Thorsten Altenkirch, James Chapman, Tarmo Uustalu
« Prev « First page 2617 / 3156 Last » Next »