updated links in the manual

doc/avram.info

@@ -22,232 +22,235 @@ translation approved by the Free Software Foundation.
 
 Indirect:
 avram.info-1: 883
-avram.info-2: 292821
+avram.info-2: 292875
 
 Tag Table:
 (Indirect)
 Node: Top883
 Node: Preface1723
-Node: User Manual7742
-Node: General Options9950
-Node: Modes of Operation12724
-Node: Filter Mode13401
-Node: Parameter Mode15103
-Node: Filter Mode Options17381
-Node: Parameter Mode Options20284
-Node: Command Line Syntax25305
-Node: Diagnostics28805
-Node: Internal Errors30181
-Node: i/o Errors31456
-Node: Overflow Errors32933
-Node: File Format Errors34332
-Node: Application Programming Errors36733
-Node: Configuration Related Errors37697
-Node: Other Diagnostics and Warnings41104
-Node: Security42238
-Node: Example Script44776
-Node: Files46969
-Node: Environment47557
-Node: Bugs49650
-Node: Virtual Machine Specification51434
-Node: Raw Material52586
-Node: Concrete Syntax58053
-Node: Bit String Encoding59534
-Node: Blocking62124
-Node: File Format63166
-Node: Preamble Section64713
-Node: Data Section65267
-Node: Representation of Numeric and Textual Data65821
-Node: Filter Mode Interface68981
-Node: Loading All of Standard Input at Once69850
-Node: Standard Input Representation70735
-Node: Standard Output Representation74072
-Node: Line Maps76477
-Node: Byte Transducers77255
-Node: Parameter Mode Interface79513
-Node: Input Data Structure80229
-Node: Input for Mapped Applications84744
-Node: Output From Non-interactive Applications88695
-Node: Output From Interactive Applications90335
-Node: Line Oriented Interaction92218
-Node: Character Oriented Interaction98329
-Node: Mixed Modes of Interaction100358
-Node: Virtual Code Semantics102384
-Node: A New Operator103736
-Node: On Equality104692
-Node: A Minimal Set of Properties106878
-Node: A Simple Lisp Like Language109805
-Ref: A Simple Lisp Like Language-Footnote-1110678
-Node: Syntax110966
-Node: Semantics112016
-Node: Standard Library113356
-Node: How `avram' Thinks114809
-Node: Variable Freedom119296
-Node: Metrics and Maintenance122740
-Node: Version123223
-Node: Note124247
-Node: Profile125340
-Node: Weight126601
-Node: Deconstruction128150
-Node: Field128681
-Node: Fan130621
-Node: Recursion131289
-Node: Recur131842
-Node: Refer132794
-Node: Assignment134282
-Node: Predicates138756
-Node: Compare139377
-Node: Member140363
-Node: Iteration141404
-Node: List Combinators142970
-Node: Map143693
-Node: Filter144480
-Node: Reduce145438
-Node: Sort149524
-Node: Transfer151990
-Node: Mapcur156478
-Node: List Functions156949
-Node: Cat157490
-Node: Reverse158013
-Node: Distribute158563
-Node: Transpose159317
-Node: Exception Handling160256
-Node: A Hierarchy of Sets161363
-Node: Operator Generalization163404
-Node: Error Messages166701
-Node: Expedient Error Messages170230
-Node: Computable Error Messages172014
-Node: Exception Handler Usage175243
-Node: Interfaces to External Code179016
-Node: Library combinator180740
-Node: Have combinator182798
-Ref: Have combinator-Footnote-1185940
-Node: Interaction combinator186129
-Node: Vacant Address Space191464
-Node: Library Reference195383
-Node: Lists198628
-Node: Simple Operations199720
-Node: Recoverable Operations209889
-Node: List Transformations212763
-Node: Type Conversions217666
-Node: Primitive types219851
-Node: One dimensional arrays223396
-Node: Two dimensional arrays226747
-Node: Related utility functions238096
-Node: Comparison242842
-Node: Deconstruction Functions246313
-Node: Indirection248282
-Node: The Universal Function254928
-Node: Characters and Strings257207
-Node: File Manipulation266762
-Node: File Names267343
-Node: Raw Files272219
-Node: Formatted Input276058
-Node: Formatted Output282978
-Node: Invocation292369
-Node: Command Line Parsing292821
-Node: Execution Modes300985
-Node: Version Management305554
-Node: Error Reporting309671
-Node: Profiling313916
-Node: Emulation Primitives319226
-Node: Lists of Pairs of Ports320411
-Node: Ports and Packets322734
-Ref: Ports and Packets-Footnote-1329033
-Node: Instruction Stacks329225
-Node: External Library Maintenance336953
-Node: Calling existing library functions337801
-Node: Implementing new library functions341120
-Node: Working around library misfeatures348331
-Node: Inept excess verbiage349255
-Node: Memory leaks352322
-Node: Suicidal exception handling360710
-Node: Character Table367402
-Node: Reference Implementations382385
-Node: Pairwise383563
-Node: Insert384892
-Node: Replace386550
-Node: Transition388663
-Node: Changes390116
-Node: External Libraries390613
-Node: bes393722
-Node: Bessel function calling conventions394265
-Node: Bessel function errors396827
-Node: complex397273
-Node: fftw399314
-Node: glpk401328
-Node: glpk input parameters402267
-Node: glpk output404099
-Node: glpk errors404781
-Node: Additional glpk notes405393
-Node: gsldif405944
-Node: gsldif input parameters406463
-Node: gsldif output407289
-Node: gsldif exceptions407929
-Node: Additional gsldif notes408308
-Node: gslevu409049
-Node: gslevu calling conventions409818
-Node: gslevu exceptions410408
-Node: gslint410929
-Node: gslint input parameters411407
-Node: gslint output413314
-Node: gslint exceptions414270
-Node: Additional gslint notes415025
-Node: harminv416351
-Node: harminv input parameters416912
-Node: harminv output417975
-Node: harminv exceptions419181
-Node: Additional harminv notes420495
-Node: kinsol421404
-Node: kinsol input parameters422848
-Node: kinsol output425624
-Node: kinsol exceptions426566
-Node: Additional kinsol notes427451
-Node: lapack429636
-Node: lapack calling conventions430453
-Node: lapack exceptions436278
-Node: Additional lapack notes436983
-Node: math438733
-Node: math library operators439511
-Node: math library predicates440538
-Node: math library conversion functions441248
-Node: math library exceptions442204
-Node: Additional math library notes443290
-Node: mtwist444162
-Node: mtwist calling conventions445170
-Node: mtwist exceptions448323
-Node: Additional mtwist notes449240
-Node: minpack451178
-Node: minpack calling conventions451698
-Node: minpack exceptions452936
-Node: Additional minpack notes453614
-Node: mpfr455380
-Node: mpfr binary operators457087
-Node: mpfr unary operators458347
-Node: mpfr binary operators with a natural operand459435
-Node: mpfr binary predicates460887
-Node: mpfr unary predicates461760
-Node: mpfr constants462193
-Node: mpfr functions with miscellaneous calling conventions463090
-Ref: mpfr functions with miscellaneous calling conventions-Footnote-1464395
-Node: mpfr conversion functions464548
-Node: mpfr exceptions466562
-Node: Additional mpfr notes467267
-Node: lpsolve468121
-Node: lpsolve calling conventions468639
-Node: lpsolve return values470090
-Node: lpsolve errors470553
-Node: rmath470927
-Node: rmath statistical functions471700
-Node: rmath miscellaneous functions475372
-Node: rmath exceptions476205
-Node: umf476578
-Node: umf input parameters478320
-Node: umf output481112
-Node: umf exceptions481765
-Node: Additional umf notes482792
-Node: Copying483454
-Node: Function Index502593
-Node: Concept Index518168
+Node: User Manual7736
+Node: General Options9944
+Node: Modes of Operation12718
+Node: Filter Mode13395
+Node: Parameter Mode15097
+Node: Filter Mode Options17375
+Node: Parameter Mode Options20278
+Node: Command Line Syntax25299
+Node: Diagnostics28799
+Node: Internal Errors30175
+Node: i/o Errors31473
+Node: Overflow Errors32950
+Node: File Format Errors34349
+Node: Application Programming Errors36750
+Node: Configuration Related Errors37714
+Node: Other Diagnostics and Warnings41121
+Node: Security42255
+Node: Example Script44793
+Node: Files46986
+Node: Environment47574
+Node: Bugs49667
+Node: Virtual Machine Specification51488
+Node: Raw Material52640
+Node: Concrete Syntax58107
+Node: Bit String Encoding59588
+Node: Blocking62178
+Node: File Format63220
+Node: Preamble Section64767
+Node: Data Section65321
+Node: Representation of Numeric and Textual Data65875
+Node: Filter Mode Interface69035
+Node: Loading All of Standard Input at Once69904
+Node: Standard Input Representation70789
+Node: Standard Output Representation74126
+Node: Line Maps76531
+Node: Byte Transducers77309
+Node: Parameter Mode Interface79567
+Node: Input Data Structure80283
+Node: Input for Mapped Applications84798
+Node: Output From Non-interactive Applications88749
+Node: Output From Interactive Applications90389
+Node: Line Oriented Interaction92272
+Node: Character Oriented Interaction98383
+Node: Mixed Modes of Interaction100412
+Node: Virtual Code Semantics102438
+Node: A New Operator103790
+Node: On Equality104746
+Node: A Minimal Set of Properties106932
+Node: A Simple Lisp Like Language109859
+Ref: A Simple Lisp Like Language-Footnote-1110732
+Node: Syntax111020
+Node: Semantics112070
+Node: Standard Library113410
+Node: How `avram' Thinks114863
+Node: Variable Freedom119350
+Node: Metrics and Maintenance122794
+Node: Version123277
+Node: Note124301
+Node: Profile125394
+Node: Weight126655
+Node: Deconstruction128204
+Node: Field128735
+Node: Fan130675
+Node: Recursion131343
+Node: Recur131896
+Node: Refer132848
+Node: Assignment134336
+Node: Predicates138810
+Node: Compare139431
+Node: Member140417
+Node: Iteration141458
+Node: List Combinators143024
+Node: Map143747
+Node: Filter144534
+Node: Reduce145492
+Node: Sort149578
+Node: Transfer152044
+Node: Mapcur156532
+Node: List Functions157003
+Node: Cat157544
+Node: Reverse158067
+Node: Distribute158617
+Node: Transpose159371
+Node: Exception Handling160310
+Node: A Hierarchy of Sets161417
+Node: Operator Generalization163458
+Node: Error Messages166755
+Node: Expedient Error Messages170284
+Node: Computable Error Messages172068
+Node: Exception Handler Usage175297
+Node: Interfaces to External Code179070
+Node: Library combinator180794
+Node: Have combinator182852
+Ref: Have combinator-Footnote-1185994
+Node: Interaction combinator186183
+Node: Vacant Address Space191518
+Node: Library Reference195437
+Node: Lists198682
+Node: Simple Operations199774
+Node: Recoverable Operations209943
+Node: List Transformations212817
+Node: Type Conversions217720
+Node: Primitive types219905
+Node: One dimensional arrays223450
+Node: Two dimensional arrays226801
+Node: Related utility functions238150
+Node: Comparison242896
+Node: Deconstruction Functions246367
+Node: Indirection248336
+Node: The Universal Function254982
+Node: Characters and Strings257261
+Node: File Manipulation266816
+Node: File Names267397
+Node: Raw Files272273
+Node: Formatted Input276112
+Node: Formatted Output283032
+Node: Invocation292423
+Node: Command Line Parsing292875
+Node: Execution Modes301039
+Node: Version Management305608
+Node: Error Reporting309725
+Node: Profiling313970
+Node: Emulation Primitives319280
+Node: Lists of Pairs of Ports320465
+Node: Ports and Packets322788
+Ref: Ports and Packets-Footnote-1329087
+Node: Instruction Stacks329279
+Node: External Library Maintenance337007
+Node: Calling existing library functions337855
+Node: Implementing new library functions341174
+Node: Working around library misfeatures348385
+Node: Inept excess verbiage349309
+Node: Memory leaks352376
+Node: Suicidal exception handling360764
+Node: Character Table367456
+Node: Reference Implementations382439
+Node: Pairwise383617
+Node: Insert384946
+Node: Replace386604
+Node: Transition388717
+Node: Changes390170
+Node: External Libraries390667
+Node: bes393776
+Node: Bessel function calling conventions394319
+Node: Bessel function errors396881
+Node: complex397327
+Node: fftw399368
+Node: glpk401382
+Node: glpk input parameters402321
+Node: glpk output404153
+Node: glpk errors404835
+Node: Additional glpk notes405447
+Node: gsldif405998
+Node: gsldif input parameters406517
+Node: gsldif output407343
+Node: gsldif exceptions407983
+Node: Additional gsldif notes408362
+Node: gslevu409103
+Node: gslevu calling conventions409872
+Node: gslevu exceptions410462
+Node: gslint410983
+Node: gslint input parameters411461
+Node: gslint output413368
+Node: gslint exceptions414324
+Node: Additional gslint notes415079
+Node: harminv416405
+Node: harminv input parameters416966
+Node: harminv output418029
+Node: harminv exceptions419235
+Node: Additional harminv notes420549
+Node: kinsol421458
+Node: kinsol input parameters422902
+Node: kinsol output425678
+Node: kinsol exceptions426620
+Node: Additional kinsol notes427505
+Node: lapack429690
+Node: lapack calling conventions430507
+Node: lapack exceptions436332
+Node: Additional lapack notes437037
+Node: math438787
+Node: math library operators439565
+Node: math library predicates440592
+Node: math library conversion functions441302
+Node: math library exceptions442258
+Node: Additional math library notes443344
+Node: mtwist444216
+Node: mtwist calling conventions445224
+Node: mtwist exceptions448377
+Node: Additional mtwist notes449294
+Node: minpack451232
+Node: minpack calling conventions451752
+Node: minpack exceptions452990
+Node: Additional minpack notes453668
+Node: mpfr455434
+Node: mpfr binary operators457141
+Node: mpfr unary operators458401
+Node: mpfr binary operators with a natural operand459489
+Node: mpfr binary predicates460941
+Node: mpfr unary predicates461814
+Node: mpfr constants462247
+Node: mpfr functions with miscellaneous calling conventions463144
+Ref: mpfr functions with miscellaneous calling conventions-Footnote-1464449
+Node: mpfr conversion functions464602
+Node: mpfr exceptions466616
+Node: Additional mpfr notes467321
+Node: lpsolve468175
+Node: lpsolve calling conventions468693
+Node: lpsolve return values470144
+Node: lpsolve errors470607
+Node: rmath470981
+Node: rmath statistical functions471754
+Node: rmath miscellaneous functions475426
+Node: rmath exceptions476259
+Node: umf476632
+Node: umf input parameters478374
+Node: umf output481166
+Node: umf exceptions481819
+Node: Additional umf notes482846
+Node: Copying483508
+Node: Preamble484029
+Node: Terms and Conditions486656
+Node: How to Apply500043
+Node: Function Index503060
+Node: Concept Index518635
 
 End Tag Table

doc/avram.info-1

@@ -66,11 +66,11 @@ for "Applicative ViRtuAl Machine".  Notable features are
 
         * `minpack'  (non-linear optimization)
 
-          `http://ftp.netlib.org/minpack'
+          `http://www.netlib.org/minpack'
 
         * `lapack'   (linear algebra)
 
-          `http://ftp.netlib.org/lapack'
+          `http://www.netlib.org/lapack'
 
         * `fftw'     (fast fourier transforms)
 
@@ -86,11 +86,11 @@ for "Applicative ViRtuAl Machine".  Notable features are
 
         * `glpk'     (linear programming by the simplex method)
 
-          `http://tech.groups.yahoo.com/group/lp_solve/'
+          `http://www.gnu.org/software/glpk'
 
         * `lpsolve'      (mixed integer linear programming)
 
-          `http://www.llnl.gov/CASC/sundials/'
+          `http://sourceforge.net/projects/lpsolve/'
 
         * `kinsol'   (constrained non-linear optimization)
 
@@ -698,9 +698,10 @@ two kinds.
      message indicates that some memory remains unaccounted for.
 
    If a repeatable internal error is discovered, please email a bug
-report and a small representative test case to the author at
-<[email protected]>. Include the version number of
-`avram', which you can get by running `avram --version'.
+report and a small representative test case to
+<[email protected]> or file an issue on the Avram github page.
+Include the version number of `avram', which you can get by running
+`avram --version'.
 
 
 File: avram.info,  Node: i/o Errors,  Next: Overflow Errors,  Prev: Internal Errors,  Up: Diagnostics
@@ -1133,7 +1134,8 @@ observed on some systems including Irix and 2.4 series Linux kernels
 that the `avram' process is killed automatically for attempting to
 allocate too much memory rather than given the chance to recover.
 
-   Please send bug reports to <[email protected]>.
+   Please send bug reports to <[email protected]> or file an
+issue on the Avram github page.
 
 
 File: avram.info,  Node: Virtual Machine Specification,  Next: Library Reference,  Prev: User Manual,  Up: Top

doc/avram.info-2

@@ -4601,8 +4601,8 @@ future.
 
 File: avram.info,  Node: Copying,  Next: Function Index,  Prev: External Libraries,  Up: Top
 
-GNU GENERAL PUBLIC LICENSE
-**************************
+Appendix E GNU GENERAL PUBLIC LICENCE
+*************************************
 
                          Version 2, June 1991
 
@@ -4612,6 +4612,15 @@ GNU GENERAL PUBLIC LICENSE
      Everyone is permitted to copy and distribute verbatim copies
      of this license document, but changing it is not allowed.
 
+* Menu:
+
+* Preamble::
+* Terms and Conditions::
+* How to Apply::
+
+
+File: avram.info,  Node: Preamble,  Next: Terms and Conditions,  Up: Copying
+
 Preamble
 ========
 
@@ -4663,7 +4672,12 @@ patent must be licensed for everyone's free use or not licensed at all.
    The precise terms and conditions for copying, distribution and
 modification follow.
 
-    TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+File: avram.info,  Node: Terms and Conditions,  Next: How to Apply,  Prev: Preamble,  Up: Copying
+
+TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+===============================================================
+
   1. This License applies to any program or other work which contains a
      notice placed by the copyright holder saying it may be distributed
      under the terms of this General Public License.  The "Program",
@@ -4893,6 +4907,9 @@ modification follow.
      ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
 
                       END OF TERMS AND CONDITIONS
+
+File: avram.info,  Node: How to Apply,  Prev: Terms and Conditions,  Up: Copying
+
 How to Apply These Terms to Your New Programs
 =============================================
 

doc/avram.ps

@@ -1,18 +1,18 @@
 %!PS-Adobe-2.0
-%%Creator: dvips(k) 5.98 Copyright 2009 Radical Eye Software
+%%Creator: dvips(k) 5.992 Copyright 2012 Radical Eye Software
 %%Title: avram.dvi
-%%CreationDate: Fri Sep  2 20:43:48 2011
+%%CreationDate: Wed Oct 31 02:45:49 2012
 %%Pages: 191
 %%PageOrder: Ascend
-%%BoundingBox: 0 0 596 842
+%%BoundingBox: 0 0 612 792
 %%DocumentFonts: CMBX12 CMR10 CMSY10 CMR12 CMBXTI10 CMTI10 CMTT10
 %%+ CMSLTT10 CMSL10 CMR7 CMTT12 CMBX10 CMSS10 CMB10 CMTT9 CMTI9 CMR9
-%%DocumentPaperSizes: a4
+%%DocumentPaperSizes: Letter
 %%EndComments
 %DVIPSWebPage: (www.radicaleye.com)
-%DVIPSCommandLine: dvips -o avram.ps avram.dvi
+%DVIPSCommandLine: dvips avram.dvi
 %DVIPSParameters: dpi=600
-%DVIPSSource:  TeX output 2011.09.02:2043
+%DVIPSSource:  TeX output 2012.10.31:0245
 %%BeginProcSet: tex.pro 0 0
 %!
 /TeXDict 300 dict def TeXDict begin/N{def}def/B{bind def}N/S{exch}N/X{S
@@ -44,19 +44,21 @@ SI restore userdict/eop-hook known{eop-hook}if showpage}N/@start{
 userdict/start-hook known{start-hook}if pop/VResolution X/Resolution X
 1000 div/DVImag X/IEn 256 array N 2 string 0 1 255{IEn S A 360 add 36 4
 index cvrs cvn put}for pop 65781.76 div/vsize X 65781.76 div/hsize X}N
-/p{show}N/RMat[1 0 0 -1 0 0]N/BDot 260 string N/Rx 0 N/Ry 0 N/V{}B/RV/v{
-/Ry X/Rx X V}B statusdict begin/product where{pop false[(Display)(NeXT)
-(LaserWriter 16/600)]{A length product length le{A length product exch 0
-exch getinterval eq{pop true exit}if}{pop}ifelse}forall}{false}ifelse
-end{{gsave TR -.1 .1 TR 1 1 scale Rx Ry false RMat{BDot}imagemask
-grestore}}{{gsave TR -.1 .1 TR Rx Ry scale 1 1 false RMat{BDot}
-imagemask grestore}}ifelse B/QV{gsave newpath transform round exch round
-exch itransform moveto Rx 0 rlineto 0 Ry neg rlineto Rx neg 0 rlineto
-fill grestore}B/a{moveto}B/delta 0 N/tail{A/delta X 0 rmoveto}B/M{S p
-delta add tail}B/b{S p tail}B/c{-4 M}B/d{-3 M}B/e{-2 M}B/f{-1 M}B/g{0 M}
-B/h{1 M}B/i{2 M}B/j{3 M}B/k{4 M}B/w{0 rmoveto}B/l{p -4 w}B/m{p -3 w}B/n{
-p -2 w}B/o{p -1 w}B/q{p 1 w}B/r{p 2 w}B/s{p 3 w}B/t{p 4 w}B/x{0 S
-rmoveto}B/y{3 2 roll p a}B/bos{/SS save N}B/eos{SS restore}B end
+/dir 0 def/dyy{/dir 0 def}B/dyt{/dir 1 def}B/dty{/dir 2 def}B/dtt{/dir 3
+def}B/p{dir 2 eq{-90 rotate show 90 rotate}{dir 3 eq{-90 rotate show 90
+rotate}{show}ifelse}ifelse}N/RMat[1 0 0 -1 0 0]N/BDot 260 string N/Rx 0
+N/Ry 0 N/V{}B/RV/v{/Ry X/Rx X V}B statusdict begin/product where{pop
+false[(Display)(NeXT)(LaserWriter 16/600)]{A length product length le{A
+length product exch 0 exch getinterval eq{pop true exit}if}{pop}ifelse}
+forall}{false}ifelse end{{gsave TR -.1 .1 TR 1 1 scale Rx Ry false RMat{
+BDot}imagemask grestore}}{{gsave TR -.1 .1 TR Rx Ry scale 1 1 false RMat
+{BDot}imagemask grestore}}ifelse B/QV{gsave newpath transform round exch
+round exch itransform moveto Rx 0 rlineto 0 Ry neg rlineto Rx neg 0
+rlineto fill grestore}B/a{moveto}B/delta 0 N/tail{A/delta X 0 rmoveto}B
+/M{S p delta add tail}B/b{S p tail}B/c{-4 M}B/d{-3 M}B/e{-2 M}B/f{-1 M}
+B/g{0 M}B/h{1 M}B/i{2 M}B/j{3 M}B/k{4 M}B/w{0 rmoveto}B/l{p -4 w}B/m{p
+-3 w}B/n{p -2 w}B/o{p -1 w}B/q{p 1 w}B/r{p 2 w}B/s{p 3 w}B/t{p 4 w}B/x{
+0 S rmoveto}B/y{3 2 roll p a}B/bos{/SS save N}B/eos{SS restore}B end
 
 %%EndProcSet
 %%BeginProcSet: texps.pro 0 0
@@ -7825,7 +7827,7 @@ CA4D59F3BF2CA0795A74B278C85899121C79247C78DD30EC1442B6F3D5857BFD
 cleartomark
 {restore}if
 %%EndFont 
-TeXDict begin 39158280 55380996 1000 600 600 (avram.dvi)
+TeXDict begin 40258431 52099146 1000 600 600 (avram.dvi)
 @start /Fa 133[34 41 41 55 41 43 30 30 30 41 43 38 43
 64 21 41 23 21 43 38 23 34 43 34 43 38 21 10[58 55 43
 57 1[52 1[58 1[48 1[39 28 58 60 50 1[59 55 1[58 7[38
@@ -7889,7 +7891,12 @@ rf end
 %%BeginSetup
 %%Feature: *Resolution 600dpi
 TeXDict begin
-%%PaperSize: a4
+%%BeginPaperSize: Letter
+/setpagedevice where
+{ pop << /PageSize [612 792] >> setpagedevice }
+{ /letter where { pop letter } if }
+ifelse
+%%EndPaperSize
  end
 %%EndSetup
 %%Page: 1 1
@@ -7900,11 +7907,11 @@ b(0.13.0)150 5068 y Ft(b)l(y)45 b(Dennis)g(F)-11 b(urey)p
 150 5141 3600 17 v eop end
 %%Page: 2 2
 TeXDict begin 2 1 bop 150 4371 a Fu(Cop)m(yrigh)m(t)602
-4368 y(c)577 4371 y Fs(\015)30 b Fu(2006,)j(2007)f(Dennis)e(F)-8
-b(urey)150 4505 y(P)m(ermission)32 b(is)h(gran)m(ted)g(to)f(mak)m(e)i
-(and)d(distribute)h(v)m(erbatim)h(copies)g(of)f(this)g(man)m(ual)h(pro)
-m(vided)f(the)150 4615 y(cop)m(yrigh)m(t)g(notice)f(and)f(this)g(p)s
-(ermission)g(notice)h(are)g(preserv)m(ed)f(on)h(all)g(copies.)150
+4368 y(c)577 4371 y Fs(\015)30 b Fu(2006,)j(2007,)f(2012)g(Dennis)e(F)
+-8 b(urey)150 4505 y(P)m(ermission)32 b(is)h(gran)m(ted)g(to)f(mak)m(e)
+i(and)d(distribute)h(v)m(erbatim)h(copies)g(of)f(this)g(man)m(ual)h
+(pro)m(vided)f(the)150 4615 y(cop)m(yrigh)m(t)g(notice)f(and)f(this)g
+(p)s(ermission)g(notice)h(are)g(preserv)m(ed)f(on)h(all)g(copies.)150
 4749 y(P)m(ermission)24 b(is)f(gran)m(ted)i(to)f(cop)m(y)g(and)f
 (distribute)g(mo)s(di\014ed)g(v)m(ersions)h(of)f(this)h(man)m(ual)g
 (under)e(the)h(con-)150 4859 y(ditions)30 b(for)g(v)m(erbatim)g(cop)m
@@ -7942,15 +7949,14 @@ b Fp(.)21 b(.)e(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)h(.)f(.)h(.)f
 b Fr(133)150 1528 y(App)s(endix)34 b(D)97 b(External)34
 b(Libraries)j Fp(.)20 b(.)f(.)h(.)f(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)g(.)h
 (.)f(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)69 b Fr(135)150 1669
-y(GNU)32 b(GENERAL)h(PUBLIC)h(LICENSE)22 b Fp(.)f(.)f(.)f(.)g(.)h(.)f
-(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)g(.)55
-b Fr(167)150 1810 y(F)-8 b(unction)33 b(Index)k Fp(.)20
-b(.)f(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)h(.)f
-(.)h(.)f(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)h(.)f(.)h(.)68
-b Fr(175)150 1951 y(Concept)34 b(Index)16 b Fp(.)21 b(.)e(.)h(.)f(.)h
-(.)f(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)h(.)f(.)
-h(.)f(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)49 b
-Fr(177)p eop end
+y(App)s(endix)34 b(E)106 b(GNU)33 b(GENERAL)g(PUBLIC)g(LICENCE)17
+b Fp(.)k(.)f(.)f(.)g(.)h(.)f(.)h(.)f(.)49 b Fr(167)150
+1810 y(F)-8 b(unction)33 b(Index)k Fp(.)20 b(.)f(.)h(.)f(.)h(.)f(.)g(.)
+h(.)f(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)h(.)f
+(.)h(.)f(.)g(.)h(.)f(.)h(.)f(.)h(.)68 b Fr(175)150 1951
+y(Concept)34 b(Index)16 b Fp(.)21 b(.)e(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f
+(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)
+h(.)f(.)h(.)f(.)g(.)h(.)f(.)49 b Fr(177)p eop end
 %%Page: -2 4
 TeXDict begin -2 3 bop 150 -116 a Fu(ii)1852 b(a)m(vram)31
 b(-)f(a)h(virtual)g(mac)m(hine)g(co)s(de)g(in)m(terpreter)150
@@ -8569,26 +8575,27 @@ g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)44
 b Fu(165)748 4247 y(D.17.4)93 b(Additional)31 b Fn(umf)e
 Fu(notes)19 b Fo(.)d(.)f(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)
 g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)49 b Fu(165)150
-4490 y Ft(GNU)c(GENERAL)g(PUBLIC)g(LICENSE)26 b Fp(.)20
-b(.)f(.)g(.)h(.)f(.)h(.)f(.)70 b Ft(167)449 4627 y Fu(Pream)m(ble)13
-b Fo(.)j(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)
-g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g
-(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)43
-b Fu(167)449 4736 y(TERMS)29 b(AND)j(CONDITIONS)d(F)m(OR)h(COPYING,)h
-(DISTRIBUTION)631 4846 y(AND)g(MODIFICA)-8 b(TION)22
-b Fo(.)15 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g
-(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)51
-b Fu(168)449 4956 y(Ho)m(w)31 b(to)g(Apply)f(These)g(T)-8
-b(erms)30 b(to)h(Y)-8 b(our)31 b(New)f(Programs)14 b
-Fo(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)44 b Fu(172)150
-5198 y Ft(F)-11 b(unction)44 b(Index)36 b Fp(.)19 b(.)h(.)f(.)h(.)f(.)g
-(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)g(.)h(.)
-f(.)h(.)f(.)h(.)f(.)80 b Ft(175)p eop end
+4490 y Ft(App)t(endix)44 b(E)134 b(GNU)46 b(GENERAL)f(PUBLIC)419
+4623 y(LICENCE)12 b Fp(.)21 b(.)e(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)g(.)h
+(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)
+h(.)56 b Ft(167)449 4760 y Fu(Pream)m(ble)13 b Fo(.)j(.)f(.)g(.)g(.)g
+(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)
+g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g
+(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)43 b Fu(167)449
+4869 y(TERMS)29 b(AND)j(CONDITIONS)d(F)m(OR)h(COPYING,)h(DISTRIBUTION)
+631 4979 y(AND)g(MODIFICA)-8 b(TION)22 b Fo(.)15 b(.)g(.)g(.)g(.)g(.)g
+(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)
+g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)51 b Fu(168)449 5088
+y(Ho)m(w)31 b(to)g(Apply)f(These)g(T)-8 b(erms)30 b(to)h(Y)-8
+b(our)31 b(New)f(Programs)14 b Fo(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g
+(.)g(.)44 b Fu(172)p eop end
 %%Page: -7 9
-TeXDict begin -7 8 bop 3652 -116 a Fu(vii)150 83 y Ft(Concept)45
-b(Index)18 b Fp(.)i(.)f(.)h(.)f(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)g(.)h(.)f
-(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)h(.)62
-b Ft(177)p eop end
+TeXDict begin -7 8 bop 3652 -116 a Fu(vii)150 83 y Ft(F)-11
+b(unction)44 b(Index)36 b Fp(.)19 b(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)h(.)f
+(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)h(.)f(.)h(.)
+f(.)80 b Ft(175)150 353 y(Concept)45 b(Index)18 b Fp(.)i(.)f(.)h(.)f(.)
+g(.)h(.)f(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)g(.)h(.)f(.)h
+(.)f(.)h(.)f(.)g(.)h(.)f(.)h(.)62 b Ft(177)p eop end
 %%Page: 1 10
 TeXDict begin 1 9 bop 150 -116 a Fu(Preface)3264 b(1)150
 299 y Fq(Preface)275 547 y Fn(avram)36 b Fu(is)j(a)g(virtual)f(mac)m
@@ -8608,9 +8615,9 @@ y(The)30 b(name)g(is)h(a)f(quasi-acron)m(ym)i(for)e(\\Applicativ)m(e)j
 1452 y Fs(\017)60 b Fn(mpfr)29 b Fu(\(arbitrary)i(precision)f
 (arithmetic\))510 1589 y Fn(http://www.mpfr.org)405 1726
 y Fs(\017)60 b Fn(minpack)28 b Fu(\(non-linear)j(optimization\))510
-1862 y Fn(http://ftp.netlib.org/mi)o(npac)o(k)405 1999
+1862 y Fn(http://www.netlib.org/mi)o(npac)o(k)405 1999
 y Fs(\017)60 b Fn(lapack)29 b Fu(\(linear)i(algebra\))510
-2136 y Fn(http://ftp.netlib.org/la)o(pack)405 2273 y
+2136 y Fn(http://www.netlib.org/la)o(pack)405 2273 y
 Fs(\017)60 b Fn(fftw)29 b Fu(\(fast)i(fourier)f(transforms\))510
 2409 y Fn(http://www.fftw.org)405 2546 y Fs(\017)60 b
 Fn(Rmath)29 b Fu(\(statistical)k(and)d(transcenden)m(tal)i(functions\))
@@ -8619,38 +8626,37 @@ b Fn(ufsparse)28 b Fu(\(sparse)i(matrices\))510 2956
 y Fn(http://www.cise.ufl.edu/)o(rese)o(arch)o(/sp)o(arse)o(/Sui)o(teS)o
 (pars)o(e/cu)o(rre)o(nt/S)o(uite)o(Spa)o(rse/)405 3093
 y Fs(\017)60 b Fn(glpk)29 b Fu(\(linear)i(programming)f(b)m(y)h(the)f
-(simplex)h(metho)s(d\))510 3230 y Fn(http://tech.groups.yahoo)o(.com)o
-(/gro)o(up/)o(lp_s)o(olve)o(/)405 3367 y Fs(\017)60 b
-Fn(lpsolve)28 b Fu(\(mixed)j(in)m(teger)h(linear)e(programming\))510
-3504 y Fn(http://www.llnl.gov/CASC)o(/sun)o(dial)o(s/)405
-3640 y Fs(\017)60 b Fn(kinsol)29 b Fu(\(constrained)i(non-linear)f
-(optimization\))510 3777 y Fn(http://www.llnl.gov/CASC)o(/sun)o(dial)o
-(s/)225 3914 y Fs(\017)60 b Fu(in)m(terop)s(erabilit)m(y)39
-b(of)g(virtual)f(co)s(de)g(applications)h(with)f(other)g(console)h
-(applications)g(or)f(shells)330 4023 y(through)30 b(the)g
-Fn(expect)f Fu(library)225 4160 y Fs(\017)60 b Fu(a)32
-b(simple)g(high-lev)m(el)i(in)m(terface)g(to)e(\014les,)h(en)m
-(vironmen)m(t)g(v)-5 b(ariables)32 b(and)g(command)g(line)g(param-)330
-4270 y(eters)225 4407 y Fs(\017)60 b Fu(supp)s(ort)42
-b(for)i(v)-5 b(arious)44 b(st)m(yles)i(of)e(stateless)i(or)e(p)s
-(ersisten)m(t)g(stream)h(pro)s(cessors)e(\(a.k.a.)84
-b(Unix)330 4516 y(\014lters\))275 4682 y(The)39 b(reason)g(for)h
-(writing)f Fn(avram)f Fu(w)m(as)i(that)g(I)g(w)m(an)m(ted)g(to)g(do)g
-(some)g(w)m(ork)g(using)f(a)h(functional)150 4792 y(programming)45
-b(language,)51 b(didn't)45 b(lik)m(e)h(an)m(y)g(functional)g
-(programming)f(languages)h(that)g(already)150 4902 y(existed,)30
-b(and)f(felt)h(that)g(it)g(w)m(ould)f(b)s(e)g(less)h(trouble)f(to)h
-(write)g(a)f(virtual)h(mac)m(hine)g(em)m(ulator)h(than)e(the)150
-5011 y(bac)m(k)40 b(end)e(of)i(a)f(compiler.)67 b(As)40
-b(of)f(v)m(ersion)g(0.1.0,)44 b(the)39 b(\014rst)f(public)h(release)h
-(of)f Fn(avram)f Fu(as)h(suc)m(h)g(in)150 5121 y(2000,)i(most)d(of)g
-(the)f(co)s(de)h(base)g(had)f(b)s(een)g(in)g(hea)m(vy)h(use)f(b)m(y)h
-(me)f(for)g(ab)s(out)h(four)e(y)m(ears,)41 b(running)150
-5230 y(v)m(ery)c(reliably)-8 b(.)59 b(A)m(t)37 b(this)f(writing)h(some)
-f(six)g(y)m(ears)h(later,)i(it)e(has)f(seen)g(ev)m(en)h(more)g(use)f
-(with)g(rarely)150 5340 y(an)m(y)k(reliabilit)m(y)i(issues,)g(in)d
-(some)h(cases)h(attac)m(king)h(large)f(com)m(binatorial)h(problems)d
-(for)g(w)m(eeks)i(or)p eop end
+(simplex)h(metho)s(d\))510 3230 y Fn(http://www.gnu.org/softw)o(are/)o
+(glpk)405 3367 y Fs(\017)60 b Fn(lpsolve)28 b Fu(\(mixed)j(in)m(teger)h
+(linear)e(programming\))510 3504 y Fn(http://sourceforge.net/p)o(roje)o
+(cts/)o(lps)o(olve)o(/)405 3640 y Fs(\017)60 b Fn(kinsol)29
+b Fu(\(constrained)i(non-linear)f(optimization\))510
+3777 y Fn(http://www.llnl.gov/CASC)o(/sun)o(dial)o(s/)225
+3914 y Fs(\017)60 b Fu(in)m(terop)s(erabilit)m(y)39 b(of)g(virtual)f
+(co)s(de)g(applications)h(with)f(other)g(console)h(applications)g(or)f
+(shells)330 4023 y(through)30 b(the)g Fn(expect)f Fu(library)225
+4160 y Fs(\017)60 b Fu(a)32 b(simple)g(high-lev)m(el)i(in)m(terface)g
+(to)e(\014les,)h(en)m(vironmen)m(t)g(v)-5 b(ariables)32
+b(and)g(command)g(line)g(param-)330 4270 y(eters)225
+4407 y Fs(\017)60 b Fu(supp)s(ort)42 b(for)i(v)-5 b(arious)44
+b(st)m(yles)i(of)e(stateless)i(or)e(p)s(ersisten)m(t)g(stream)h(pro)s
+(cessors)e(\(a.k.a.)84 b(Unix)330 4516 y(\014lters\))275
+4682 y(The)39 b(reason)g(for)h(writing)f Fn(avram)f Fu(w)m(as)i(that)g
+(I)g(w)m(an)m(ted)g(to)g(do)g(some)g(w)m(ork)g(using)f(a)h(functional)
+150 4792 y(programming)45 b(language,)51 b(didn't)45
+b(lik)m(e)h(an)m(y)g(functional)g(programming)f(languages)h(that)g
+(already)150 4902 y(existed,)30 b(and)f(felt)h(that)g(it)g(w)m(ould)f
+(b)s(e)g(less)h(trouble)f(to)h(write)g(a)f(virtual)h(mac)m(hine)g(em)m
+(ulator)h(than)e(the)150 5011 y(bac)m(k)40 b(end)e(of)i(a)f(compiler.)
+67 b(As)40 b(of)f(v)m(ersion)g(0.1.0,)44 b(the)39 b(\014rst)f(public)h
+(release)h(of)f Fn(avram)f Fu(as)h(suc)m(h)g(in)150 5121
+y(2000,)i(most)d(of)g(the)f(co)s(de)h(base)g(had)f(b)s(een)g(in)g(hea)m
+(vy)h(use)f(b)m(y)h(me)f(for)g(ab)s(out)h(four)e(y)m(ears,)41
+b(running)150 5230 y(v)m(ery)c(reliably)-8 b(.)59 b(A)m(t)37
+b(this)f(writing)h(some)f(six)g(y)m(ears)h(later,)i(it)e(has)f(seen)g
+(ev)m(en)h(more)g(use)f(with)g(rarely)150 5340 y(an)m(y)k(reliabilit)m
+(y)i(issues,)g(in)d(some)h(cases)h(attac)m(king)h(large)f(com)m
+(binatorial)h(problems)d(for)g(w)m(eeks)i(or)p eop end
 %%Page: 2 11
 TeXDict begin 2 10 bop 150 -116 a Fu(2)1857 b(a)m(vram)31
 b(-)f(a)h(virtual)g(mac)m(hine)g(co)s(de)g(in)m(terpreter)150
@@ -9296,19 +9302,20 @@ b(arious)28 b(data)630 2680 y(structures,)44 b(and)d(c)m(hec)m(ks)h
 (that)g(they)g(are)g(all)g(reclaimed)g(ev)m(en)m(tually)i(as)d(a)h
 (safeguard)630 2789 y(against)33 b(memory)e(leaks.)44
 b(This)31 b(message)h(indicates)h(that)f(some)f(memory)h(remains)f(un-)
-630 2899 y(accoun)m(ted)h(for.)275 3069 y(If)i(a)h(rep)s(eatable)h(in)m
-(ternal)f(error)f(is)h(disco)m(v)m(ered,)j(please)d(email)h(a)f(bug)f
-(rep)s(ort)h(and)f(a)h(small)g(rep-)150 3178 y(resen)m(tativ)m(e)43
-b(test)e(case)g(to)g(the)f(author)g(at)h Fn([email protected])
-o(x.ne)o(t)p Fu(.)64 b(Include)40 b(the)150 3288 y(v)m(ersion)31
-b(n)m(um)m(b)s(er)e(of)h Fn(avram)p Fu(,)g(whic)m(h)g(y)m(ou)g(can)h
-(get)h(b)m(y)e(running)f Fm(avram)f(--version)p Fu(.)150
-3498 y Fk(1.6.2)63 b(i/o)41 b(Errors)275 3685 y Fu(These)28
-b(error)g(messages)i(are)f(prefaced)g(with)f(the)h(name)g(of)g(the)f
-(application.)42 b(A)29 b(further)e(explana-)150 3795
-y(tion)35 b(as)g(to)g(the)g(reason,)h(obtained)f(from)g(the)f(standard)
-g Fn(strerror\(\))e Fu(utilit)m(y)-8 b(,)38 b(is)c(app)s(ended)f(to)j
-(the)150 3904 y(messages)31 b(b)s(elo)m(w)g(if)f(p)s(ossible.)150
+630 2899 y(accoun)m(ted)h(for.)275 3069 y(If)d(a)h(rep)s(eatable)h(in)m
+(ternal)f(error)f(is)h(disco)m(v)m(ered,)i(please)e(email)h(a)f(bug)f
+(rep)s(ort)h(and)f(a)h(small)g(repre-)150 3178 y(sen)m(tativ)m(e)35
+b(test)e(case)g(to)g Fn([email protected])o(g)26
+b Fu(or)33 b(\014le)f(an)g(issue)g(on)g(the)h(Avram)f(gith)m(ub)150
+3288 y(page.)39 b(Include)21 b(the)h(v)m(ersion)h(n)m(um)m(b)s(er)e(of)
+h Fn(avram)p Fu(,)g(whic)m(h)g(y)m(ou)g(can)h(get)g(b)m(y)f(running)e
+Fm(avram)29 b(--version)p Fu(.)150 3498 y Fk(1.6.2)63
+b(i/o)41 b(Errors)275 3685 y Fu(These)28 b(error)g(messages)i(are)f
+(prefaced)g(with)f(the)h(name)g(of)g(the)f(application.)42
+b(A)29 b(further)e(explana-)150 3795 y(tion)35 b(as)g(to)g(the)g
+(reason,)h(obtained)f(from)g(the)f(standard)g Fn(strerror\(\))e
+Fu(utilit)m(y)-8 b(,)38 b(is)c(app)s(ended)f(to)j(the)150
+3904 y(messages)31 b(b)s(elo)m(w)g(if)f(p)s(ossible.)150
 4054 y Fl(application-name)5 b Fn(:)32 b(can't)d(read)g
 Fl(\014lename)630 4164 y Fu(A)e(\014le)h(w)m(as)f(not)h(able)g(to)g(b)s
 (e)e(op)s(ened)h(for)g(reading,)h(t)m(ypically)h(b)s(ecause)e(it)h(w)m
@@ -9801,9 +9808,10 @@ b(F)-8 b(urthermore,)150 518 y(it)34 b(has)f(b)s(een)g(observ)m(ed)h
 (ux)f(k)m(ernels)h(that)g(the)150 628 y Fn(avram)f Fu(pro)s(cess)i(is)g
 (killed)g(automatically)j(for)c(attempting)i(to)g(allo)s(cate)h(to)s(o)
 f(m)m(uc)m(h)e(memory)h(rather)150 737 y(than)30 b(giv)m(en)h(the)g(c)m
-(hance)h(to)f(reco)m(v)m(er.)275 872 y(Please)g(send)f(bug)f(rep)s
-(orts)h(to)h Fn([email protected])o(ux.)o(net)p
-Fu(.)p eop end
+(hance)h(to)f(reco)m(v)m(er.)275 872 y(Please)d(send)e(bug)g(rep)s
+(orts)h(to)g Fn([email protected])o(g)21 b Fu(or)27
+b(\014le)g(an)g(issue)g(on)g(the)g(Avram)150 981 y(gith)m(ub)j(page.)p
+eop end
 %%Page: 18 27
 TeXDict begin 18 26 bop 150 -116 a Fu(18)1812 b(a)m(vram)31
 b(-)f(a)h(virtual)g(mac)m(hine)g(co)s(de)g(in)m(terpreter)p
@@ -17600,30 +17608,30 @@ b(orking)330 869 y(around)35 b(library)g(misfeatures],)i(page)f(114,)j
 (at)d(least)h(if)f(there's)f(nothing)h(else)g(wrong)f(with)h(the)330
 979 y(library)-8 b(.)275 1162 y(Those)32 b(who)h(supp)s(ort)e
 Fn(avram)h Fu(are)h(alw)m(a)m(ys)i(prepared)d(to)i(assist)f(in)g(the)g
-(dissemination)g(of)h(w)m(orth-)150 1272 y(while)h(con)m(tributed)h
-(library)e(mo)s(dules)h(under)e(terms)i(compatible)i(with)d([Cop)m
-(ying],)k(page)e(167,)i(and)150 1382 y(under)h(separate)j(cop)m(yrigh)m
-(ts)g(if)f(preferred.)71 b(Con)m(tributed)41 b(mo)s(dules)f(can)h(b)s
-(e)f(in)m(tegrated)j(in)m(to)f(the)150 1491 y(o\016cial)i(source)f
-(tree)g(pro)m(vided)f(that)h(they)g(meet)g(the)g(follo)m(wing)h
-(additional)f(guidelines)g(to)g(those)150 1601 y(ab)s(o)m(v)m(e.)225
-1751 y Fs(\017)60 b Fu(source)55 b(co)s(de)f(do)s(cumen)m(tation)i(and)
-e(inden)m(tation)h(according)h(to)f(GNU)g(co)s(ding)g(standards)330
-1861 y(\()p Fn(http://www.gnu.org/prep/st)o(and)o(ards)o
-Fu(\))225 2004 y Fs(\017)60 b Fu(su\016cien)m(t)31 b(stabilit)m(y)h
-(for)e(a)h(semi-ann)m(ual)g(release)g(cycle)225 2146
-y Fs(\017)60 b Fu(no)34 b(run-time)f(or)h(compile-time)i(dep)s(endence)
-c(on)i(an)m(y)g(non-free)g(soft)m(w)m(are,)i(although)e(dynamic)330
-2256 y(loading)d(and)f(clien)m(t/serv)m(er)j(in)m(teraction)f(are)f
-(acceptable)225 2398 y Fs(\017)60 b Fu(p)s(ortable)30
-b(or)h(at)g(least)g(un)m(break)-5 b(able)31 b(con\014guration)f(b)m(y)h
-(appropriate)f(use)g(of)g Fn(autoconf)e Fu(macros)330
-2508 y(and)i(conditional)h(de\014nes)225 2651 y Fs(\017)60
-b Fu(little)23 b(or)f(no)f(state)i(dep)s(endence)e(at)h(the)g(lev)m(el)
-h(of)f(the)g(virtual)g(co)s(de)g(in)m(terface)h(\(i.e.,)i(pure)20
-b(functions)330 2760 y(or)k(something)g(lik)m(e)h(them,)h(except)e(for)
-g(random)f(n)m(um)m(b)s(er)g(generators)h(and)g(related)g
-(applications\))225 2903 y Fs(\017)60 b Fu(adequate)31
+(dissemination)g(of)h(w)m(orth-)150 1272 y(while)43 b(con)m(tributed)g
+(library)g(mo)s(dules)f(under)g(terms)h(compatible)h(with)f(App)s
+(endix)e(E)i([Cop)m(ying],)150 1382 y(page)i(167,)j(and)c(under)e
+(separate)j(cop)m(yrigh)m(ts)g(if)f(preferred.)80 b(Con)m(tributed)43
+b(mo)s(dules)g(can)i(b)s(e)e(in-)150 1491 y(tegrated)j(in)m(to)g(the)e
+(o\016cial)i(source)f(tree)g(pro)m(vided)f(that)i(they)e(meet)i(the)f
+(follo)m(wing)h(additional)150 1601 y(guidelines)31 b(to)g(those)g(ab)s
+(o)m(v)m(e.)225 1751 y Fs(\017)60 b Fu(source)55 b(co)s(de)f(do)s
+(cumen)m(tation)i(and)e(inden)m(tation)h(according)h(to)f(GNU)g(co)s
+(ding)g(standards)330 1861 y(\()p Fn(http://www.gnu.org/prep/st)o(and)o
+(ards)o Fu(\))225 2004 y Fs(\017)60 b Fu(su\016cien)m(t)31
+b(stabilit)m(y)h(for)e(a)h(semi-ann)m(ual)g(release)g(cycle)225
+2146 y Fs(\017)60 b Fu(no)34 b(run-time)f(or)h(compile-time)i(dep)s
+(endence)c(on)i(an)m(y)g(non-free)g(soft)m(w)m(are,)i(although)e
+(dynamic)330 2256 y(loading)d(and)f(clien)m(t/serv)m(er)j(in)m
+(teraction)f(are)f(acceptable)225 2398 y Fs(\017)60 b
+Fu(p)s(ortable)30 b(or)h(at)g(least)g(un)m(break)-5 b(able)31
+b(con\014guration)f(b)m(y)h(appropriate)f(use)g(of)g
+Fn(autoconf)e Fu(macros)330 2508 y(and)i(conditional)h(de\014nes)225
+2651 y Fs(\017)60 b Fu(little)23 b(or)f(no)f(state)i(dep)s(endence)e
+(at)h(the)g(lev)m(el)h(of)f(the)g(virtual)g(co)s(de)g(in)m(terface)h
+(\(i.e.,)i(pure)20 b(functions)330 2760 y(or)k(something)g(lik)m(e)h
+(them,)h(except)e(for)g(random)f(n)m(um)m(b)s(er)g(generators)h(and)g
+(related)g(applications\))225 2903 y Fs(\017)60 b Fu(adequate)31
 b(do)s(cumen)m(tation)h(for)e(a)g(section)i(in)e(App)s(endix)f(D)h
 ([External)h(Libraries],)g(page)g(135)150 3159 y Fk(3.9.3)63
 b(W)-10 b(orking)41 b(around)h(library)f(misfeatures)275
@@ -21033,9 +21041,10 @@ TeXDict begin 166 174 bop 150 -116 a Fu(166)1767 b(a)m(vram)31
 b(-)f(a)h(virtual)g(mac)m(hine)g(co)s(de)g(in)m(terpreter)p
 eop end
 %%Page: 167 176
-TeXDict begin 167 175 bop 150 -116 a Fu(GNU)31 b(GENERAL)f(PUBLIC)h
-(LICENSE)1961 b(167)150 299 y Fq(GNU)54 b(GENERAL)g(PUBLIC)f(LICENSE)
-1537 564 y Fu(V)-8 b(ersion)31 b(2,)g(June)f(1991)390
+TeXDict begin 167 175 bop 150 -116 a Fu(App)s(endix)29
+b(E:)h(GNU)h(GENERAL)g(PUBLIC)f(LICENCE)1412 b(167)150
+141 y Fq(App)t(endix)111 b(E)81 b(GNU)53 b(GENERAL)h(PUBLIC)1079
+299 y(LICENCE)1537 564 y Fu(V)-8 b(ersion)31 b(2,)g(June)f(1991)390
 720 y(Cop)m(yrigh)m(t)842 717 y(c)817 720 y Fs(\015)g
 Fu(1989,)j(1991)f(F)-8 b(ree)31 b(Soft)m(w)m(are)h(F)-8
 b(oundation,)31 b(Inc.)390 824 y(675)h(Mass)e(Av)m(e,)i(Cam)m(bridge,)f
@@ -21201,11 +21210,12 @@ b(to)h(those)f(sections)h(when)f(y)m(ou)g(distribute)g(them)g(as)g
 (the)g(terms)g(of)h(this)f(License,)h(whose)f(p)s(ermissions)p
 eop end
 %%Page: 169 178
-TeXDict begin 169 177 bop 150 -116 a Fu(GNU)31 b(GENERAL)f(PUBLIC)h
-(LICENSE)1961 b(169)330 299 y(for)22 b(other)h(licensees)g(extend)g(to)
-g(the)f(en)m(tire)h(whole,)i(and)c(th)m(us)h(to)h(eac)m(h)h(and)d(ev)m
-(ery)i(part)g(regardless)330 408 y(of)31 b(who)e(wrote)i(it.)330
-538 y(Th)m(us,)48 b(it)e(is)f(not)h(the)f(in)m(ten)m(t)h(of)g(this)f
+TeXDict begin 169 177 bop 150 -116 a Fu(App)s(endix)29
+b(E:)h(GNU)h(GENERAL)g(PUBLIC)f(LICENCE)1412 b(169)330
+299 y(for)22 b(other)h(licensees)g(extend)g(to)g(the)f(en)m(tire)h
+(whole,)i(and)c(th)m(us)h(to)h(eac)m(h)h(and)d(ev)m(ery)i(part)g
+(regardless)330 408 y(of)31 b(who)e(wrote)i(it.)330 538
+y(Th)m(us,)48 b(it)e(is)f(not)h(the)f(in)m(ten)m(t)h(of)g(this)f
 (section)h(to)g(claim)h(righ)m(ts)e(or)g(con)m(test)i(y)m(our)f(righ)m
 (ts)f(to)330 648 y(w)m(ork)34 b(written)f(en)m(tirely)i(b)m(y)f(y)m
 (ou;)h(rather,)g(the)f(in)m(ten)m(t)h(is)e(to)i(exercise)f(the)g(righ)m
@@ -21382,18 +21392,19 @@ b(the)i(Program)f(do)s(es)g(not)g(sp)s(ecify)g(a)330
 m(y)i(the)g(F)-8 b(ree)330 5340 y(Soft)m(w)m(are)31 b(F)-8
 b(oundation.)p eop end
 %%Page: 171 180
-TeXDict begin 171 179 bop 150 -116 a Fu(GNU)31 b(GENERAL)f(PUBLIC)h
-(LICENSE)1961 b(171)154 299 y(11.)61 b(If)29 b(y)m(ou)g(wish)g(to)h
-(incorp)s(orate)g(parts)f(of)g(the)g(Program)h(in)m(to)g(other)g(free)f
-(programs)g(whose)g(distri-)330 408 y(bution)f(conditions)h(are)h
-(di\013eren)m(t,)f(write)g(to)h(the)f(author)f(to)i(ask)e(for)h(p)s
-(ermission.)39 b(F)-8 b(or)29 b(soft)m(w)m(are)330 518
-y(whic)m(h)24 b(is)g(cop)m(yrigh)m(ted)h(b)m(y)f(the)g(F)-8
-b(ree)25 b(Soft)m(w)m(are)g(F)-8 b(oundation,)26 b(write)e(to)h(the)f
-(F)-8 b(ree)25 b(Soft)m(w)m(are)g(F)-8 b(oun-)330 628
-y(dation;)29 b(w)m(e)f(sometimes)h(mak)m(e)f(exceptions)h(for)e(this.)
-40 b(Our)26 b(decision)i(will)g(b)s(e)f(guided)g(b)m(y)g(the)h(t)m(w)m
-(o)330 737 y(goals)c(of)f(preserving)f(the)g(free)h(status)g(of)f(all)i
+TeXDict begin 171 179 bop 150 -116 a Fu(App)s(endix)29
+b(E:)h(GNU)h(GENERAL)g(PUBLIC)f(LICENCE)1412 b(171)154
+299 y(11.)61 b(If)29 b(y)m(ou)g(wish)g(to)h(incorp)s(orate)g(parts)f
+(of)g(the)g(Program)h(in)m(to)g(other)g(free)f(programs)g(whose)g
+(distri-)330 408 y(bution)f(conditions)h(are)h(di\013eren)m(t,)f(write)
+g(to)h(the)f(author)f(to)i(ask)e(for)h(p)s(ermission.)39
+b(F)-8 b(or)29 b(soft)m(w)m(are)330 518 y(whic)m(h)24
+b(is)g(cop)m(yrigh)m(ted)h(b)m(y)f(the)g(F)-8 b(ree)25
+b(Soft)m(w)m(are)g(F)-8 b(oundation,)26 b(write)e(to)h(the)f(F)-8
+b(ree)25 b(Soft)m(w)m(are)g(F)-8 b(oun-)330 628 y(dation;)29
+b(w)m(e)f(sometimes)h(mak)m(e)f(exceptions)h(for)e(this.)40
+b(Our)26 b(decision)i(will)g(b)s(e)f(guided)g(b)m(y)g(the)h(t)m(w)m(o)
+330 737 y(goals)c(of)f(preserving)f(the)g(free)h(status)g(of)f(all)i
 (deriv)-5 b(ativ)m(es)24 b(of)e(our)g(free)h(soft)m(w)m(are)h(and)e(of)
 h(promoting)330 847 y(the)31 b(sharing)f(and)f(reuse)h(of)h(soft)m(w)m
 (are)h(generally)-8 b(.)330 1104 y Ft(NO)45 b(W)-15 b(ARRANTY)154
@@ -21500,16 +21511,17 @@ b(.)51 b(Here)34 b(is)f(a)h(sample;)h(alter)g(the)150
 b(of)f(T)m(y)h(Co)s(on)p Fn(,)47 b(1)g(April)g(1989)390
 5343 y(Ty)g(Coon,)g(President)e(of)i(Vice)p eop end
 %%Page: 173 182
-TeXDict begin 173 181 bop 150 -116 a Fu(GNU)31 b(GENERAL)f(PUBLIC)h
-(LICENSE)1961 b(173)275 299 y(This)20 b(General)h(Public)g(License)g
-(do)s(es)g(not)g(p)s(ermit)f(incorp)s(orating)h(y)m(our)g(program)f(in)
-m(to)i(proprietary)150 408 y(programs.)38 b(If)22 b(y)m(our)h(program)f
-(is)h(a)g(subroutine)f(library)-8 b(,)25 b(y)m(ou)e(ma)m(y)g(consider)g
-(it)g(more)g(useful)f(to)i(p)s(ermit)150 518 y(linking)36
-b(proprietary)g(applications)i(with)e(the)g(library)-8
-b(.)59 b(If)35 b(this)i(is)f(what)g(y)m(ou)h(w)m(an)m(t)g(to)g(do,)h
-(use)e(the)150 628 y(GNU)31 b(Library)f(General)h(Public)f(License)h
-(instead)f(of)h(this)f(License.)p eop end
+TeXDict begin 173 181 bop 150 -116 a Fu(App)s(endix)29
+b(E:)h(GNU)h(GENERAL)g(PUBLIC)f(LICENCE)1412 b(173)275
+299 y(This)20 b(General)h(Public)g(License)g(do)s(es)g(not)g(p)s(ermit)
+f(incorp)s(orating)h(y)m(our)g(program)f(in)m(to)i(proprietary)150
+408 y(programs.)38 b(If)22 b(y)m(our)h(program)f(is)h(a)g(subroutine)f
+(library)-8 b(,)25 b(y)m(ou)e(ma)m(y)g(consider)g(it)g(more)g(useful)f
+(to)i(p)s(ermit)150 518 y(linking)36 b(proprietary)g(applications)i
+(with)e(the)g(library)-8 b(.)59 b(If)35 b(this)i(is)f(what)g(y)m(ou)h
+(w)m(an)m(t)g(to)g(do,)h(use)e(the)150 628 y(GNU)31 b(Library)f
+(General)h(Public)f(License)h(instead)f(of)h(this)f(License.)p
+eop end
 %%Page: 174 183
 TeXDict begin 174 182 bop 150 -116 a Fu(174)1767 b(a)m(vram)31
 b(-)f(a)h(virtual)g(mac)m(hine)g(co)s(de)g(in)m(terpreter)p

doc/avram.texinfo

@@ -42,7 +42,7 @@ by the Free Software Foundation.
 
 @page
 @vskip 0pt plus 1filll
-Copyright @copyright{} 2006, 2007 Dennis Furey
+Copyright @copyright{} 2006, 2007, 2012 Dennis Furey
 
 Permission is granted to make and distribute verbatim copies of
 this manual provided the copyright notice and this permission notice
@@ -117,12 +117,12 @@ interfaces to selected functions from mathematical libraries, such as
 @code{minpack}  (non-linear optimization)
 
 
-@url{http://ftp.netlib.org/minpack}
+@url{http://www.netlib.org/minpack}
 @item
 @code{lapack}   (linear algebra)
 
 
-@url{http://ftp.netlib.org/lapack}
+@url{http://www.netlib.org/lapack}
 @item
 @code{fftw}     (fast fourier transforms)
 
@@ -141,12 +141,12 @@ interfaces to selected functions from mathematical libraries, such as
 @code{glpk}     (linear programming by the simplex method)
 
 
-@url{http://tech.groups.yahoo.com/group/lp_solve/}
+@url{http://www.gnu.org/software/glpk}
 @item
 @code{lpsolve}      (mixed integer linear programming)
 
 
-@url{http://www.llnl.gov/CASC/sundials/}
+@url{http://sourceforge.net/projects/lpsolve/}
 @item
 @code{kinsol}   (constrained non-linear optimization)
 
@@ -796,9 +796,10 @@ that some memory remains unaccounted for.
 @cindex email
 @cindex author
 If a repeatable internal error is discovered, please email a bug
-report and a small representative test case to the author at
-@email{avram-support@@basis.uklinux.net}. Include the version number of @code{avram},
-which you can get by running @kbd{avram --version}.
+report and a small representative test case to
+@email{ursala-users@@freelists.org} or file an issue on the Avram
+github page. Include the version number of @code{avram}, which you can
+get by running @kbd{avram --version}.
 
 @node i/o Errors, Overflow Errors, Internal Errors, Diagnostics
 @subsection i/o Errors
@@ -1277,7 +1278,8 @@ Irix and 2.4 series Linux kernels that the @code{avram} process is
 killed automatically for attempting to allocate too much memory rather
 than given the chance to recover.
 
-Please send bug reports to @email{avram-support@@basis.uklinux.net}.
+Please send bug reports to @email{ursala-users@@freelists.org} or file
+an issue on the Avram github page.
 
 @node Virtual Machine Specification, Library Reference, User Manual, Top
 @chapter Virtual Machine Specification
@@ -12047,8 +12049,413 @@ columns by using long integers, but memory requirements on the virtual
 code side for problems of that scale are probably prohibitive for the
 foreseeable future.
 
+
 @node Copying, Function Index, External Libraries, Top
-@include gpl.texinfo
+@setfilename gpl.info
+
+@appendix GNU GENERAL PUBLIC LICENCE
+@center Version 2, June 1991
+
+@display
+Copyright @copyright{} 1989, 1991 Free Software Foundation, Inc.
+675 Mass Ave, Cambridge, MA 02139, USA
+
+Everyone is permitted to copy and distribute verbatim copies
+of this license document, but changing it is not allowed.
+@end display
+
+@menu 
+* Preamble::
+* Terms and Conditions::
+* How to Apply::
+@end menu
+
+@node Preamble, Terms and Conditions, ,Copying
+
+@unnumberedsec Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software---to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Library General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+
+@node Terms and Conditions, How to Apply, Preamble, Copying
+
+@unnumberedsec TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+@enumerate
+@item
+This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The ``Program'', below,
+refers to any such program or work, and a ``work based on the Program''
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term ``modification''.)  Each licensee is addressed as ``you''.
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+@item
+You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+@item
+You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+@enumerate a
+@item
+You must cause the modified files to carry prominent notices
+stating that you changed the files and the date of any change.
+
+@item
+You must cause any work that you distribute or publish, that in
+whole or in part contains or is derived from the Program or any
+part thereof, to be licensed as a whole at no charge to all third
+parties under the terms of this License.
+
+@item
+If the modified program normally reads commands interactively
+when run, you must cause it, when started running for such
+interactive use in the most ordinary way, to print or display an
+announcement including an appropriate copyright notice and a
+notice that there is no warranty (or else, saying that you provide
+a warranty) and that users may redistribute the program under
+these conditions, and telling the user how to view a copy of this
+License.  (Exception: if the Program itself is interactive but
+does not normally print such an announcement, your work based on
+the Program is not required to print an announcement.)
+@end enumerate
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+@item
+You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+@enumerate a
+@item
+Accompany it with the complete corresponding machine-readable
+source code, which must be distributed under the terms of Sections
+1 and 2 above on a medium customarily used for software interchange; or,
+
+@item
+Accompany it with a written offer, valid for at least three
+years, to give any third party, for a charge no more than your
+cost of physically performing source distribution, a complete
+machine-readable copy of the corresponding source code, to be
+distributed under the terms of Sections 1 and 2 above on a medium
+customarily used for software interchange; or,
+
+@item
+Accompany it with the information you received as to the offer
+to distribute corresponding source code.  (This alternative is
+allowed only for noncommercial distribution and only if you
+received the program in object code or executable form with such
+an offer, in accord with Subsection b above.)
+@end enumerate
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+@item
+You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+@item
+You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+@item
+Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+@item
+If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+@item
+If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+@item
+The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and ``any
+later version'', you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+@item
+If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+@iftex
+@heading NO WARRANTY
+@end iftex
+@ifinfo
+@center NO WARRANTY
+@end ifinfo
+
+@item
+BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM ``AS IS'' WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+@item
+IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+@end enumerate
+
+@iftex
+@heading END OF TERMS AND CONDITIONS
+@end iftex
+@ifinfo
+@center END OF TERMS AND CONDITIONS
+@end ifinfo
+
+@page
+@node How to Apply, , Terms and Conditions, Copying
+@unnumberedsec How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the ``copyright'' line and a pointer to where the full notice is found.
+
+@smallexample
+@var{one line to give the program's name and an idea of what it does.}
+Copyright (C) 19@var{yy}  @var{name of author}
+
+This program is free software; you can redistribute it and/or
+modify it under the terms of the GNU General Public License
+as published by the Free Software Foundation; either version 2
+of the License, or (at your option) any later version.
+
+This program is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+GNU General Public License for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software
+Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+@end smallexample
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+@smallexample
+Gnomovision version 69, Copyright (C) 19@var{yy} @var{name of author}
+Gnomovision comes with ABSOLUTELY NO WARRANTY; for details
+type `show w'.  This is free software, and you are welcome
+to redistribute it under certain conditions; type `show c' 
+for details.
+@end smallexample
+
+The hypothetical commands @samp{show w} and @samp{show c} should show
+the appropriate parts of the General Public License.  Of course, the
+commands you use may be called something other than @samp{show w} and
+@samp{show c}; they could even be mouse-clicks or menu items---whatever
+suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a ``copyright disclaimer'' for the program, if
+necessary.  Here is a sample; alter the names:
+
+@smallexample
+@group
+Yoyodyne, Inc., hereby disclaims all copyright
+interest in the program `Gnomovision'
+(which makes passes at compilers) written 
+by James Hacker.
+
+@var{signature of Ty Coon}, 1 April 1989
+Ty Coon, President of Vice
+@end group
+@end smallexample
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Library General
+Public License instead of this License.
+
+
 
 @node Function Index, Concept Index, Copying, Top
 @unnumbered Function Index
@@ -12060,7 +12467,6 @@ foreseeable future.
 
 @bye
 
-
 pcx has been ditched, but this section is left here
 in case someone decides to put it back