1717 search results - page 107 / 344 » A Computable Spectral Theorem |
113
Voted
IPL
2006
15 years 4 months ago
2006
We present a Coq-formalised proof that all non-cooperative, sequential games have a Nash equilibrium point. Our proof methodology follows the style advocated by LCFstyle theorem p...
117
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
In computability theory, program self-reference is formalized by the not-necessarily-constructive form of Kleene’s Recursion Theorem (krt). In a programming system in which krt h...
137
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
We present an overview of the Jahob system for modular analysis of data structure properties. Jahob uses a subset of Java as the implementation language and annotations with formu...
188
click to vote
ACL2
2006
ACM
15 years 10 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 ...
138
click to vote
ISPAN
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper, we propose a technique combining loop distribution with loop fusion to improve the timing performance without increasing the code size of the transformed loops. We ...