<commit_before># New in 1.0.1

## Library Updates

+ Added `Text.Lexer` and `Text.Parser` to `contrib`. These are small libraries
  for implementing total lexical analysers and parsers.
+ New instances:
    + Added `Catchable` for `ReaderT`, `WriterT`, and `RWST`.
    + Added `MonadTrans` for `RWST`.
+ Added utility functions to `Data.SortedMap` and `Data.SortedSet` (`contrib`),
  most notably `merge`, merging two maps by their `Semigroup` op (`<+>`)
+ `Prelude.WellFounded` now contains an interface `Sized a` that defines a size
  mapping from `a` to `Nat`. For example, there is an implementation for lists,
  where `size = length`.

  The function `sizeAccessible` then proves well-foundedness of the relation
  `Smaller x y = LT (size x) (size y)`, which  allows us to use strong
  induction conveniently with any type that implements `Sized`.

  In practice, this allows us to write functions that recurse not only on
  direct subterms of their arguments but on any value
  with a (strictly) smaller `size`.

  A good example of this idiom at work is `Data.List.Views.splitRec` from `base`.

## Tool Updates

+ New JavaScript code generator that uses an higher level intermediate
  representation.

+ Various optimizations of the new JavaScript code generator.

+ Names are now annotated with their representations over the IDE
  protocol, which allows IDEs to provide commands that work on special
  names that don't have syntax, such as case block names.


# New in 1.0
<commit_msg>update CHANGELOG.md<commit_after># New in 1.0.1

## Library Updates

+ Added `Text.Lexer` and `Text.Parser` to `contrib`. These are small libraries
  for implementing total lexical analysers and parsers.
+ New instances:
    + Added `Catchable` for `ReaderT`, `WriterT`, and `RWST`.
    + Added `MonadTrans` for `RWST`.
+ Added utility functions to `Data.SortedMap` and `Data.SortedSet` (`contrib`),
  most notably `merge`, merging two maps by their `Semigroup` op (`<+>`)
+ `Prelude.WellFounded` now contains an interface `Sized a` that defines a size
  mapping from `a` to `Nat`. For example, there is an implementation for lists,
  where `size = length`.

  The function `sizeAccessible` then proves well-foundedness of the relation
  `Smaller x y = LT (size x) (size y)`, which  allows us to use strong
  induction conveniently with any type that implements `Sized`.

  In practice, this allows us to write functions that recurse not only on
  direct subterms of their arguments but on any value
  with a (strictly) smaller `size`.

  A good example of this idiom at work is `Data.List.Views.splitRec` from `base`.
+ Added utility lemma `decEqSelfIsYes : decEq x x = Yes Refl` to
  `Decidable.Equality`. This is primarily useful for proving properties of
  functions defined with the help of `decEq`.

## Tool Updates

+ New JavaScript code generator that uses an higher level intermediate
  representation.

+ Various optimizations of the new JavaScript code generator.

+ Names are now annotated with their representations over the IDE
  protocol, which allows IDEs to provide commands that work on special
  names that don't have syntax, such as case block names.


# New in 1.0

{'fraction_non_alphanumeric': 0.08018867924528301, 'fraction_numerical': 0.0031446540880503146, 'mean_word_length': 4.0896, 'pattern_counts': {'":': 0, '<': 5, '<?xml version=': 0, '>': 5, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '2425441', 'n_tokens_mistral': 944, 'n_tokens_neox': 883, 'n_words': 439}