Type systems and program logics are often conceived to be at opposing ends of the spectrum of formal software analyses. In this paper we show that a flow-sensitive type system ensu...
In this paper, we discuss an approach to structural objects based on a generalisation of indiscernibility relation used in rough set theory. The existing results in rough set theor...
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independ...
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...
We present a continuation-passing-style (CPS) transformation for some dynamic delimited-control operators, including Felleisen’s control and prompt, that extends a standard call-...