551 search results - page 58 / 111 » Realizability of Real-Time Logics |
150
click to vote
FPL
2003
Springer
15 years 11 months ago
2003
Springer
We discuss high-performance programmable asynchronous pipeline arrays (PAPAs). These pipeline arrays are coarse-grain field programmable gate arrays (FPGAs) that realize high data...
156
click to vote
FUZZY
2001
Springer
15 years 10 months ago
2001
Springer
In the paper a new approach to building a MOS threshold element and an arti cial neuron on its base is discussed. The implementability of the known MOS threshold elements is restri...
133
click to vote
ICLP
2001
Springer
15 years 10 months ago
2001
Springer
This paper describes the development of the PALS system, an implementation of Prolog that efficiently exploits or-parallelism on share-nothing platforms. PALS makes use of a novel ...
189
click to vote
BIRTHDAY
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Church's Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence into an infinite sequence such tha...
158
click to vote
ENTCS
2006
15 years 6 months ago
2006
We formalize two proofs of weak head normalization for the simply typed lambdacalculus in first-order minimal logic: one for normal-order reduction, and one for applicative-order ...