3119 search results - page 351 / 624 » General Default Logic |
151
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
We describe a monadic interface to low-level hardware features that is a suitable basis for building operating systems in Haskell. The interface includes primitives for controllin...
168
click to vote
ICFP
2002
ACM
16 years 6 months ago
2002
ACM
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...
166
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
176
click to vote
LATA
2010
Springer
16 years 4 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
189
click to vote
ICCD
2007
IEEE
16 years 3 months ago
2007
IEEE
In single processor architectures, computationallyintensive functions are typically accelerated using hardware accelerators, which exploit the concurrency in the function code to ...