Dynamic composition of protocol features allows applications to establish connections with custom communication characteristics. Automatically computing possible compositions and ...
Temporal Constraint Satisfaction Problems allow for reasoning with events happening over time. Their expressiveness has been extended independently in two directions: to account f...
Neil Yorke-Smith, Kristen Brent Venable, Francesca...
Scheme includes a simple yet powerful macro mechanism. Using macros, programmers can easily extend the language with new kinds of expressions and definitions, thus abstracting ove...
Background: Determining whether a gene is differentially expressed in two different samples remains an important statistical problem. Prior work in this area has featured the use ...
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...