homepage: https://github.com/vvulpes0/Language-Toolkit-2
changelog-type: ''
hash: 5a77914d9fbbcc7a6f12cd964c97c3bb10be0b66d59b2fb0405f0e716e1d16ef
test-bench-deps: {}
maintainer: Dakotah Lambert <dakotahlambert@acm.org>
synopsis: A set of tools for analyzing languages via logic and automata
changelog: ''
basic-deps:
  haskeline: '>=0.2 && <0.9'
  base: '>=4.6 && <4.17'
  filepath: '>=1.0 && <1.5'
  process: '>=1.1 && <1.7'
  containers: '>=0.5 && <0.7'
  transformers: '>=0.2 && <0.6'
  parallel: '>=2.0 && <3.3'
  deepseq: '>=1.2 && <1.5'
  language-toolkit: -any
  directory: '>=1.0 && <1.4'
all-versions:
- 1.0.0.0
author: Dakotah Lambert, James Rogers
latest: 1.0.0.0
description-type: haddock
description: |-
  This provides the Language Toolkit (LTK) library
  and associated executables.
  There are four main components:

  * @factorize@,
  which takes as input a set of finite-state automata
  and writes out for each one a set of constraints
  that approximates (or, if possible, defines) it.

  * @plebby@,
  an interactive theorem-prover in which one can
  define languages via logical constraints
  or import finite-state automata
  and get information about the languages so defined.

  * @classify@,
  a command-line classification program useful
  for batch jobs.

  * And the @LTK@ library,
  which includes the functions used by
  @factorize@ and @plebby@
  as well as several other useful tools.

  This project began as a simple tool for working with
  finite-state automata, and has grown considerably more
  useful in working specifically with sub-regular languages
  as it has matured.
license-name: MIT

Update from Hackage at 2022-03-15T05:40:33Z
Update from Hackage at 2022-03-15T05:40:33Z
