2076 search results - page 42 / 416 » Functional logic overloading |
MFCS
2009
Springer
14 years 3 months ago
2009
Springer
Let C be a threshold logic circuit computing a Boolean function MODm : {0, 1}n → {0, 1}, where n ≥ 1 and m ≥ 2. Then C outputs “0” if the number of “1”s in an input ...
Book
"This book on applications of logic in the semantic analysis of language pays the
reader the compliment of not assuming anything about what he or she knows (in particular, no...
CIE
2008
Springer
13 years 10 months ago
2008
Springer
We show how different functional interpretations can be combined via a multi-modal linear logic. A concrete hybrid of Kreisel's modified realizability and G
CJ
2010
13 years 8 months ago
2010
rder logic (HOL) theorem prover. The high ability of abstraction in the HOL verification system allows its use for the verification task over the whole design path of the circuit, ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...