1989 search results - page 242 / 398 » Set functions for functional logic programming |
120
click to vote
JLP
2007
2007
Universality and semicomputability for nondeterministic programming languages over abstract algebras
15 years 3 months ago
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
151
click to vote
CACM
1999
15 years 3 months ago
1999
ion suffices ("decide which type you want and provide a full set of operations for each type"). If the application domain is, say, the administration of a university, the...
178
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: It is difficult to accurately interpret chromosomal correspondences such as true orthology and paralogy due to significant divergence of genomes from a common ancestor...
154
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...
166
Voted
HASKELL
2009
ACM
15 years 10 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...