Sciweavers

1515 search results - page 14 / 303
» On the relation of aspects and monads
Sort
View
IFIPTCS
2010
13 years 5 months ago
A Logic on Subobjects and Recognizability
We introduce a simple logic that allows to quantify over the subobjects of a categorical object. We subsequently show that, for the category of graphs, this logic is equally expres...
Harrie Jan Sander Bruggink, Barbara König
HASKELL
2008
ACM
13 years 8 months ago
A library for light-weight information-flow security in haskell
Protecting confidentiality of data has become increasingly important for computing systems. Information-flow techniques have been developed over the years to achieve that purpos...
Alejandro Russo, Koen Claessen, John Hughes
ACL
2012
11 years 10 months ago
Towards the Unsupervised Acquisition of Discourse Relations
This paper describes a novel approach towards the empirical approximation of discourse relations between different utterances in texts. Following the idea that every pair of event...
Christian Chiarcos
POPL
2011
ACM
12 years 10 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
IEE
2008
108views more  IEE 2008»
13 years 7 months ago
Mining execution relations for crosscutting concerns
Aspect mining tries to identify crosscutting concerns in the code of existing systems and thus supports their adaption to an aspect-oriented design. A semi-automatic static aspect...
Jens Krinke