1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
|
opam-version: "2.0"
maintainer: "palmskog@gmail.com"
version: "dev"
homepage: "https://github.com/coq-community/reglang"
dev-repo: "git+https://github.com/coq-community/reglang.git"
bug-reports: "https://github.com/coq-community/reglang/issues"
doc: "https://coq-community.github.io/reglang/"
license: "CECILL-B"
synopsis: "Representations of regular languages (i.e., regexps, various types of automata, and WS1S) with equivalence proofs, in Coq and MathComp"
description: """
This library provides definitions and verified translations between
different representations of regular languages: various forms of
automata (deterministic, nondeterministic, one-way, two-way),
regular expressions, and the logic WS1S. It also contains various
decidability results and closure properties of regular languages."""
build: ["dune" "build" "-p" name "-j" jobs]
depends: [
"dune" {>= "3.5"}
"coq" {>= "8.16"}
"coq-mathcomp-ssreflect" {>= "2.0"}
"coq-hierarchy-builder" {>= "1.4.0"}
]
tags: [
"category:Computer Science/Formal Languages Theory and Automata"
"keyword:regular languages"
"keyword:regular expressions"
"keyword:finite automata"
"keyword:two-way automata"
"keyword:monadic second-order logic"
"logpath:RegLang"
]
authors: [
"Christian Doczkal"
"Jan-Oliver Kaiser"
"Gert Smolka"
]
|
