<feed xmlns='http://www.w3.org/2005/Atom'>
<title>coq/contrib/subtac/test, branch master</title>
<subtitle>The formal proof system</subtitle>
<link rel='alternate' type='text/html' href='https://git.0x7felf.com/coq/'/>
<entry>
<title>Directory 'contrib' renamed into 'plugins', to end confusion with archive of user contribs</title>
<updated>2009-03-20T01:22:58+00:00</updated>
<author>
<name>letouzey</name>
</author>
<published>2009-03-20T01:22:58+00:00</published>
<link rel='alternate' type='text/html' href='https://git.0x7felf.com/coq/commit/?id=7d220f8b61649646692983872626d6a8042446a9'/>
<id>7d220f8b61649646692983872626d6a8042446a9</id>
<content type='text'>
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@11996 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@11996 85f007b7-540e-0410-9357-904b9bb8a0f7
</pre>
</div>
</content>
</entry>
<entry>
<title>Various improvements in handling of evars in general and typing</title>
<updated>2008-06-21T10:04:11+00:00</updated>
<author>
<name>msozeau</name>
</author>
<published>2008-06-21T10:04:11+00:00</published>
<link rel='alternate' type='text/html' href='https://git.0x7felf.com/coq/commit/?id=cfba38a75b7166dfaf036833ce0b735242929ba8'/>
<id>cfba38a75b7166dfaf036833ce0b735242929ba8</id>
<content type='text'>
constraints in Program:
- normalize types and defs of local fixpoints before checking the
guardness condition to avoid having to give type annotations, e.g:
&lt;&lt;
Definition fold (A B : Set) (f : B -&gt; A -&gt; B) : B -&gt; tree A -&gt; B :=
  fix aux acc t :=
    match t with
      | Leaf x =&gt; f acc x
      | Node l =&gt; fold_left aux l acc
    end.
&gt;&gt;
- add new inh_coerce_to_prod to allow coercion of the typing constraint
to a product before trying to split it. It's a noop in standard mode, 
and forgets subsets in Program. Allows to typecheck:
&lt;&lt; (λ x, x) : { f : nat -&gt; nat | ... } &gt;&gt;.
- Better handling of the "abstract" typing constraints in Program.
- Correctly normalize w.r.t. evars. the tycon given by users in Program.


git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@11156 85f007b7-540e-0410-9357-904b9bb8a0f7
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
constraints in Program:
- normalize types and defs of local fixpoints before checking the
guardness condition to avoid having to give type annotations, e.g:
&lt;&lt;
Definition fold (A B : Set) (f : B -&gt; A -&gt; B) : B -&gt; tree A -&gt; B :=
  fix aux acc t :=
    match t with
      | Leaf x =&gt; f acc x
      | Node l =&gt; fold_left aux l acc
    end.
&gt;&gt;
- add new inh_coerce_to_prod to allow coercion of the typing constraint
to a product before trying to split it. It's a noop in standard mode, 
and forgets subsets in Program. Allows to typecheck:
&lt;&lt; (λ x, x) : { f : nat -&gt; nat | ... } &gt;&gt;.
- Better handling of the "abstract" typing constraints in Program.
- Correctly normalize w.r.t. evars. the tycon given by users in Program.


git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@11156 85f007b7-540e-0410-9357-904b9bb8a0f7
</pre>
</div>
</content>
</entry>
<entry>
<title>Cleanup in subtac_cases, preparing to use improvements on return predicate</title>
<updated>2008-06-17T16:12:17+00:00</updated>
<author>
<name>msozeau</name>
</author>
<published>2008-06-17T16:12:17+00:00</published>
<link rel='alternate' type='text/html' href='https://git.0x7felf.com/coq/commit/?id=af6e0201cc47bc4bb6c60e2d3216f7b8a6503d25'/>
<id>af6e0201cc47bc4bb6c60e2d3216f7b8a6503d25</id>
<content type='text'>
inference. Little improvement un subtac_obligations: do not retry to
solve all obligations when finishing to solve one obligation nobody
depends on.


git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@11133 85f007b7-540e-0410-9357-904b9bb8a0f7
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
inference. Little improvement un subtac_obligations: do not retry to
solve all obligations when finishing to solve one obligation nobody
depends on.


