From 275a1288ad24d9b5227234a289bb83547a811c3d Mon Sep 17 00:00:00 2001
From: Tim Daly
Date: Sun, 5 Mar 2017 00:39:54 0500
Subject: [PATCH] readme add Andreas Weber to credits
Goal: Axiom Maintenance

books/bookheader.tex  20 +
books/bookvol10.4.pamphlet  20 +
books/bookvol5.pamphlet  20 +
changelog  6 +
patch  434 +
readme  22 +
src/axiomwebsite/patches.html  2 +
src/input/unittest1.input.pamphlet  20 +
8 files changed, 62 insertions(+), 482 deletions()
diff git a/books/bookheader.tex b/books/bookheader.tex
index 61ebd1a..cd06370 100644
 a/books/bookheader.tex
+++ b/books/bookheader.tex
@@ 190,16 +190,16 @@ Balbir Thomas & Mike Thomas & Dylan Thurston\\
Francoise Tisseur & Steve Toleque & Raymond Toy\\
Barry Trager & Themos T. Tsikas & Gregory Vanuxem\\
Kresimir Veselic & Christof Voemel & Bernhard Wall\\
Stephen Watt & Jaap Weel & Juergen Weiss\\
M. Weller & Mark Wegman & James Wen\\
Thorsten Werther & Michael Wester & R. Clint Whaley\\
James T. Wheeler & John M. Wiley & Berhard Will\\
Clifton J. Williamson & Stephen Wilson & Shmuel Winograd\\
Robert Wisbauer & Sandra Wityak & Waldemar Wiwianka\\
Knut Wolf & Yanyang Xiao & Liu Xiaojun\\
Clifford Yapp & David Yun & Qian Yun\\
Vadim Zhytnikov & Richard Zippel & Evelyn Zoernack\\
Bruno Zuercher & Dan Zwillinger\\
+Stephen Watt & Andreas Weber & Jaap Weel\\
+Juergen Weiss & M. Weller & Mark Wegman\\
+James Wen & Thorsten Werther & Michael Wester\\
+R. Clint Whaley & James T. Wheeler & John M. Wiley\\
+Berhard Will & Clifton J. Williamson & Stephen Wilson\\
+Shmuel Winograd & Robert Wisbauer & Sandra Wityak\\
+Waldemar Wiwianka & Knut Wolf & Yanyang Xiao\\
+Liu Xiaojun & Clifford Yapp & David Yun\\
+Qian Yun & Vadim Zhytnikov & Richard Zippel\\
+Evelyn Zoernack & Bruno Zuercher & Dan Zwillinger\\
\end{tabular}
\newpage
diff git a/books/bookvol10.4.pamphlet b/books/bookvol10.4.pamphlet
index e016ae9..4c69dd1 100644
 a/books/bookvol10.4.pamphlet
+++ b/books/bookvol10.4.pamphlet
@@ 6932,16 +6932,16 @@ credits()
RFrancoise Tisseur Steve Toleque Raymond Toy
RBarry Trager Themos T. Tsikas Gregory Vanuxem
RKresimir Veselic Christof Voemel Bernhard Wall
RStephen Watt Jaap Weel Juergen Weiss
RM. Weller Mark Wegman James Wen
RThorsten Werther Michael Wester R. Clint Whaley
RJames T. Wheeler John M. Wiley Berhard Will
RClifton J. Williamson Stephen Wilson Shmuel Winograd
RRobert Wisbauer Sandra Wityak Waldemar Wiwianka
RKnut Wolf Yanyang Xiao Liu Xiaojun
RClifford Yapp David Yun Qian Yun
RVadim Zhytnikov Richard Zippel Evelyn Zoernack
RBruno Zuercher Dan Zwillinger
+RStephen Watt Andreas Weber Jaap Weel
+RJuergen Weiss M. Weller Mark Wegman
+RJames Wen Thorsten Werther Michael Wester
+RR. Clint Whaley James T. Wheeler John M. Wiley
+RBerhard Will Clifton J. Williamson Stephen Wilson
+RShmuel Winograd Robert Wisbauer Sandra Wityak
+RWaldemar Wiwianka Knut Wolf Yanyang Xiao
+RLiu Xiaojun Clifford Yapp David Yun
+RQian Yun Vadim Zhytnikov Richard Zippel
+REvelyn Zoernack Bruno Zuercher Dan Zwillinger
R Type: Void
E 3
diff git a/books/bookvol5.pamphlet b/books/bookvol5.pamphlet
index 55b8445..19d1d7f 100644
 a/books/bookvol5.pamphlet
