<feed xmlns='http://www.w3.org/2005/Atom'>
<title>coq/contrib/micromega/Examples.v, branch master</title>
<subtitle>The formal proof system</subtitle>
<link rel='alternate' type='text/html' href='https://git.0x7felf.com/coq/'/>
<entry>
<title>Intégration de micromega ("omicron" pour fourier et sa variante sur Z,</title>
<updated>2008-05-19T19:10:40+00:00</updated>
<author>
<name>herbelin</name>
</author>
<published>2008-05-19T19:10:40+00:00</published>
<link rel='alternate' type='text/html' href='https://git.0x7felf.com/coq/commit/?id=7c51ef20064ed4f44a4e1dcb2040ec4b74919b5f'/>
<id>7c51ef20064ed4f44a4e1dcb2040ec4b74919b5f</id>
<content type='text'>
"micromega" et "sos" pour les problèmes non linéaires sous-traités à
csdp); mise en place d'un cache pour pouvoir rejouer les preuves
sans avoir besoin de csdp (pour l'instant c'est du bricolage, faudra
affiner cela).



git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@10947 85f007b7-540e-0410-9357-904b9bb8a0f7
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
"micromega" et "sos" pour les problèmes non linéaires sous-traités à
csdp); mise en place d'un cache pour pouvoir rejouer les preuves
sans avoir besoin de csdp (pour l'instant c'est du bricolage, faudra
affiner cela).



git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@10947 85f007b7-540e-0410-9357-904b9bb8a0f7
</pre>
</div>
</content>
</entry>
<entry>
<title>Added NIso.v to Makefile.common. Changed Examples.v in contrib/micromega to use NRing instead of Ring_polynom.</title>
<updated>2007-10-25T10:38:52+00:00</updated>
<author>
<name>emakarov</name>
</author>
<published>2007-10-25T10:38:52+00:00</published>
<link rel='alternate' type='text/html' href='https://git.0x7felf.com/coq/commit/?id=d7690f1f394e00211802f16d07de53505ddbcd2d'/>
<id>d7690f1f394e00211802f16d07de53505ddbcd2d</id>
<content type='text'>
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@10264 85f007b7-540e-0410-9357-904b9bb8a0f7
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@10264 85f007b7-540e-0410-9357-904b9bb8a0f7
</pre>
</div>
</content>
</entry>
<entry>
<title>Added transitivity and irreflexivity of &lt;, as well as &lt; -elimination for binary positive numbers.</title>
<updated>2007-10-16T16:28:17+00:00</updated>
<author>
<name>emakarov</name>
</author>
<published>2007-10-16T16:28:17+00:00</published>
<link rel='alternate' type='text/html' href='https://git.0x7felf.com/coq/commit/?id=d7e249dc1bfc2dd04ccf23c57b7ad40f1902568d'/>
<id>d7e249dc1bfc2dd04ccf23c57b7ad40f1902568d</id>
<content type='text'>
Added directory contribs/micromega with the generalization of Frédéric Besson's micromega tactic for an arbitrary ordered ring. So far no tactic has been defined. One has to apply the theorems and find the certificate, which is necessary to solve inequations, manually.


git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@10226 85f007b7-540e-0410-9357-904b9bb8a0f7
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
Added directory contribs/micromega with the generalization of Frédéric Besson's micromega tactic for an arbitrary ordered ring. So far no tactic has been defined. One has to apply the theorems and find the certificate, which is necessary to solve inequations, manually.


git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@10226 85f007b7-540e-0410-9357-904b9bb8a0f7
</pre>
</div>
</content>
</entry>
</feed>
