8766 search results - page 185 / 1754 » Functional logic programming |
MFCS
2009
Springer
15 years 4 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 ...
ICALP
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
89
Voted
VMCAI
2012
Springer
13 years 5 months ago
2012
Springer
We describe a course on the semantics of a simple imperative programming language and on applications to compilers, type systems, static analyses and Hoare logic. The course is ent...
ASPDAC
1998
ACM
15 years 2 months ago
1998
ACM
—An AND-OR-EXOR network, where the output EXOR gate has only two inputs, is one of the simplest three-level architecture. This network realizes an EXOR of two sum-of-products exp...
CIE
2008
Springer
15 years 6 days 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