From 25f471c5fbf136870dac7e1b97ac4a8f1e5aa8a3 Mon Sep 17 00:00:00 2001
From: Tim Daly
Date: Sun, 28 May 2017 16:46:02 0400
Subject: [PATCH] src/axiomwebsite/documentation.html Literate Programming
talk
Goal: Axiom Literate Programming

changelog  2 +
patch  160 +
src/axiomwebsite/documentation.html  4 +
src/axiomwebsite/patches.html  2 +
4 files changed, 10 insertions(+), 158 deletions()
diff git a/changelog b/changelog
index 15680a6..fc668f6 100644
 a/changelog
+++ b/changelog
@@ 1,3 +1,5 @@
+20170528 tpd src/axiomwebsite/patches.html 20170528.02.tpd.patch
+20170528 tpd src/axiomwebsite/documentation.html Literate Programming talk
20170528 tpd src/axiomwebsite/patches.html 20170528.01.tpd.patch
20170528 tpd bookvolbib reference for Cylindrical Algebraic Decomposition
20170527 tpd src/axiomwebsite/patches.html 20170527.01.tpd.patch
diff git a/patch b/patch
index a0370eb..0bfc460 100644
 a/patch
+++ b/patch
@@ 1,160 +1,4 @@
bookvolbib reference for Cylindrical Algebraic Decomposition
+src/axiomwebsite/documentation.html Literate Programming talk
Goal: Axiom Algebra

\index{Arnon, Dennis}
\index{Buchberger, Bruno}
\begin{chunk}{axiom.bib}
@misc{Arno88a,
 author = "Arnon, Dennis and Buchberger, Bruno",
 title = "Algorithms in Real Algebraic Geometry",
 publisher = "Academic Press",
 year = "1988",
 journal = "Journal of Symbolic Computation"
}

\end{chunk}

\index{Dolzmann, Andreas}
\index{Sturm, Thomas}
\index{Weispfenning, Volker}
\begin{chunk}{axiom.bib}
@techreport{Dolz97a,
 author = "Dolzmann, Andreas and Sturm, Thomas and
 Weispfenning, Volker",
 title = "Real Quantifier Elimination in Practice",
 type = "technical report",
 institution = "University of Passau",
 number = "MIP9720",
 year = "1997",
 abstract =
 "We give a survey of three implemented real quantifier elimination
 methods: partial cylindrical algebraic decomposition, virtual
 substituion of test terms, and a combination of Groebner basis
 computations with multivariate real root counting. We examine the
 scope of these implementations for applications in various fields of
 science, engineering, and economics",
 paper = "Dolz97a.pdf"
}

\end{chunk}

\index{Dolzmann, Andreas}
\index{Sturm, Thomas}
\begin{chunk}{axiom.bib}
@misc{Dolz97,
 author = "Dolzmann, Andreas and Sturm, Thomas",
 title = "Guarded Expressions in Practice",
 link = "\url{http://redlog.dolzmann.de/papers/pdf/MIP9702.pdf}",
 year = "1997",
 abstract =
 "Computer algebra systems typically drop some degenerate cases when
 evaluating expressions, e.g. $x/x$ becomes 1 dropping the case
 $x=0$. We claim that it is feasible in practice to compute also the
 degenerate cases yielding {\sl guarded expressions}. We work over real
 closed fields but our ideas about handling guarded expressions can be
 easily transferred to other situations. Using formulas as guards
 provides a powerful tool for heuristically reducing the combinatorial
 explosion of cases: equivalent, redundant, tautological, and
 contradictive cases can be detected by simplification and quantifier
 elimination. Our approach allows to simplify the expressions on the
 basis of simplification knowledge on the logical side. The method
 described in this paper is implemented in the REDUCE package GUARDIAN,
 which is freely available on the WWW.",
 paper = "Dolz97.pdf"
}

\end{chunk}

\index{Basu, Saugata}
\index{Pollack, Richard}
\index{Roy, MarieFrancoise}
\begin{chunk}{axiom.bib}
@book{Basu06,
 author = "Basu, Saugata and Pollack, Richard and
 Roy, MarieFrancoise",
 title = "Algorithms in Real Algebraic Geometry",
 publisher = "Springer",
 year = "2006",
 isbn = "9783540330981"
}

\end{chunk}

