279 search results - page 2 / 56 » Typability in Partial Applicative Structures |
ICFP
1999
ACM
13 years 10 months ago
1999
ACM
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
SDM
2012
SIAM
11 years 8 months ago
2012
SIAM
Objects linking with many other objects in an information network may imply various semantic relationships. Uncovering such knowledge is essential for role discovery, data cleanin...
BMCBI
2008
13 years 5 months ago
2008
Background: Understanding how proteins fold is essential to our quest in discovering how life works at the molecular level. Current computation power enables researchers to produc...
FMCAD
2007
Springer
13 years 12 months ago
2007
Springer
— The concept of applying partial fencing to logic built-in self test (LBIST) hardware structures for the purpose of using partially good chips is well known in the chip design i...
SEMWEB
2010
Springer
13 years 3 months ago
2010
Springer
We present a scalable, SPARQL-based computational pipeline for testing the lattice-theoretic properties of partial orders represented as RDF triples. The use case for this work is ...