+++ b/books/bookvol5.pamphlet
@@ 8092,16 +8092,16 @@ of effort. We would like to acknowledge and thank the following people:
"Francoise Tisseur Steve Toleque Raymond Toy"
"Barry Trager Themos T. Tsikas Gregory Vanuxem"
"Kresimir Veselic Christof Voemel Bernhard Wall"
"Stephen Watt Jaap Weel Juergen Weiss"
"M. Weller Mark Wegman James Wen"
"Thorsten Werther Michael Wester R. Clint Whaley"
"James T. Wheeler John M. Wiley Berhard Will"
"Clifton J. Williamson Stephen Wilson Shmuel Winograd"
"Robert Wisbauer Sandra Wityak Waldemar Wiwianka"
"Knut Wolf Yanyang Xiao Liu Xiaojun"
"Clifford Yapp David Yun Qian Yun"
"Vadim Zhytnikov Richard Zippel Evelyn Zoernack"
"Bruno Zuercher Dan Zwillinger"
+"Stephen Watt Andreas Weber Jaap Weel"
+"Juergen Weiss M. Weller Mark Wegman"
+"James Wen Thorsten Werther Michael Wester"
+"R. Clint Whaley James T. Wheeler John M. Wiley"
+"Berhard Will Clifton J. Williamson Stephen Wilson"
+"Shmuel Winograd Robert Wisbauer Sandra Wityak"
+"Waldemar Wiwianka Knut Wolf Yanyang Xiao"
+"Liu Xiaojun Clifford Yapp David Yun"
+"Qian Yun Vadim Zhytnikov Richard Zippel"
+"Evelyn Zoernack Bruno Zuercher Dan Zwillinger"
))
\end{chunk}
diff git a/changelog b/changelog
index 32b1f93..198d706 100644
 a/changelog
+++ b/changelog
@@ 1,3 +1,9 @@
+20170305 tpd src/axiomwebsite/patches.html 20170305.01.tpd.patch
+20170305 tpd books/bookheader.tex add Andreas Weber to credits
+20170305 tpd books/bookvol10.4.pamphlet add Andreas Weber to credits
+20170305 tpd books/bookvol5.pamphlet add Andreas Weber to credits
+20170305 tpd readme add Andreas Weber to credits
+20170305 tpd src/input/unittest1.input.pamphlet add Andreas Weber to credits
20170303 tpd src/axiomwebsite/patches.html 20170303.01.tpd.patch
20170303 tpd books/bookvolbib add additional references
20170220 tpd src/axiomwebsite/patches.html 20170220.01.tpd.patch
diff git a/patch b/patch
index 0c73e78..01c75b8 100644
 a/patch
+++ b/patch
@@ 1,433 +1,3 @@
books/bookvolbib add additional references
+readme add Andreas Weber to credits
Goal: Proving Axiom Correct

\index{Sterling, Jonathan}
\index{Harper, Robert}
\begin{chunk}{axiom.bib}
@misc{Ster17,
 author = "Sterling, Jonathan and Harper, Robert",
 title = "Algebraic Foundations of Proof Refinement",
 link = "\url{http://www.cs.cmu.edu/~rwh/papers/afpr/afpr.pdf}",
 year = "2017",
 abstract =
 "We contribute a general apparatus for {\sl dependent} tacticbased
 proof refinement in the LCF tradition, in which the statements of
 subgoals may express a dependency on the proofs of other subgoals;
 this form of dependency is extremely useful and can serve as an
 {\sl algorithmic} alternative to extensions of LCF based on nonlocal
 instantiation of schematic variables. Additionally, we introduce a
 novel behavioral distinction between {\sl refinement rules} and
 {\sl tactics} based on naturality. Our framework, called Dependent
 LCF, is already deployed in the nascent RedPRL proof assistant for
 computational cubical type theory.",
 paper = "Ster17.pdf"
}

