8766 search results - page 617 / 1754 » Functional logic programming |
130
Voted
TCAD
2008
15 years 5 months ago
2008
Boolean matching is one of the enabling techniques for technology mapping and logic resynthesis of Field Programmable Gate Array (FPGA). SAT-based Boolean matching (SAT-BM) has bee...
151
Voted
BIRTHDAY
2010
Springer
15 years 2 months ago
2010
Springer
In [7] Nash, Remmel, and Vianu have raised the question whether a logic L, already introduced by Gurevich in 1988, captures polynomial time, and they give a reformulation of this ...
138
Voted
FAC
2010
15 years 2 months ago
2010
Separation logic allows simple proofs of concurrent algorithms which use blocking mechanisms such as semaphores. It can even deal with non-blocking algorithms. With the addition of...
154
click to vote
JFP
2000
15 years 4 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
146
Voted
IFL
2007
Springer
15 years 11 months ago
2007
Springer
Haskell is a functional language, with features such as higher order functions and lazy evaluation, which allow succinct programs. These high-level features present many challenges...