6 search results - page 1 / 2 » Parikh's Theorem: A simple and direct construction |
CORR
2010
Springer
12 years 11 months ago
2010
Springer
CORR
2012
Springer
12 years 17 days ago
2012
Springer
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
VMCAI
2004
Springer
13 years 10 months ago
2004
Springer
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...
CADE
1994
Springer
13 years 9 months ago
1994
Springer
Pi is a system for the interactive construction and editing of formal derivations in the calculus of finitary partial inductive definitions. This calculus can be used as a logical ...