#Coq programming language code#
#Coq programming language plus#

The main technical contribution of this work is the design of MonStr, the executionstrategy language used to form an algorithm out of rules.

#Coq programming language code#

Moreover the generated code enjoys several nice properties: Existing code written in a general-purpose programming language can interoperate with Ruletex code, correctness of rules is decoupled from performance and termination of code, and implementations are conceptually simple, consisting only of λ-calculus with pattern matching. Ruletex descriptions are embedded in LATEX, the language that researchers use to publish their work, so that the author commands complete control of the rules ’ appearance. Ruletex formally describes inference rules MonStr connects the rules to an algorithm. The method of this generation is found in the combination of two domain-specific languages: Ruletex and MonStr. This thesis shows that it is possible to generate working code automatically from inference rules as they appear in publications. If the rules change or the author wants to use a different algorithm, the effort required to fix the code can be disproportionate to the size of the change in the rules. To get from rules to working code requires careful thought and effort. In the programming-language community many authors communicate algorithms through the use of inference rules.

#Coq programming language plus#

Kevin Redwine: Inference Rules Plus Proof-Search Strategies Equals Programs (2009).

The Coq system contains the functional programming language Gallina and is capable of proving properties about programs written in this language. (Newer versions of Coq have some support for 'structured' proofs that is supposed to improve maintainability if proactively used, but it's a far cry from what those features could allow 'out of the box', with no need for special care or discipline from the user.) It is designed to build and verify mathematical proofs. I don't think the version of Agda I mentioned can even be downloaded anymore. written out form) and thus allow for complex phrases to be pretty-printed automatically.Īll of these features were left to bitrot, unfortunately. Very old versions of Agda had an even more developed support for 'literate' proofs, where any item in the proof language could have a natural-language form, that could also be endowed with features in natural language grammar (singular/plural forms, grammatical class such as noun/adjective/verb/adverb, symbolic vs. Older versions of Coq could even output a pretty-printed version of any proof term, where the structure of the corresponding proof was explained in English text. Coq used to support a 'declarative proof mode' that's a lot more readable and maintainable than the usual proof scripts.