632 search results - page 107 / 127 » Proving Invariants of Functional Programs |
132
click to vote
COCO
2011
Springer
14 years 8 days ago
2011
Springer
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...
PAAPP
2006
15 years 11 days ago
2006
In this paper, we investigate algorithms for generating communication code to run on distributedmemory systems. We modify algorithms from previously published work and prove that ...
201
Voted
POPL
2003
ACM
16 years 23 days ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
108
Voted
VLSISP
2008
15 years 10 days ago
2008
Advanced bit manipulation operations are not efficiently supported by commodity word-oriented microprocessors. Programming tricks are typically devised to shorten the long sequence...
125
click to vote
BMCBI
2004
15 years 9 days ago
2004
Background: Information obtained by DNA microarray technology gives a rough snapshot of the transcriptome state, i.e., the expression level of all the genes expressed in a cell po...