Permalink
Commits on Jun 4, 2009
Commits on Feb 1, 2009
  1. version 2009.2.1.

    sebfisch committed Feb 1, 2009
  2. Integrated Boolean Constraint Solving.

    sebfisch committed Jan 28, 2009
    added class Binding and function narrowVar.
    
    optional result for binding function.
    
    added Solver class and branchOn function.
    
    lifting for Solver.
    
    lifting for Binding.
    
    class context for binding function.
    
    added module for boolean constraints.
    
    added context argument to class Narrow.
    
    extended boolean constraint module.
    
    guards and ifThenElse in boolean constraint module.
    
    added first test for boolean constraint solver.
    
    it fails because constraints are not solved after computation.
    
    hlint suggestions. test passes after fixing sat solver package.
    
    more tests for boolean constraints.
    
    added test for unsolved boolean store and Solvable class.
    
    return context from normal form functions and use it in evaluator.
    
    test with unsolvable constraint after backtracking now succeeds.
    
    constraint solving for partial normal forms.
    
    reimplemented booleanToBool.
    
    Retain variables and delayed computations.
    
    simpler formula for backtracking test.
Commits on Jan 28, 2009
  1. removed category monads.

    sebfisch committed Jan 28, 2009
  2. removed import.

    sebfisch committed Jan 28, 2009
  3. comment reordering.

    sebfisch committed Jan 28, 2009
Commits on Jan 26, 2009
  1. added category Monads.

    sebfisch committed Jan 26, 2009
  2. added level-monad dependency.

    sebfisch committed Jan 26, 2009
  3. added breadth-first search.

    sebfisch committed Jan 26, 2009
  4. added randomisation.

    sebfisch committed Jan 26, 2009
  5. added diagonalizing strategy.

    sebfisch committed Jan 26, 2009
  6. allow computations to be restarted with different strategies.

    sebfisch committed Jan 26, 2009
    implemented iterative deepening depth-first search.
Commits on Jan 23, 2009
  1. simplified strategies w.r.t computation of initial context.

    sebfisch committed Jan 23, 2009
    compute initial context with strategies.
    
    removed class methods emptyContext and extendContext for strategies
    and strategy transformers.
  2. cleanup.

    sebfisch committed Jan 23, 2009
  3. added missing file.

    sebfisch committed Jan 23, 2009
  4. new version 2009.1.23.1.

    sebfisch committed Jan 23, 2009
  5. implemented depth counting.

    sebfisch committed Jan 23, 2009
  6. fixed version 2009.1.23.

    sebfisch committed Jan 23, 2009
  7. cleanup.

    sebfisch committed Jan 23, 2009
Commits on Jan 22, 2009
  1. updated cabal file.

    sebfisch committed Jan 22, 2009
  2. added CFLP.Strategies module and combinator to combine

    sebfisch committed Jan 22, 2009
    strategies and transformers.
  3. updated cabal file.

    sebfisch committed Jan 22, 2009
  4. module restructuring.

    sebfisch committed Jan 22, 2009
  5. Implementation of Strategy Transformers.

    sebfisch committed Jan 19, 2009
    I have added classes for strategies and strategy transformers
    and implemented depth first search with call time choice
    using this machinery. As an aside, CFLP computations don't have
    a ChocieStore context anymore. They can be executed with or
    without call-time choice semantics.
    
    added strategy class and monadic instance
    
    added instances for monadic strategies and adapted some operations.
    
    added infrastructure for strategy transformers
    
    added Enumerable class
    
    temporarily generalized list result to m'.
    
    extended CFLP class with associated types.
    
    adapted eval functions, changed some types, and fixed tests.
    
    Ctx type function in extra type class, Narrowing class simpler, n-queens working.
    
    removed context from StrategyT and such.
    
    added context and label to Strategy.choose.
    
    combine contexts of strategy and transformer.
    
    added context parameter to strategy.
    
    tests fail, call-time choice needs to be implemented as transformer.
    
    implemented call-time choice as strategy transformer.
    
    Res as type family.
    
    context transformers.
    
    specialised Results class back to Enumerable.
    
    placed definition of emptyContext in Strategy class.
    
    depth-first search in new file.
    
    reorderings.
    
    added strategy transformers.
    
    implemented strategy transformers and adjusted dependent code.
    
    re-added moved module for strategy transformers.
    
    combine ctc and dfs more flexibly.
    
    eliminated ChoiceStore context for computations.
    
    generalized CFLP instances.
Commits on Jan 19, 2009
  1. fixed version 2009.1.19

    sebfisch committed Jan 19, 2009
  2. use fundeps instead of type families for higher-order combinator `fun`.

    sebfisch committed Jan 19, 2009
    The current version of GHC fails to compile complex higher-order
    programs, probably due to incomplete support for type equalities
    in superclass constraints.
    
    I've rewritten the code to use mptc with fundeps which requires
    an undecidable instances pragma but compiles much faster.
Commits on Jan 16, 2009
  1. higher-order conversion and tests.

    sebfisch committed Jan 16, 2009
    implemented Primitive.nf2hnf for functions.
    
    added tests for higher-order combinators and conversion.
Commits on Jan 15, 2009
  1. cleanup.

    sebfisch committed Jan 15, 2009
  2. fixed cabal file.

    sebfisch committed Jan 15, 2009