1941 search results - page 124 / 389 » Reasoning about Computations Using Two-Levels of Logic |
117
Voted
ESWS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Despite of their advertisement as task independent representations, the reuse of ontologies in different contexts is difficult. An explanation for this is that when devel...
152
Voted
JFP
2007
15 years 3 months ago
2007
The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this meth...
127
click to vote
CSL
2006
Springer
15 years 7 months ago
2006
Springer
The goal of this note is to provide a background and references for the invited lecture presented at Computer Science Logic 2006. We briefly discuss motivations that led to the eme...
104
Voted
ICCD
1991
IEEE
15 years 6 months ago
1991
IEEE
This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures. Current-Sensing Completion Detection, CSCD, allow...
242
Voted
POPL
2004
ACM
16 years 3 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...