git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@11133 85f007b7-540e-0410-9357-904b9bb8a0f7
</pre>
</div>
</content>
</entry>
<entry>
<title>Backport code from command.ml to subtac_command.ml for definining</title>
<updated>2008-02-08T16:42:26+00:00</updated>
<author>
<name>msozeau</name>
</author>
<published>2008-02-08T16:42:26+00:00</published>
<link rel='alternate' type='text/html' href='https://git.0x7felf.com/coq/commit/?id=c164dc2aadd8d26b362669b9af6b45cbd8e563ff'/>
<id>c164dc2aadd8d26b362669b9af6b45cbd8e563ff</id>
<content type='text'>
recursive definitions. Now program accepts cofixpoints and uses the new
way infer structurally decreasing arguments. Also, checks for correct
recursive calls before giving the definition to the obligations machine
(solves part 1 of bug #1784).


git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@10529 85f007b7-540e-0410-9357-904b9bb8a0f7
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
recursive definitions. Now program accepts cofixpoints and uses the new
way infer structurally decreasing arguments. Also, checks for correct
recursive calls before giving the definition to the obligations machine
(solves part 1 of bug #1784).


git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@10529 85f007b7-540e-0410-9357-904b9bb8a0f7
</pre>
</div>
</content>
</entry>
<entry>
<title>Fix de Bruijn bug in wf definitions.</title>
<updated>2007-08-26T17:34:47+00:00</updated>
<author>
<name>msozeau</name>
</author>
<published>2007-08-26T17:34:47+00:00</published>
<link rel='alternate' type='text/html' href='https://git.0x7felf.com/coq/commit/?id=6a3623430870ee1998c172c362bc60591fc908ee'/>
<id>6a3623430870ee1998c172c362bc60591fc908ee</id>
<content type='text'>
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@10096 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@10096 85f007b7-540e-0410-9357-904b9bb8a0f7
</pre>
</div>
</content>
</entry>
<entry>
<title>Correct implementation of undo in obligations handling code, correct some bugs in pattern-matching</title>
<updated>2007-04-17T18:11:56+00:00</updated>
<author>
<name>msozeau</name>
</author>
<published>2007-04-17T18:11:56+00:00</published>
<link rel='alternate' type='text/html' href='https://git.0x7felf.com/coq/commit/?id=cc65a9b7754e9645ac72e629ce0b31359d8814cc'/>
<id>cc65a9b7754e9645ac72e629ce0b31359d8814cc</id>
<content type='text'>
compilation with multiple matched objects.


git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@9783 85f007b7-540e-0410-9357-904b9bb8a0f7
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
compilation with multiple matched objects.


git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@9783 85f007b7-540e-0410-9357-904b9bb8a0f7
</pre>
</div>
</content>
</entry>
<entry>
<title>Make multiple patterns work again with Program while simplifying the code.</title>
<updated>2007-03-26T16:17:25+00:00</updated>
<author>
<name>msozeau</name>
</author>
<published>2007-03-26T16:17:25+00:00</published>
<link rel='alternate' type='text/html' href='https://git.0x7felf.com/coq/commit/?id=b1ef4a82d936a6c56facd58daf9c513f44d7fb8e'/>
<id>b1ef4a82d936a6c56facd58daf9c513f44d7fb8e</id>
<content type='text'>
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@9732 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@9732 85f007b7-540e-0410-9357-904b9bb8a0f7
</pre>
</div>
</content>
</entry>
<entry>
<title>Solve obligation handling bug of trying to solve automatically at Next Obligation time. Now done at Qed or Defined.</title>
<updated>2007-03-13T20:30:36+00:00</updated>
<author>
<name>msozeau</name>
</author>
<published>2007-03-13T20:30:36+00:00</published>
<link rel='alternate' type='text/html' href='https://git.0x7felf.com/coq/commit/?id=bed901fd770c13c1f9825f51b4ed80c9bce280bc'/>
<id>bed901fd770c13c1f9825f51b4ed80c9bce280bc</id>
<content type='text'>
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@9700 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@9700 85f007b7-540e-0410-9357-904b9bb8a0f7
</pre>
</div>
</content>
</entry>
<entry>
<title>Debug wellfounded defs, work on cleaning obls envs</title>
<updated>2007-02-23T10:33:26+00:00</updated>
<author>
<name>msozeau</name>
</author>
<published>2007-02-23T10:33:26+00:00</published>
<link rel='alternate' type='text/html' href='https://git.0x7felf.com/coq/commit/?id=0d60be7083b50100ad78279791b687ad12fe109a'/>
<id>0d60be7083b50100ad78279791b687ad12fe109a</id>
<content type='text'>
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@9674 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@9674 85f007b7-540e-0410-9357-904b9bb8a0f7
</pre>
</div>
</content>
</entry>
<entry>
<title>Abbreviation of order notation.</title>
<updated>2007-02-01T12:00:51+00:00</updated>
<author>
<name>msozeau</name>
</author>
<published>2007-02-01T12:00:51+00:00</published>
<link rel='alternate' type='text/html' href='https://git.0x7felf.com/coq/commit/?id=3d519597dc4a8f86995297c5b013f1b4f87c73e2'/>
<id>3d519597dc4a8f86995297c5b013f1b4f87c73e2</id>
<content type='text'>
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@9576 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@9576 85f007b7-540e-0410-9357-904b9bb8a0f7
</pre>
</div>
</content>
</entry>
</feed>
