How to replace failure by a list of successes
Proc. of a conference on Functional programming languages and computer architecture
Making form follow function: an exercise in functional programming style
Software—Practice & Experience
On Kleene algebras and closed semirings
MFCS '90 Proceedings on Mathematical foundations of computer science 1990
Infinite objects in type theory
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
Memoization in top-down parsing
Computational Linguistics
Derivatives of Regular Expressions
Journal of the ACM (JACM)
Automata and Coinduction (An Exercise in Coalgebra)
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
On the Semantics of Fair Parallelism
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text
Deterministic, Error-Correcting Combinator Parsers
Advanced Functional Programming, Second International School-Tutorial Text
Observable Sharing for Functional Circuit Description
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
IFL '98 Selected Papers from the 10th International Workshop on 10th International Workshop
Theoretical issues in the implementation of programming languages.
Theoretical issues in the implementation of programming languages.
A categorical programming language
A categorical programming language
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Journal of Functional Programming
Applicative programming with effects
Journal of Functional Programming
Partial Parsing: Combining Choice with Commitment
Implementation and Application of Functional Languages
A Kleene Theorem for Polynomial Coalgebras
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
A Hoare Logic for the State Monad
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Parser combinators for ambiguous left-recursive grammars
PADL'08 Proceedings of the 10th international conference on Practical aspects of declarative languages
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Subtyping, declaratively: an exercise in mixed induction and coinduction
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
TRX: a formally verified parser interpreter
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
IDRIS ---: systems programming meets full dependent types
Proceedings of the 5th ACM workshop on Programming languages meets program verification
Parsing with derivatives: a functional pearl
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
PLPV '12 Proceedings of the sixth workshop on Programming languages meets program verification
Simple, functional, sound and complete parsing for all context-free grammars
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Functional programming with structured graphs
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Fixing idioms: a recursion primitive for applicative DSLs
PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation
Verified decision procedures for MSO on words based on derivatives of regular expressions
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Correct-by-construction pretty-printing
Proceedings of the 2013 ACM SIGPLAN workshop on Dependently-typed programming
A mechanisation of some context-free language theory in HOL4
Journal of Computer and System Sciences
| Hi-index | 0.00 |
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.