1948 search results - page 99 / 390 » Formalizing Mirror Theory |
197
click to vote
ENTCS
2006
15 years 5 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
267
click to vote
POPL
2004
ACM
16 years 5 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
164
click to vote
KR
2004
Springer
15 years 10 months ago
2004
Springer
There are numerous applications such as air traffic management, cellular phone location tracking, and vehicle protection systems where there is a critical need to reason about mo...
153
click to vote
TYPES
1999
Springer
15 years 9 months ago
1999
Springer
We propose a method to search for a lemma in a goq proof library by using the lemma type as a key. The method is based on the concept of type isomorphism developed within the funct...
161
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems. The reason for that, however, remains unclear. A framework for a theory of ...