67 search results - page 3 / 14 » A Theorem on Higher Bruhat Orders |
118
click to vote
CADE
2005
Springer
15 years 12 months ago
2005
Springer
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
106
click to vote
ASM
2010
ASM
15 years 4 months ago
2010
ASM
Traditionally, simulation is used to perform probabilistic analysis. However, it provides less accurate results and cannot handle large-scale problems due to the enormous CPU time ...
105
click to vote
CADE
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
FOSSACS
2009
Springer
15 years 6 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
104
click to vote
LICS
1998
IEEE
15 years 3 months ago
1998
IEEE
In this paper we describe the promoted tyft tyxt rule format for de ning higher-order languages. The rule format is a generalization of Groote and Vaandrager's tyft tyxt form...