394 search results - page 15 / 79 » Formal polytypic programs and proofs |
FLOPS
2010
Springer
14 years 2 months ago
2010
Springer
Disproof can be as important as proof in studying programs and programming languages. In particular, side conditions in a statement about program behavior are sometimes best unders...
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. In this paper, we show how Miquel's Implicit Calculus of Constructions (ICC) can be used as a programming language featuring dependent types. Since this system has a...
KI
1990
Springer
13 years 12 months ago
1990
Springer
ue to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. ...
ENTCS
2008
13 years 8 months ago
2008
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...