Total parser combinators
From MaRDI portal
Publication:5176948
DOI10.1145/1863543.1863585zbMath1323.68330OpenAlexW2049814260MaRDI QIDQ5176948
Publication date: 5 March 2015
Published in: Proceedings of the 15th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1863543.1863585
Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)
Related Items (5)
A mechanisation of some context-free language theory in HOL4 ⋮ Verified decision procedures for MSO on words based on derivatives of regular expressions ⋮ Certified CYK parsing of context-free languages ⋮ Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars ⋮ A type- and scope-safe universe of syntaxes with binding: their semantics and proofs
Uses Software
This page was built for publication: Total parser combinators
