632 search results - page 83 / 127 » Proving Invariants of Functional Programs |
104
Voted
CIE
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
138
Voted
ACL2
2006
ACM
15 years 6 months ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
CORR
2007
Springer
15 years 15 days ago
2007
Springer
– We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic c...
108
Voted
CORR
2004
Springer
15 years 11 days ago
2004
Springer
ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a reso...
169
click to vote
PLPV
2011
ACM
14 years 3 months ago
2011
ACM
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...