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 1e102b64 authored by Lars Hupel's avatar Lars Hupel
Browse files

regenerate entries

--HG--
branch : depends-on
parent b6888ef165a4
......@@ -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="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>
<td class="data"><a href="Abstract-Rewriting.shtml">Abstract-Rewriting</a>, <a href="Containers.shtml">Containers</a>, <a href="Deriving.shtml">Deriving</a>, <a href="Jordan_Normal_Form.shtml">Jordan_Normal_Form</a>, <a href="Polynomial_Factorization.shtml">Polynomial_Factorization</a>, <a href="Polynomial_Interpolation.shtml">Polynomial_Interpolation</a>, <a href="Show.shtml">Show</a>, <a href="Sturm_Sequences.shtml">Sturm_Sequences</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>, <a href="List-Index.shtml">List-Index</a></td></tr>
<td class="data"><a href="List-Index.shtml">List-Index</a>, <a href="Skew_Heap.shtml">Skew_Heap</a>, <a href="Splay_Tree.shtml">Splay_Tree</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="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>
<td class="data"><a href="CAVA_Automata.shtml">CAVA_Automata</a>, <a href="Gabow_SCC.shtml">Gabow_SCC</a>, <a href="LTL_to_GBA.shtml">LTL_to_GBA</a>, <a href="Promela.shtml">Promela</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -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="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>
<td class="data"><a href="Automatic_Refinement.shtml">Automatic_Refinement</a>, <a href="Binomial-Heaps.shtml">Binomial-Heaps</a>, <a href="Finger-Trees.shtml">Finger-Trees</a>, <a href="Native_Word.shtml">Native_Word</a>, <a href="Refine_Monadic.shtml">Refine_Monadic</a>, <a href="Trie.shtml">Trie</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -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>, <a href="Collections.shtml">Collections</a>, <a href="Regular-Sets.shtml">Regular-Sets</a></td></tr>
<td class="data"><a href="Collections.shtml">Collections</a>, <a href="Deriving.shtml">Deriving</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="Deriving.shtml">Deriving</a>, <a href="Collections.shtml">Collections</a></td></tr>
<td class="data"><a href="Collections.shtml">Collections</a>, <a href="Deriving.shtml">Deriving</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="Well_Quasi_Orders.shtml">Well_Quasi_Orders</a>, <a href="Abstract-Rewriting.shtml">Abstract-Rewriting</a></td></tr>
<td class="data"><a href="Abstract-Rewriting.shtml">Abstract-Rewriting</a>, <a href="Well_Quasi_Orders.shtml">Well_Quasi_Orders</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -64,7 +64,7 @@ We formalize an algorithm to compute the Echelon Form of a matrix. We have prove
<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>
<td class="data"><a href="Cayley_Hamilton.shtml">Cayley_Hamilton</a>, <a href="Gauss_Jordan.shtml">Gauss_Jordan</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -73,7 +73,7 @@ Brzozowski's minimization algorithm. Uniqueness up to isomorphism of minimal DFA
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Regular-Sets.shtml">Regular-Sets</a>, <a href="HereditarilyFinite.shtml">HereditarilyFinite</a></td></tr>
<td class="data"><a href="HereditarilyFinite.shtml">HereditarilyFinite</a>, <a href="Regular-Sets.shtml">Regular-Sets</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -85,7 +85,7 @@ project</a> with it.
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Slicing.shtml">Slicing</a>, <a href="Collections.shtml">Collections</a>, <a href="Dijkstra_Shortest_Path.shtml">Dijkstra_Shortest_Path</a></td></tr>
<td class="data"><a href="Collections.shtml">Collections</a>, <a href="Dijkstra_Shortest_Path.shtml">Dijkstra_Shortest_Path</a>, <a href="Slicing.shtml">Slicing</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -81,7 +81,7 @@ Coalgebraic Decision Procedure for WS1S</a> by the author.
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Deriving.shtml">Deriving</a>, <a href="Coinductive_Languages.shtml">Coinductive_Languages</a>, <a href="List-Index.shtml">List-Index</a>, <a href="Show.shtml">Show</a></td></tr>
<td class="data"><a href="Coinductive_Languages.shtml">Coinductive_Languages</a>, <a href="Deriving.shtml">Deriving</a>, <a href="List-Index.shtml">List-Index</a>, <a href="Show.shtml">Show</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -85,7 +85,7 @@ All the results have been applied to improve CeTA, our certifier to validate ter
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Matrix.shtml">Matrix</a>, <a href="Show.shtml">Show</a>, <a href="Gauss_Jordan.shtml">Gauss_Jordan</a>, <a href="Polynomial_Interpolation.shtml">Polynomial_Interpolation</a>, <a href="VectorSpace.shtml">VectorSpace</a>, <a href="Containers.shtml">Containers</a>, <a href="Abstract-Rewriting.shtml">Abstract-Rewriting</a></td></tr>
<td class="data"><a href="Abstract-Rewriting.shtml">Abstract-Rewriting</a>, <a href="Containers.shtml">Containers</a>, <a href="Gauss_Jordan.shtml">Gauss_Jordan</a>, <a href="Matrix.shtml">Matrix</a>, <a href="Polynomial_Interpolation.shtml">Polynomial_Interpolation</a>, <a href="Show.shtml">Show</a>, <a href="VectorSpace.shtml">VectorSpace</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -70,7 +70,7 @@ Knowledge-based programs (KBPs) are a formalism for directly relating agents' kn
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Trie.shtml">Trie</a>, <a href="Transitive-Closure.shtml">Transitive-Closure</a></td></tr>
<td class="data"><a href="Transitive-Closure.shtml">Transitive-Closure</a>, <a href="Trie.shtml">Trie</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -77,7 +77,7 @@ Recently, Javier Esparza and Jan Kretinsky proposed a new method directly transl
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="KBPs.shtml">KBPs</a>, <a href="List-Index.shtml">List-Index</a>, <a href="Boolean_Expression_Checkers.shtml">Boolean_Expression_Checkers</a></td></tr>
<td class="data"><a href="Boolean_Expression_Checkers.shtml">Boolean_Expression_Checkers</a>, <a href="KBPs.shtml">KBPs</a>, <a href="List-Index.shtml">List-Index</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -81,7 +81,7 @@ efficiently executable code can be extracted.
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Deriving.shtml">Deriving</a>, <a href="CAVA_Automata.shtml">CAVA_Automata</a>, <a href="Stuttering_Equivalence.shtml">Stuttering_Equivalence</a></td></tr>
<td class="data"><a href="CAVA_Automata.shtml">CAVA_Automata</a>, <a href="Deriving.shtml">Deriving</a>, <a href="Stuttering_Equivalence.shtml">Stuttering_Equivalence</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -69,7 +69,7 @@ There are many proofs of the Myhill-Nerode theorem using automata. In this libra
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Well_Quasi_Orders.shtml">Well_Quasi_Orders</a>, <a href="Regular-Sets.shtml">Regular-Sets</a></td></tr>
<td class="data"><a href="Regular-Sets.shtml">Regular-Sets</a>, <a href="Well_Quasi_Orders.shtml">Well_Quasi_Orders</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -108,7 +108,7 @@ Added Distributed WebApp example and improved graphviz visualization
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Transitive-Closure.shtml">Transitive-Closure</a>, <a href="Collections.shtml">Collections</a>, <a href="Automatic_Refinement.shtml">Automatic_Refinement</a></td></tr>
<td class="data"><a href="Automatic_Refinement.shtml">Automatic_Refinement</a>, <a href="Collections.shtml">Collections</a>, <a href="Transitive-Closure.shtml">Transitive-Closure</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -101,7 +101,7 @@ and trace set processes.
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Noninterference_CSP.shtml">Noninterference_CSP</a>, <a href="List_Interleaving.shtml">List_Interleaving</a></td></tr>
<td class="data"><a href="List_Interleaving.shtml">List_Interleaving</a>, <a href="Noninterference_CSP.shtml">Noninterference_CSP</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -70,7 +70,7 @@ certificates for planarity (i.e., a combinatorial map) or non-planarity
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Case_Labeling.shtml">Case_Labeling</a>, <a href="Transitive-Closure.shtml">Transitive-Closure</a>, <a href="Graph_Theory.shtml">Graph_Theory</a>, <a href="Simpl.shtml">Simpl</a>, <a href="List-Index.shtml">List-Index</a></td></tr>
<td class="data"><a href="Case_Labeling.shtml">Case_Labeling</a>, <a href="Graph_Theory.shtml">Graph_Theory</a>, <a href="List-Index.shtml">List-Index</a>, <a href="Simpl.shtml">Simpl</a>, <a href="Transitive-Closure.shtml">Transitive-Closure</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
......@@ -78,7 +78,7 @@ as well as primality-testing and prime-factorization algorithms for integers.
<tr><td class="datahead">Depends on:</td>
<td class="data"><a href="Matrix.shtml">Matrix</a>, <a href="Show.shtml">Show</a>, <a href="Sqrt_Babylonian.shtml">Sqrt_Babylonian</a>, <a href="Polynomial_Interpolation.shtml">Polynomial_Interpolation</a>, <a href="Partial_Function_MR.shtml">Partial_Function_MR</a>, <a href="Jordan_Normal_Form.shtml">Jordan_Normal_Form</a>, <a href="Containers.shtml">Containers</a></td></tr>
<td class="data"><a href="Containers.shtml">Containers</a>, <a href="Jordan_Normal_Form.shtml">Jordan_Normal_Form</a>, <a href="Matrix.shtml">Matrix</a>, <a href="Partial_Function_MR.shtml">Partial_Function_MR</a>, <a href="Polynomial_Interpolation.shtml">Polynomial_Interpolation</a>, <a href="Show.shtml">Show</a>, <a href="Sqrt_Babylonian.shtml">Sqrt_Babylonian</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
......
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