- 28 Mar, 2015 6 commits
-
-
Kim Nguyễn authored
-
Kim Nguyễn authored
-
Kim Nguyễn authored
Move the bool.ml{,i} files in types/ where they belong.
-
Kim Nguyễn authored
-
Kim Nguyễn authored
-
Kim Nguyễn authored
-
- 26 Mar, 2015 2 commits
-
-
Kim Nguyễn authored
-
Kim Nguyễn authored
Add more test cases to the the pretty printer/parser test suite.
-
- 25 Mar, 2015 3 commits
-
-
Kim Nguyễn authored
-
Kim Nguyễn authored
Fix various bugs in the pretty-printer (union of atoms not parenthesized, | instead of & for some toplevel variables)
-
Kim Nguyễn authored
-
- 24 Mar, 2015 1 commit
-
-
Kim Nguyễn authored
-
- 23 Mar, 2015 1 commit
-
-
Kim Nguyễn authored
Add a wrapper around the type printing function to prevent them from outputing illegal code (such as [(Char | (*--2)*)* ]. (which contains CDuce comments).
-
- 20 Mar, 2015 1 commit
-
-
Kim Nguyễn authored
Implement some semantic simplification of BDDs. This fixes the exponential beahviour during the typing of the application of flatten.
-
- 18 Mar, 2015 3 commits
-
-
Kim Nguyễn authored
Refactor the Bool/BoolVar code so that they share the same interface. Give access to the underlying atom module in BoolVar.
-
Kim Nguyễn authored
Improve pretty printing of Bdds and add debug directive to interactively inspect the internal representation of types.
-
Kim Nguyễn authored
exponentially large types in some cases. This simplifies types of the form: T & 'a | T \ 'a into T.
-
- 06 Mar, 2015 1 commit
-
-
https://git.cduce.org/cduceKim Nguyễn authored
-
- 04 Mar, 2015 6 commits
-
-
Kim Nguyễn authored
because they appeared both on negative and positive occurences in bdds that are equivalent to the empty type. For instance t = ('a | (Int\'a) | Int) We use product normalization to clean up this. Use the new debugging infrastructure to see what is going on during constraint solving.
-
Kim Nguyễn authored
-
Kim Nguyễn authored
-
Kim Nguyễn authored
-
Kim Nguyễn authored
-
Kim Nguyễn authored
Add a workaround in case pattern compilation failed (after typechecking) due to the presence of type variables in some types.
-
- 03 Mar, 2015 1 commit
-
-
Kim Nguyễn authored
Fix a stupid typo which made the constraint solver prefer monomorphic variables over polymorphic ones. This prevented one from applying a polymorphic function in the body of another function.
-
- 28 Feb, 2015 3 commits
-
-
Kim Nguyễn authored
-
Kim Nguyễn authored
-
Kim Nguyễn authored
Make it so that the substitution function preserves as much sharing as possible from the original type.
-
- 27 Feb, 2015 2 commits
-
-
-
Kim Nguyễn authored
-
- 26 Feb, 2015 2 commits
-
-
Kim Nguyễn authored
-
Kim Nguyễn authored
-
- 21 Feb, 2015 2 commits
-
-
Kim Nguyễn authored
-
Kim Nguyễn authored
This reverts commit a8ba6ab6. This commit introduces a regression where suprious type variables are introduced in the final type.
-
- 20 Feb, 2015 2 commits
-
-
Kim Nguyễn authored
-
Kim Nguyễn authored
Seal the representation of SortedList.Make(X).t (by making the type private). Expose Var.Set as a SortedList.S
-
- 19 Feb, 2015 2 commits
-
-
Kim Nguyễn authored
Perform a more aggressive memoization of substituted types and register the name if the original type was named. Make the pretty-printer re-entrant.
-
Kim Nguyễn authored
-
- 18 Feb, 2015 1 commit
-
-
Kim Nguyễn authored
remain regular. Within their recursive definitions, parametric types must always be instantiated with their original parameters and all types of mutually recursive definitions must have the same parameters. We use Tarjan's strongly connected components algorithm to group type definitions accordingly.
-
- 17 Feb, 2015 1 commit
-
-
Kim Nguyễn authored
[ 'abc'ab ] is now parsed as [ 'abc' ab ] to maintain backward compatibility. Change the warning message accordingly.
-