4895 search results - page 192 / 979 » Functional Quantum Programming |
131
Voted
ENTCS
2002
15 years 2 months ago
2002
Non-deterministic computations greatly enhance the expressive power of functional logic programs, but are often computationally expensive. We analyze a programming technique that ...
121
Voted
SIAMCOMP
2008
15 years 2 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
151
Voted
CORR
1998
Springer
15 years 2 months ago
1998
Springer
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
153
Voted
POPL
1992
ACM
15 years 6 months ago
1992
ACM
Semantics for a Higher-Order Functional Language with Logic Variables Radha Jagadeesan Imperial College, London, UK SW7 2BZ. Keshav Pingali Cornell University, Ithaca, NY 14853. A...
117
Voted
BMCBI
2010
15 years 2 months ago
2010
Background: Tandem mass spectrometry (MS/MS) has become the primary way for protein identification in proteomics. A good score function for measuring the match quality between a p...