\end{chunk}

\index{Plotkin, G.D.}
\begin{chunk}{axiom.bib}
@article{Plot77,
 author = "Plotkin, G.D.",
 title = "LCF Considered as a Programming Language",
 journal = "Theoretical Computer Science",
 volume = "5",
 year = "1977",
 pages = "223255",
 link = "\url{http://homepages.inf.ed.ac.uk/gdp/publications/LCF.pdf}",
 abstract =
 "The paper studies connections between denotational and operational
 semantics for a simple programming language based on LCF. It begins
 with the connection between the behaviour of a program and its
 denotation. It turns out that a program denotes $\bot$ in any of
 several possible semantics iff it does not terminate. From this it
 follows that if two terms hae the same denotation in one of these
 semantics, they have the same behaviour in all contexts. The converse
 fails for all the semantics. If, however, the language is extended to
 allow certain parallel facilities behavioural equivalence does coincide
 with denotational equivalence in one of the semantics considered, which
 may therefore be called ``fully abstract''. Next a connection is given
 which actually determines the semantics up to isomorphism from the
 behaviour alone. Conversely, by allowing further parallel facilities,
 every r.e. element of the fully abstract semantics becomes definable,
 thus characterising the programming language, up to interdefinability,
 from the set of r.e. elements of the domains of the semantics.",
 paper = "Plot77.pdf"
}

\end{chunk}

\index{Milner, Robin}
\begin{chunk}{axiom.bib}
@techreport{Miln72,
 author = "Milner, Robert",
 title = "Logic for Computable Functions: Description of a Machine
 Implementation",
 year = "1972",
 institution = "Stanford Artificial Intelligence Project",
 number = "STANCS72288",
 link =
 "\url{http://i.standford.edu/pub/cstr/reports/cs/tr/72/288/CSTR72288.pdf}",
 abstract =
 "LCF is based on a logic by Dana Scott, proposed by him at Oxford in the
 fall of 1969, for reasoning about computable functions.",
 paper = "Miln72.pdf"
}

\end{chunk}

\index{Gordon, Mike}
\begin{chunk}{axiom.bib}
@misc{Gord96,
 author = "Gordon, Mike",
 title = "From LCF to HOL: a short history",
 year = "1996",
 link = "\url{http://www.cl.cam.ac.uk/~mjcg/papers/HolHistory.pdf}",
 paper = "Gord96.pdf"
}

\end{chunk}

\index{Trostle, Anne}
\begin{chunk}{axiom.bib}
@misc{Tros13,
 author = "Trostle, Anne",
 title = "An Algorithm for the Greatest Common Divisor",
 link = "\url{http://www.nuprl.org/MathLibrary/gcd/}",
 year = "2013"
}

\end{chunk}

\index{Babovsky, Hans}
\index{Grabmeier, Johannes}
\begin{chunk}{axiom.bib}
@inproceedings{Babo16,
 author = "Babovsky, Hans and Grabmeier, Johannes",
 title = "Calculus and design of discrete velocity models using
 computer algebra",
 booktitle = "AIP Conference Proceedings",
 volume = "1786",
 isbn = "9780735414488",
 link = "\url{http://aip.scitation.org/doi/pdf/10.1063/1.4967672}",
 year = "2016",
 abstract =
 "In [2,3], a framework for a calculus with Discrete Velocity Models
 (DVM) has been derived. The rotational symmetry of the discrete
 velocities can be modelled algebraically by the action of the cyclic
 group $C_4$  or including reflections of the dihedral group $D_4$.
 Taking this point of view, the linearized collision operator can be
 represented in a compact form as a matrix of elements in the group
 algebra. Or in other words, by choosing a special numbering it
 exhibits a certain block structure which lets it appear as a matrix
 with entries in a certain polynomial ring. A convenient way for
 approaching such a structure is the use of a computer algebra system
 able to treat these (predefined) algebraic structures. We use the
 computer algebra system FriCAS/AXIOM [4,5] for the generation of the
 velocity and the collision sets and for the analysis of the structure
 of the collision operator. Concerning the fluid dynamic limit, the
 system provides the characterization of sets of collisions and their
 contribution to the flow parameters. It allows the design of
 rotationally invariant symmetric models for prescribed Prandtl
 numbers. The implementation in FriCAS/AXIOM is explained and its
 results for a 25velocity model are presented.",
 paper = "Babo16.pdf",
 keywords = "axiomref"
}

