This instance will be upgraded to Heptapod 0.25.0 (final) on 2021-09-22 at 15:00 UTC+2 (a few minutes of down time)

Commit 096ef60b authored by Lars Hupel's avatar Lars Hupel
Browse files

regenerate entries

--HG--
branch : depends-on
parent 9c0b6d5f7093
......@@ -86,6 +86,10 @@ automatically and identify exactly the steps that are no longer valid.
<td class="data"><a href="http://afp.sourceforge.net/LICENSE">BSD License</a></td></tr>
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="AWN.shtml">AWN</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
<!--#set var="version" value="-VERSION-" -->
<!--#set var="afp-version" value="-AFPVERSION-" -->
......
......@@ -82,6 +82,10 @@ instances. <br>
<td class="data"><a href="http://afp.sourceforge.net/LICENSE.LGPL">GNU Lesser General Public License (LGPL)</a></td></tr>
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Regular-Sets.shtml">Regular-Sets</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
<!--#set var="version" value="-VERSION-" -->
<!--#set var="afp-version" value="-AFPVERSION-" -->
......
......@@ -64,6 +64,10 @@ The abstract proof can be instantiated for a wide range of Gentzen and tableau s
<td class="data"><a href="http://afp.sourceforge.net/LICENSE">BSD License</a></td></tr>
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Collections.shtml">Collections</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
<!--#set var="version" value="-VERSION-" -->
<!--#set var="afp-version" value="-AFPVERSION-" -->
......
......@@ -75,7 +75,7 @@ To this end, we mechanized several results on resultants, which also required us
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Sturm_Sequences.shtml">Sturm_Sequences</a>, <a href="Partial_Function_MR.shtml">Partial_Function_MR</a>, <a href="Sqrt_Babylonian.shtml">Sqrt_Babylonian</a>, <a href="Show.shtml">Show</a>, <a href="Jordan_Normal_Form.shtml">Jordan_Normal_Form</a>, <a href="Deriving.shtml">Deriving</a>, <a href="Polynomial_Factorization.shtml">Polynomial_Factorization</a></td></tr>
<td class="data"><a href="Sturm_Sequences.shtml">Sturm_Sequences</a>, <a href="Show.shtml">Show</a>, <a href="Deriving.shtml">Deriving</a>, <a href="Polynomial_Interpolation.shtml">Polynomial_Interpolation</a>, <a href="Abstract-Rewriting.shtml">Abstract-Rewriting</a>, <a href="Jordan_Normal_Form.shtml">Jordan_Normal_Form</a>, <a href="Polynomial_Factorization.shtml">Polynomial_Factorization</a>, <a href="Containers.shtml">Containers</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -78,7 +78,7 @@ Theorem Proving ITP 2015.
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Splay_Tree.shtml">Splay_Tree</a>, <a href="Skew_Heap.shtml">Skew_Heap</a></td></tr>
<td class="data"><a href="Splay_Tree.shtml">Splay_Tree</a>, <a href="Skew_Heap.shtml">Skew_Heap</a>, <a href="List-Index.shtml">List-Index</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -69,6 +69,10 @@ We formalize the AutoFocus Semantics (a time-synchronous subset of the Focus for
<td class="data"><a href="http://afp.sourceforge.net/LICENSE">BSD License</a></td></tr>
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="List-Infinite.shtml">List-Infinite</a>, <a href="Nat-Interval-Logic.shtml">Nat-Interval-Logic</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
<!--#set var="version" value="-VERSION-" -->
<!--#set var="afp-version" value="-AFPVERSION-" -->
......
......@@ -90,7 +90,7 @@ CAVA Automata Library, Isabelle Workshop 2014.
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Collections.shtml">Collections</a></td></tr>
<td class="data"><a href="Collections.shtml">Collections</a>, <a href="Native_Word.shtml">Native_Word</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -85,7 +85,7 @@ with the same title.
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Gabow_SCC.shtml">Gabow_SCC</a>, <a href="Promela.shtml">Promela</a>, <a href="LTL_to_GBA.shtml">LTL_to_GBA</a></td></tr>
<td class="data"><a href="CAVA_Automata.shtml">CAVA_Automata</a>, <a href="Gabow_SCC.shtml">Gabow_SCC</a>, <a href="Promela.shtml">Promela</a>, <a href="LTL_to_GBA.shtml">LTL_to_GBA</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -90,6 +90,10 @@ was added.
<td class="data"><a href="http://afp.sourceforge.net/LICENSE">BSD License</a></td></tr>
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Launchbury.shtml">Launchbury</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
<!--#set var="version" value="-VERSION-" -->
<!--#set var="afp-version" value="-AFPVERSION-" -->
......
......@@ -64,7 +64,7 @@ This entry provides several monads intended for the development of stand-alone c
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Show.shtml">Show</a>, <a href="Partial_Function_MR.shtml">Partial_Function_MR</a></td></tr>
<td class="data"><a href="Partial_Function_MR.shtml">Partial_Function_MR</a>, <a href="Show.shtml">Show</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -82,6 +82,10 @@ without further ado.</p>
<td class="data"><a href="http://afp.sourceforge.net/LICENSE">BSD License</a></td></tr>
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Regular-Sets.shtml">Regular-Sets</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
<!--#set var="version" value="-VERSION-" -->
<!--#set var="afp-version" value="-AFPVERSION-" -->
......
......@@ -88,7 +88,7 @@ A compatibility file CollectionsV1 tries to simplify porting of existing theorie
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Binomial-Heaps.shtml">Binomial-Heaps</a>, <a href="Finger-Trees.shtml">Finger-Trees</a>, <a href="Refine_Monadic.shtml">Refine_Monadic</a></td></tr>
<td class="data"><a href="Finger-Trees.shtml">Finger-Trees</a>, <a href="Native_Word.shtml">Native_Word</a>, <a href="Trie.shtml">Trie</a>, <a href="Automatic_Refinement.shtml">Automatic_Refinement</a>, <a href="Refine_Monadic.shtml">Refine_Monadic</a>, <a href="Binomial-Heaps.shtml">Binomial-Heaps</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -79,6 +79,10 @@ algorithms, and classify them based on those choices.
<td class="data"><a href="http://afp.sourceforge.net/LICENSE">BSD License</a></td></tr>
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Heard_Of.shtml">Heard_Of</a>, <a href="Stuttering_Equivalence.shtml">Stuttering_Equivalence</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
<!--#set var="version" value="-VERSION-" -->
<!--#set var="afp-version" value="-AFPVERSION-" -->
......
......@@ -84,7 +84,7 @@ provide generators for canonical type class instantiations
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Deriving.shtml">Deriving</a></td></tr>
<td class="data"><a href="Deriving.shtml">Deriving</a>, <a href="Collections.shtml">Collections</a>, <a href="Regular-Sets.shtml">Regular-Sets</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -80,7 +80,7 @@ command.
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Collections.shtml">Collections</a>, <a href="Deriving.shtml">Deriving</a></td></tr>
<td class="data"><a href="Deriving.shtml">Deriving</a>, <a href="Collections.shtml">Collections</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -65,7 +65,7 @@ This theory formalizes the commutation version of decreasing diagrams for Church
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Abstract-Rewriting.shtml">Abstract-Rewriting</a></td></tr>
<td class="data"><a href="Well_Quasi_Orders.shtml">Well_Quasi_Orders</a>, <a href="Abstract-Rewriting.shtml">Abstract-Rewriting</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -72,10 +72,6 @@ theorem and was therefore only proven for real polynomials.
<td class="data"><a href="http://afp.sourceforge.net/LICENSE">BSD License</a></td></tr>
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Sturm_Tarski.shtml">Sturm_Tarski</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
<!--#set var="version" value="-VERSION-" -->
<!--#set var="afp-version" value="-AFPVERSION-" -->
......
......@@ -70,7 +70,7 @@ structures from the Isabelle Collection Framework.
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Refine_Monadic.shtml">Refine_Monadic</a>, <a href="Collections.shtml">Collections</a></td></tr>
<td class="data"><a href="Collections.shtml">Collections</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -63,6 +63,10 @@ We formalize an algorithm to compute the Echelon Form of a matrix. We have prove
<td class="data"><a href="http://afp.sourceforge.net/LICENSE">BSD License</a></td></tr>
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Gauss_Jordan.shtml">Gauss_Jordan</a>, <a href="Cayley_Hamilton.shtml">Cayley_Hamilton</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
<!--#set var="version" value="-VERSION-" -->
<!--#set var="afp-version" value="-AFPVERSION-" -->
......
......@@ -68,6 +68,10 @@ This theorem is the 45th theorem of the Top 100 Theorems list.
<td class="data"><a href="http://afp.sourceforge.net/LICENSE">BSD License</a></td></tr>
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Card_Number_Partitions.shtml">Card_Number_Partitions</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
<!--#set var="version" value="-VERSION-" -->
<!--#set var="afp-version" value="-AFPVERSION-" -->
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment