OKlibrary  0.2.1.6
milestones.hpp File Reference

Go to the source code of this file.


Detailed Description

Module Versions:
ComputerAlgebra 0.1.2.4 (9.3.2010)
Version 0.1.3
ComputerAlgebra/Satisfiability version 0.0.6
(see ComputerAlgebra/Satisfiability/plans/milestones.hpp)
ComputerAlgebra/Graphs/Lisp version 0.1.1
(see ComputerAlgebra/Graphs/Lisp/plans/milestones.hpp)
ComputerAlgebra/NumberTheory/Lisp version 0.1.3
(see ComputerAlgebra/NumberTheory/Lisp/plans/milestones.hpp)
ComputerAlgebra/Combinatorics version 0.0.4 : DONE
(see ComputerAlgebra/Combinatorics/plans/milestones.hpp)
ComputerAlgebra/Hypergraphs version 0.0.8 : DONE
(see ComputerAlgebra/Hypergraphs/Lisp/plans/milestones.hpp)
In ComputerAlgebra/DataStructures/Lisp/plans/HashMaps.hpp the following topics are handled:
  • Introduce memoise function wrapper
In ComputerAlgebra/CombinatorialMatrices/Lisp/plans/general.hpp the following topics are handled:
  • Random invertible matrix
In ComputerAlgebra/TestSystem/Lisp/plans/general.hpp the following topics are handled:
  • Outline of the test system
In ComputerAlgebra/plans/Maxima.hpp the following topics are handled:
  • Why is Maxima file output so slow?
  • Stable sorting : DONE
  • Maxima seg-faults when loading a file setting memory-limits : DONE
  • Restricted recursion for memoised functions : DONE
  • Strings cause errors in evaluation of expressions : DONE
Replacement of "some" by "some_s", and of "every" by "every_s" (supplying tests for all modified functions): DONE
  1. Algebra : DONE
  2. AutomatedTheoremProving : DONE
  3. CombinatorialMatrices : DONE
  4. Cryptology (MG) : DONE
    1. directly under Lisp : DONE
    2. Lisp/Cryptanalysis : DONE
    3. Lisp/CryptoSystems : DONE
  5. DataStructures : DONE
  6. Graphs : DONE
  7. Hypergraphs : DONE
  8. LinearAlgebra : DONE
  9. MaximaInternals : DONE
  10. NumberTheory : DONE
  11. Numerical : DONE
  12. Satisfiability : DONE
    1. Autarkies : DONE
    2. Backdoors : DONE
    3. Backtracking : DONE
    4. BranchingTuples : DONE
    5. ClauseSets : DONE
    6. ConflictCombinatorics : DONE
    7. ConstraintProblems : DONE
    8. Counting : DONE
    9. Generators : DONE
    10. MinimalUnsatisfiability : DONE
    11. PropositionalLogic : DONE
    12. Reductions : DONE
    13. Resolutions : DONE
    14. Symmetries : DONE
  13. TestSystem : DONE
  14. Trees : DONE
Replacement of "makelist" by "create_list" (and supplying tests for all modified functions): DONE
  1. Algebra : DONE
  2. AutomatedTheoremProving : DONE
  3. CombinatorialMatrices : DONE
  4. Cryptology (MG) : DONE
    1. directly under Lisp : DONE
    2. Lisp/Cryptanalysis : DONE
    3. Lisp/CryptoSystems : DONE
  5. DataStructures : DONE
  6. Graphs : DONE
  7. Hypergraphs : DONE
  8. LinearAlgebra : DONE
  9. MaximaInternals : DONE
  10. NumberTheory : DONE
  11. Numerical : DONE
  12. Satisfiability : DONE
    1. Autarkies : DONE
    2. Backdoors : DONE
    3. Backtracking : DONE
    4. BranchingTuples : DONE
    5. ClauseSets : DONE
    6. ConflictCombinatorics : DONE
    7. ConstraintProblems : DONE
    8. Counting : DONE
    9. Generators : DONE
    10. MinimalUnsatisfiability : DONE
    11. PropositionalLogic : DONE
    12. Reductions : DONE
    13. Resolutions : DONE
    14. Symmetries : DONE
  13. TestSystem : DONE
  14. Trees : DONE
Version 0.1.4
ComputerAlgebra/Satisfiability version 0.0.7
(see ComputerAlgebra/Satisfiability/plans/milestones.hpp)
ComputerAlgebra/Graphs/Lisp version 0.1.3
(see ComputerAlgebra/Graphs/Lisp/plans/milestones.hpp)
ComputerAlgebra/Algebra version 0.0.6
(see ComputerAlgebra/Algebra/plans/milestones.hpp)
ComputerAlgebra/Cryptology version 0.0.6
(see ComputerAlgebra/Cryptology/plans/milestones.hpp)
In ComputerAlgebra/plans/Maxima.hpp the following topics are handled:
  • Memoised functions
  • Argument-length restriction
  • How to use function-parameters reliably??
  • Problems with errcatch
  • What is "equalp" ?
  • Maxima/CLisp bug for larger data-sets
Replacement of "apply" by the correct version of generalised apply (see "Apply-functionality" in ComputerAlgebra/DataStructures/Lisp/plans/Lists.hpp), respectively by lunion or lintersection (see "Unions and intersections" in ComputerAlgebra/Hypergraphs/Lisp/plans/SetSystems.hpp)
  1. Algebra :
  2. AutomatedTheoremProving :
  3. CombinatorialMatrices :
  4. Cryptology (MG)
    1. directly under Lisp : DONE
    2. Lisp/Cryptanalysis : DONE
    3. Lisp/CryptoSystems : DONE
  5. DataStructures : DONE
  6. Graphs :
  7. Hypergraphs :
  8. LinearAlgebra :
  9. MaximaInternals :
  10. NumberTheory :
  11. Numerical :
  12. Satisfiability :
    1. Autarkies :
    2. Backdoors :
    3. Backtracking
    4. BranchingTuples
    5. ClauseSets :
    6. ConflictCombinatorics :
    7. ConstraintProblems
    8. Counting :
    9. Generators
    10. MinimalUnsatisfiability
    11. PropositionalLogic
    12. Reductions :
    13. Resolutions :
    14. Symmetries :
  13. TestSystem :
  14. Trees :
"Generating list of elements 1 to n" in DataStructures/Lisp/plans/Lists.hpp
Update the following milestones, towards version 0.2
Version 0.2 "First phase completed"
Towards milestone 0.3 the theme is is "REDESIGN MAXIMA SYSTEM"
Version 0.2.1
ComputerAlgebra/Mupad version 0.5.1
In ComputerAlgebra/plans/Maxima.hpp the following topics are handled:
  • General design: Lists *here* are more fundamental than sets
  • Plan the redesign
In ComputerAlgebra/plans/MaximaTechniques.hpp the following topics are handled:
  • Local variables
  • Declaring variables
Version 0.2.2
ComputerAlgebra/Satisfiability version 0.0.8
(see ComputerAlgebra/Satisfiability/plans/milestones.hpp)
ComputerAlgebra/Cryptology version 0.0.6
(see ComputerAlgebra/Cryptology/plans/milestones.hpp)
In ComputerAlgebra/Mupad/plans/general.hpp the following topics are handled:
  • Rewriting
In ComputerAlgebra/plans/Maxima.hpp the following topics are handled:
  • Recovering of partial results after long (unsuccessful) computations
  • Debugging
  • Documentation
  • Handling of demos
  • Monitoring
In ComputerAlgebra/plans/MaximaTechniques.hpp the following topics are handled:
  • Elementary arithmetic
  • List operations
  • Set operations
Version 0.2.3
In ComputerAlgebra/plans/general.hpp the following topics are handled:
  • Frobenius problem
  • Dynamical systems
In ComputerAlgebra/plans/Maxima.hpp the following topics are handled:
  • Contexts
  • Lisp integration
  • Collaboration with the Maxima community
In ComputerAlgebra/plans/MaximaTechniques.hpp the following topics are handled:
  • Bugs of Maxima and their corrections
  • Document important programming techniques
  • Partial compilation
  • Document simplification of expressions
  • Timing
Version 0.3
Development at Axiom/Aldor level started.

-------------------------------------------------------------------------------------------------------------------------------------

Version history
  • 0.1 : 2.7.2007; quite a few Mupad-functions produced (but without higher design, and not connected to the main concepts of (generalised) satisfiability).
  • 0.1.1 : 5.1.2008; concentration on Maxima: created a file-inclusion-system similar to the C++ system, and provided easy installation and access; also created general documentation, and clarified the roles of Maxima/Lisp vs. Axiom/Aldor. On the way also basic functionality regarding graphs, hypergraphs and satisfiability has been established in Maxima.
  • 0.1.2 : 27.9.2008; established basic functionality for graphs, hypergraphs, combinatorial matrices and SAT problems at Maxima/Lisp level; further work on cryptosystems (established AES and basic SAT translation) and datastructures; various experiments on SAT problems; strengthening the general system (many bugs and problems with Maxima/Lisp identified and corrected); several pieces of documentation; most development spontaneous.

Definition in file milestones.hpp.