\index{Arnon, Dennis Soul\'e}
\begin{chunk}{axiom.bib}
@phdthesis{Arno81,
 author = {Arnon, Dennis Soul\'e},
 title = "Algorithms for the Geometry of Semialgebraic Sets",
 institution = "University of WisconsinMadison",
 year = "1981",
 abstract =
 "Let A be a set of polynomials in r variables with integer
 coefficients. An $A$invariant cylindrical algebraic decomposition
 (cad) of $r$dimensional Euclidean space (G. Collins, Lect. Notes
 Comp. Sci., 33, SpringerVerlag, 1975, pp 134183) is a certain
 cellular decomposition of $r$space, such that each cell is a
 semialgebraic set, the polynomials of $A$ are signinvariant on
 each cell, and the cells are arranged into cylinders. The cad
 algorithm given by Collins provides, among other applications,
 the fastest known decision procedure for real closed fields, a
 cellular decomposition algorithm for semialgebraic sets, and a
 method of solving nonlinear (polynomial) optimization problems
 exactly. The timeconsuming calculations with real algebraic
 numbers required by the algorithm have been an obstacle to its
 implementation and use. The major contribution of this thesis
 is a new version of the cad algorithm for $r \le 3$, in which
 one works with maximal connected $A$invariant collections of
 cells, in such a way as to often avoid the most timeconsuming
 algebraic number calculations. Essential to this new cad
 algorithm is an algorithm we present for determination of
 adjacenies among the cells of a cad. Computer programs for
 the cad and adjacency algorithms have been written, providing
 the first complete implementation of a cad algorithm. Empirical
 data obtained from application of these programs are presented
 and analyzed."
}

\end{chunk}

\index{McCallum, Scott}
\begin{chunk}{axiom.bib}
@phdthesis{Mcca84,
 author = "McCallum, Scott",
 title = "An Improved Projection Operator for Cylindrical
 Algebraic Decomposition",
 institution = "University of WisconsinMadison",
 year = "1984",
 comment = "Computer Sciences Technical Report \#578",
 link = "\url{ftp://ftp.cs.wisc.edu/pub/techreports/1985/TR578.pdf}",
 abstract =
 "A fundamental algorithm pertaining to the solution of polynomial
 equations in several variables is the {\sl cylindrical algebraic
 decomposition (cad)} algorithm due to G.E. Collins. Given as input
 a set $A$ of integral polynomials in $r$ variables, the cad
 algorithm produces a decomposition of the euclidean space of $r$
 dimensions into cells, such that each polynomial in $A$ is
 invariant in sign throughout each of the cells in the decomposition.

 A key component of the cad algorithm is the projection operation:
 the {\sl projection} of a set $A$ of $r$variate polynomials is
 defined to be a certain set $P$ of $(r1)$variate polynomials.
 The solution set, or variety, of the polynomials in $P$ comprises
 a projection in the geometric sense of the variety of $A$. The cad
 algorithm proceeds by forming successive projections of the input
 set $A$, each projection resulting in the elimination of one
 variable.

 This thesis is concerned with a refinement to the cad algorithm,
 and to its projection operation in particular. It is shown, using
 a theorem from real algebraic geometry, that the original
 projection set that Collins used can be substantially reduced in
 size, without affecting its essential properties. The results of
 theoretical analysis and empirical observations suggest that the
 reduction in the projection set size leads to an overall decrease
 in the computing time of the cad algorithm.",
 paper = "Mcca84.pdf"
}

\end{chunk}
+Goal: Axiom Literate Programming
diff git a/src/axiomwebsite/documentation.html b/src/axiomwebsite/documentation.html
index f2b2d41..7d2c346 100644
 a/src/axiomwebsite/documentation.html
+++ b/src/axiomwebsite/documentation.html
@@ 601,6 +601,10 @@ Bryan Cantrill  Oral Tradition in Software Engineering [Cant16]
Illiterate Programming by Gilad Bracha
+
+Literate Programming by Gilad Bracha
+
+
Once a program has been developed and the developers have moved
diff git a/src/axiomwebsite/patches.html b/src/axiomwebsite/patches.html
index 3f867f9..8536c22 100644
 a/src/axiomwebsite/patches.html
+++ b/src/axiomwebsite/patches.html
@@ 5746,6 +5746,8 @@ bookvolbib reference for proofs
bookvolbib reference for Cylindrical Algebraic Decomposition
20170528.01.tpd.patch
bookvolbib reference for Cylindrical Algebraic Decomposition
+20170528.02.tpd.patch
+src/axiomwebsite/documentation.html Literate Programming talk

1.7.5.4