\end{chunk}

\index{Hebisch, Waldemer}
\begin{chunk}{axiom.bib}
@article{Hebi15,
 author = "Hebisch, Waldemer",
 title = "Integration in terms of exponential integrals and incomplete
 gamma functions",
 year = "2015",
 journal = "ACM Communications in Computer Algebra",
 volume = "49",
 Issue = "3",
 pages = "98100",
 abstract =
 "Indefinite integration means that given $f$ in some set we want to
 find $g$ from possibly larger set such that $f = g^\prime$. When $f$
 and $g$ are required to be elementary functions due to work of among
 others Risch, Rothstein, Trager, Bronstein (see [1] for references)
 integration problem is now solved at least in theory. In his thesis
 Cherry gave algorithm to integrate transcendental elementary functions
 in terms of exponential integrals. In [2] he gave algorithm to
 integrate transcendental elementary functions in so called reduced
 fields in terms of error functions. Knowles [3] and [4] extended this
 allowing also liovillian integrands and weakened restrictions on the
 field containing integrands. We extend previous results allowing
 incomplete gamma function $\Gamma(a, x)$ with rational $a$. Also, our
 theory can handle algebraic extensions and is complete jointly (and
 not only separately for Ei and erf). In purely transcendental case our
 method should be more efficient and easier to implement than [2]. In
 fact, it seems that no system currently implements algorithm from [2],
 while partial implementation of our method in FriCAS works well enough
 to be turned on by default. With our approach nonreduced case from
 [2] can be handled easily. We hope that other classes of special
 functions can be handled in a similar way, in particular irrational
 case of incomplete gamma function and polylogarithms (however
 polylogarithms raise tricky theoretical questions)."
}

\end{chunk}

\index{Knowles, Paul}
\begin{chunk}{axiom.bib}
@article{Know93,
 author = "Knowles, Paul",
 title = "Integration of a Class of Transcendental Liouvillian Functions
 with ErrorFunctions, Part I",
 journal = "Journal of Symbolic Computation",
 volume = "13",
 number = "5",
 pages = "525543",
 year = "1993",
 abstract =
 "This paper gives a decisionprocedure for the symbolic integration of
 a certain class of transcendental Liouvillian functions in terms of
 elementary functions and errorfunctions. An example illustrating the
 use of the decisionprocedure is given.",
 paper = "Know93.pdf"
}

\end{chunk}

\index{Knowles, Paul}
\begin{chunk}{axiom.bib}
@article{Know93a,
 author = "Knowles, Paul",
 title = "Integration of a Class of Transcendental Liouvillian Functions
 with ErrorFunctions, Part II",
 journal = "Journal of Symbolic Computation",
 volume = "16",
 number = "3",
 year = "1993",
 pages = "227239",
 abstract =
 "This paper extends the decision procedure for the symbolic
 integration of a certain class of transcendental Liouvillian functions
 in terms of elementary functions and errorfunctions given in Knowles
 (1992) to allow a much larger class of integrands. Examples
 illustrating the use of the decision procedure are given.",
 paper = "Know93a.pdf"
}

\end{chunk}

