Sciweavers

207 search results - page 31 / 42
» Elementary Strong Functional Programming
Sort
View
COCO
2008
Springer
146views Algorithms» more  COCO 2008»
13 years 9 months ago
A Direct Product Theorem for Discrepancy
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
Troy Lee, Adi Shraibman, Robert Spalek
DLS
2008
165views Languages» more  DLS 2008»
13 years 9 months ago
Filtered dispatch
Predicate dispatching is a generalized form of dynamic dispatch, which has strong limitations when arbitrary predicates of the underlying base language are used. Unlike classes, w...
Pascal Costanza, Charlotte Herzeel, Jorge Vallejos...
POPL
2010
ACM
14 years 5 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...
BMCBI
2008
78views more  BMCBI 2008»
13 years 7 months ago
A new protein linear motif benchmark for multiple sequence alignment software
Background: Linear motifs (LMs) are abundant short regulatory sites used for modulating the functions of many eukaryotic proteins. They play important roles in post-translational ...
Emmanuel Perrodou, Claudia Chica, Olivier Poch, To...
CSB
2005
IEEE
118views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Gene Teams with Relaxed Proximity Constraint
Functionally related genes co-evolve, probably due to the strong selection pressure in evolution. Thus we expect that they are present in multiple genomes. Physical proximity amon...
Sun Kim, Jeong-Hyeon Choi, Jiong Yang