325 search results - page 37 / 65 » Proofs of Restricted Shuffles |
TAPSOFT
1997
Springer
14 years 2 months ago
1997
Springer
Abstract. This paper presents a formalization of nite and in nite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheor...
CCL
1994
Springer
14 years 2 months ago
1994
Springer
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...
COCO
1994
Springer
14 years 2 months ago
1994
Springer
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...
VLDB
1990
ACM
14 years 1 months ago
1990
ACM
Database programming requires having the knowledge of database semantics both to maintain database integrity and to explore more optimization opportunities. Automated programming ...
AMAST
2006
Springer
14 years 1 months ago
2006
Springer
This paper revolves around the so-called plan revision rules of the agent programming language 3APL. These rules can be viewed as a generalization of procedures. This generalizatio...