Total parser combinators
Total parser combinators
复制标题
总解析器组合器
DOI:
10.1145/1932681.1863585
复制
发表时间:
2010
影响因子:
--
通讯作者:
Danielsson N
中科院分区:
文献类型:
--
作者:
Danielsson N
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is similar to those of many other parser combinator libraries, with two important differences: one is that the interface clearly specifies which parts of the constructed parsers may be infinite, and which parts have to be finite, using dependent types and a combination of induction and coinduction; and the other is that the parser type is unusually informative.The library comes with a formal semantics, using which it is proved that the parser combinators are as expressive as possible. The implementation is supported by a machine-checked correctness proof.
登录
查看更多内容
影响因子:
1.1
作者:
Graham Hutton
通讯作者:
Graham Hutton
DOI:
--
发表时间:
2010
期刊:
Log. Methods Comput. Sci.
影响因子:
--
作者:
A. Koprowski;Henri Binsztok
通讯作者:
Henri Binsztok
DOI:
--
发表时间:
2009
期刊:
Foundations of Software Science and Computation Structure
影响因子:
--
作者:
M. Bonsangue;J. Rutten;Alexandra Silva
通讯作者:
Alexandra Silva
DOI:
--
发表时间:
2010
期刊:
PAR@ITP
影响因子:
--
作者:
Thorsten Altenkirch;Nils Anders Danielsson
通讯作者:
Nils Anders Danielsson
影响因子:
--
作者:
A. Mazurkiewicz
通讯作者:
A. Mazurkiewicz