\index{Cherry, G.W.}
\begin{chunk}{axiom.bib}
@article{Cher85,
 author = "Cherry, G.W.",
 title = "Integration in Finite Terms with Special Functions:
 The Error Function",
 journal = "J. Symbolic Computation",
 year = "1985",
 volume = "1",
 pages = "283302",
 abstract =
 "A decision procedure for integrating a class of transcendental
 elementary functions in terms of elementary functions and error
 functions is described. The procedure consists of three mutually
 exclusive cases. In the first two cases a generalised procedure for
 completing squares is used to limit the error functions which can
 appear in the integral of a finite number. This reduces the problem
 to the solution of a differential equation and we use a result of
 Risch (1969) to solve it. The third case can be reduced to the
 determination of what we have termed $\sum$decompositions. The resutl
 presented here is the key procuedure to a more general algorithm which
 is described fully in Cherry (1983).",
 paper = "Cher85.pdf"
}

\end{chunk}

\index{Lisonek, Petr}
\index{Paule, Peter},
\index{Strehl, Volker}
\begin{chunk}{axiom.bib}
@article{Liso93,
 author = "Lisonek, Petr and Paule, Peter and Strehl, Volker",
 title = "Improvement of the Degree Setting in Gosper's Algorithm",
 journal = "J. Symbolic Computation",
 volume = "16",
 year = "1993",
 pages = "243258",
 link =
 "\url{http://www.sciencedirect.com/science/article/pii/S0747717183710436}",
 abstract =
 "A detailed study of the degree setting for Gosper's algorithm for
 indefinite hypergeometric summation is presented. In particular, we
 discriminate between rational and proper hypergeometric input. As a
 result, the critical degree bound can be improved in the former case.",
 paper = "Liso93.pdf"
}

\end{chunk}

\index{Man, YiuKwong}
\begin{chunk}{axiom.bib}
@article{Manx93,
 author = "Man, YiuKwong",
 title = "On Computing Closed Forms for Indefinite Summations",
 journal = "J. Symbolic Computation",
 volume = "16",
 pages = "335376",
 year = "1993",
 link =
 "\url{http://www.sciencedirect.com/science/article/pii/S0747717183710539}",
 abstract =
 "A decision procedure for finding closed forms for indefinite
 summation of polynomials, rational functions, quasipolynomials and
 quasirational functions is presented. It is also extended to deal with
 some nonhypergeometric sums with rational inputs, which are not
 summable by means of Gosper's algorithm. Discussion of its
 implementation, analysis of degree bounds and some illustrative
 examples are included.",
 paper = "Manx93.pdf"
}

\end{chunk}

\index{Paule, Peter}
\begin{chunk}{axiom.bib}
@article{Paul95,
 author = "Paule, Peter",
 title = "Greatest Factorial Factorization and Symbolic Summation",
 journal = "Journal of Symbolic Computation",
 year = "1995",
 volume = "20",
 pages = "235268",
 link =
 "\url{http://www.sciencedirect.com/science/article/pii/S0747717185710498}",
 abstract =
 "The greatest factorial factorization (GFF) of a polynomial provides
 an analogue to squarefree factorization but with respect to integer
 shifts instead to multiplicities. We illustrate the fundamental role
 of that concept in the context of symbolic summation. Besides a
 detailed discussion of the basic GFF notions we present a new approach
 to the indefinite rational summation problem as well as to Gosper's
 algorithm for summing hypergeometric sequences.",
 paper = "Paul95.pdf"
}

\end{chunk}

\index{Petkovsek, Marko}
\begin{chunk}{axiom.bib}
@article{Petk92,
 author = "Petkovsek, Marko",
 title = "Hypergeometric solutions of linear recurrences with
 polynomial coefficients",
 journal = "J. Symbolic Computation",
 volume = "14",
 pages = "243264",
 year = "1992",
 link =
 "\url{http://www.sciencedirect.com/science/article/pii/0747717192900386}",
 abstract =
 "We describe algorithm Hyper which can be used to find all
 hypergeometric solutions of linear recurrences with polynomial
 coefficients.",
 paper = "Petk92.pdf"
}

\end{chunk}

