Program extraction applied to monadic parsing
DOI10.1093/LOGCOM/EXV078zbMath1452.68045OpenAlexW2265767263MaRDI QIDQ5225853
Alison Jones, Monika Seisenberger, Ulrich Berger
Publication date: 29 July 2019
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://cronfa.swan.ac.uk/Record/cronfa25075/Download/0025075-06062017230311.pdf
verificationnatural language processingprogram extractionterminationmonadsparsing algorithmsMinlogleft recursion
Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Natural language processing (68T50) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Uses Software
This page was built for publication: Program extraction applied to monadic parsing