Regular language representations in the constructive type theory of Coq (Q1663246)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Regular language representations in the constructive type theory of Coq |
scientific article; zbMATH DE number 6921423
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Regular language representations in the constructive type theory of Coq |
scientific article; zbMATH DE number 6921423 |
Statements
Regular language representations in the constructive type theory of Coq (English)
0 references
21 August 2018
0 references
regular languages
0 references
two-way automata
0 references
WS1S
0 references
constructive type theory
0 references
interactive theorem proving
0 references
Coq
0 references
SSReflect
0 references
0 references
0 references
0 references
0.9119545817375184
0 references
0.7818096280097961
0 references
0.7785417437553406
0 references
0.7756535410881042
0 references
0.7690466642379761
0 references