\index{Grabm\"uller, Martin}
\begin{chunk}{axiom.bib}
@misc{Grab17,
 author = {Grabm\"uller, Martin},
 title = "Algorithm W",
 year = "2017",
 link = "\url{https://github.com/mgrabmueller/AlgorithmW}",
 abstract =
 "In this paper we develop a complete implementation of Algorithm W for
 HindleyMilner polyhmorphic type inference in Haskell",
 paper = "Grab17.pdf"
}
\end{chunk}

\index{Heeren, Bastiaan}
\index{Hage, Jurriaan},
\index{Swierstra, Doaitse}
\begin{chunk}{axiom.bib}
@misc{Heer02,
 author = "Heeren, Bastiaan and Hage, Jurriaan and Swierstra, Doaitse",
 title = "Generalizing HindleyMilner Type Inference Algorithms",
 year = "2002",
 link = "\url{https://pdfs.semanticscholar.org/8983/233b3dff2c5b94efb31235f62bddc22dc899.pdf}",
 abstract =
 "Type inferencing according to the standard algorithms $W$ and $M$
 often yields uninformative error messages. Many times, this is a
 consequence of a bias inherent in the algorithms. The method
 developed here is to first collect constraints from the program, and
 to solve these afterwards, possibly under the influence of a
 heuristic. We show the soundness and completeness of our algorithm.
 The algorithms $W$ and $M$ turn out to be deterministic instances of our
 method, giving the correctness for $W$ and $M$ with respect to the
 HindleyMilner typing rules for free. We also show that our algorithm
 is more flexible, because it naturally allows the generation of
 multiple messages",
 paper = "Heer02.pdf"
}

\end{chunk}

\index{Milner, Robin}
\begin{chunk}{axiom.bib}
@article{Miln78,
 author = "Milner, Robin",
 title = "A Theory of Type Polymorphism in Programming",
 year = "1978",
 journal = "Journal of Computer and System Sciences",
 volume = "17",
 pages = "348375",
 link = "\url{https://courses.engr.illinois.edu/cs421/sp2013/project/milnerpolymorphism.pdf}",
 abstract =
 "The aim of this work is largely a practical one. A widely employed
 style of programming, particularly in structureprocessing languages
 which impose no discipline of types, entails defining procedures which
 work well on objects of a wide variety. We present a formal type
 discipline for such polymorphic procedures in the context of a simple
 programming language, and a compile time typechecking algorithm $W$
 which enforces the discipline. A Semantic Soundness Theorem (based on
 a formal semantics for the language) states that welltype programs
 cannot “go wrong” and a Syntactic Soundness Theorem states that if $W$
 accepts a program then it is well typed. We also discuss extending
 these results to richer languages; a typechecking algorithm based on
 $W$ is in fact already implemented and working, for the metalanguage ML
 in the Edinburgh LCF system,",
 paper = "Miln78.pdf"
}

\end{chunk}

\index{Wadler, Philip}
\index{Blott, Stephen}
\begin{chunk}{axiom.bib}
@inproceedings{Wadl88,
 author = "Wadler, Philip and Blott, Stephen",
 title = "How to make adhoc polymorphism less ad hoc",
 booktitle = "Proc 16th ACM SIGPLANSIGACT Symp. on Princ. of Prog. Lang",
 isbn = "0897912942",
 pages = "6076",
 year = "1988",
 link = "\url{http://202.3.77.10/users/karkare/courses/2010/cs653/Papers/adhocpolymorphism.pdf}",
 abstract =
 "This paper presents {\sl type classes}, a new approach to {\sl adhoc}
 polymorphism. Type classes permit overloading of arithmetic operators
 such as multiplication, and generalise the ``eqtype variables'' of
 Standard ML Type classes extend the Hindley/Milner polymorphic type
 system, and provide a new approach to issues that arise in objectoriented
 programming, bounded type quantification, and abstract data types. This
 paper provides an informal introduction to type classes, and defines them
 formally by means of type inference rules",
 paper = "Wadl88.pdf"
}

\end{chunk}
+Goal: Axiom Maintenance
diff git a/readme b/readme
index d5ea2c9..3d49961 100644
 a/readme
+++ b/readme
@@ 303,16 +303,18 @@ at the axiom command prompt will prettyprint the list.
"Francoise Tisseur Steve Toleque Raymond Toy"
"Barry Trager Themos T. Tsikas Gregory Vanuxem"
"Kresimir Veselic Christof Voemel Bernhard Wall"
"Stephen Watt Jaap Weel Juergen Weiss"
"M. Weller Mark Wegman James Wen"
"Thorsten Werther Michael Wester R. Clint Whaley"
"James T. Wheeler John M. Wiley Berhard Will"
"Clifton J. Williamson Stephen Wilson Shmuel Winograd"
"Robert Wisbauer Sandra Wityak Waldemar Wiwianka"
"Knut Wolf Yanyang Xiao Liu Xiaojun"
"Clifford Yapp David Yun Qian Yun"
"Vadim Zhytnikov Richard Zippel Evelyn Zoernack"
"Bruno Zuercher Dan Zwillinger"
+"Stephen Watt Andreas Weber Jaap Weel"
+"Juergen Weiss M. Weller Mark Wegman"
+"James Wen Thorsten Werther Michael Wester"
+"R. Clint Whaley James T. Wheeler John M. Wiley"
+"Berhard Will Clifton J. Williamson Stephen Wilson"
+"Shmuel Winograd Robert Wisbauer Sandra Wityak"
+"Waldemar Wiwianka Knut Wolf Yanyang Xiao"
+"Liu Xiaojun Clifford Yapp David Yun"
+"Qian Yun Vadim Zhytnikov Richard Zippel"
+"Evelyn Zoernack Bruno Zuercher Dan Zwillinger"
+
+
Pervasive Literate Programming
I think David Diamond said it best (Datamation, June 1976, pg 134):
diff git a/src/axiomwebsite/patches.html b/src/axiomwebsite/patches.html
index 0709331..6f7690d 100644
 a/src/axiomwebsite/patches.html
+++ b/src/axiomwebsite/patches.html
@@ 5664,6 +5664,8 @@ books/bookvol13 add Binary Power in COQ chapter
books/bookvolbib add additional references
20170303.01.tpd.patch
books/bookvolbib add additional references
+20170305.01.tpd.patch
+readme add Andreas Weber to credits
diff git a/src/input/unittest1.input.pamphlet b/src/input/unittest1.input.pamphlet
index e0e713b..100ff4c 100644
 a/src/input/unittest1.input.pamphlet
+++ b/src/input/unittest1.input.pamphlet
@@ 280,16 +280,16 @@ Unit test the user level commands
RFrancoise Tisseur Steve Toleque Raymond Toy
RBarry Trager Themos T. Tsikas Gregory Vanuxem
RKresimir Veselic Christof Voemel Bernhard Wall
RStephen Watt Jaap Weel Juergen Weiss
RM. Weller Mark Wegman James Wen
RThorsten Werther Michael Wester R. Clint Whaley
RJames T. Wheeler John M. Wiley Berhard Will
RClifton J. Williamson Stephen Wilson Shmuel Winograd
RRobert Wisbauer Sandra Wityak Waldemar Wiwianka
RKnut Wolf Yanyang Xiao Liu Xiaojun
RClifford Yapp David Yun Qian Yun
RVadim Zhytnikov Richard Zippel Evelyn Zoernack
RBruno Zuercher Dan Zwillinger
+RStephen Watt Andreas Weber Jaap Weel
+RJuergen Weiss M. Weller Mark Wegman
+RJames Wen Thorsten Werther Michael Wester
+RR. Clint Whaley James T. Wheeler John M. Wiley
+RBerhard Will Clifton J. Williamson Stephen Wilson
+RShmuel Winograd Robert Wisbauer Sandra Wityak
+RWaldemar Wiwianka Knut Wolf Yanyang Xiao
+RLiu Xiaojun Clifford Yapp David Yun
+RQian Yun Vadim Zhytnikov Richard Zippel
+REvelyn Zoernack Bruno Zuercher Dan Zwillinger
E 28
S 29 of 97

1.7.5.4