2529 search results - page 252 / 506 » The Logical Structure of Binding |
175
click to vote
CADE
2005
Springer
16 years 7 months ago
2005
Springer
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...
195
click to vote
EUROPAR
2005
Springer
16 years 6 days ago
2005
Springer
Dynamic instruction scheduling logic is one of the most critical and cycle-limiting structures in modern superscalar processors, and it is not easily pipelined without significant ...
173
click to vote
CORR
2008
Springer
15 years 6 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...
198
click to vote
ENTCS
2008
15 years 6 months ago
2008
Most implementations of functional and functional logic languages treat numbers and the basic numeric operations as external entities. The main reason for this is efficiency. Howe...
185
Voted
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic...