Abstract
This paper describes how to verify a parser for regular expressions in a functional programming language using predicate transformer semantics for a variety of effects. Where our previous work in this area focused on the semantics for a single effect, parsing requires a combination of effects: non-determinism, general recursion and mutable state. Reasoning about such combinations of effects is notoriously difficult, yet our approach using predicate transformers enables the careful separation of program syntax, correctness proofs and termination proofs.
| Original language | English |
|---|---|
| Pages (from-to) | 39-56 |
| Number of pages | 18 |
| Journal | Electronic Proceedings in Theoretical Computer Science (EPTCS) |
| Volume | 317 |
| DOIs | |
| Publication status | Published - 1 May 2020 |
| Event | 8th Workshop on Mathematically Structured Functional Programming, MSFP 2020 - Dublin, Ireland Duration: 25 Apr 2020 → … |
Funding
Acknowledgements T. Baanen has received funding from the NWO under the Vidi program (project No. 016.Vidi.189.037, Lean Forward).
Fingerprint
Dive into the research topics of 'Combining predicate transformer semantics for effects: A case study in parsing regular languages'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver