Just do it

Gibbons, Jeremy; Hinze, Ralf

doi:10.1145/2034574.2034777

Cited by 24 publications

(2 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Read from left-to-right, these laws serve as a guide for optimisation strategies and normal forms that are used in the high-level optimiser (Section 3.1). The concrete deterministic semantics of (ňŋ) requires some laws that are not generally applicable to all alternatives (Laws 7 and 8) [Gibbons and Hinze 2011].…”

Section: Introductionmentioning

confidence: 99%

Staged selective parser combinators

Willis

Pickering

2020

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Parser combinators are a middle ground between the fine control of hand-rolled parsers and the high-level almost grammar-like appearance of parsers created via parser generators. They also promote a cleaner, compositional design for parsers. Historically, however, they cannot match the performance of their counterparts. This paper describes how to compile parser combinators into parsers of handwritten quality. This is done by leveraging the static information present in the grammar by representing it as a tree. However, in order to exploit this information, it will be necessary to drop support for monadic computation since this generates dynamic structure. Selective functors can help recover lost functionality in the absence of monads, and the parser tree can be partially evaluated with staging. This is implemented in a library called Parsley.

show abstract

Section: Introductionmentioning

confidence: 99%

Staged selective parser combinators

Willis

Pickering

2020

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…They use a variety of effects: state to store the string being parsed; non-determinism to handle backtracking; and general recursion to deal with recursive grammars. Proof techniques, such as equational reasoning, that are commonly used when reasoning about pure functional programs, are less suitable when verifying effectful programs [10,13].…”

Section: Introductionmentioning

confidence: 99%

Combining predicate transformer semantics for effects: a case study in parsing regular languages

Baanen

Swierstra

2020

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

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.

show abstract

Handling Local State with Global State

Pauwels

Schrijvers

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Equational reasoning is one of the most important tools of functional programming. To facilitate its application to monadic programs, Gibbons and Hinze have proposed a simple axiomatic approach using laws that characterise the computational effects without exposing their implementation details. At the same time Plotkin and Pretnar have proposed algebraic effects and handlers, a mechanism of layered abstractions by which effects can be implemented in terms of other effects. This paper performs a case study that connects these two strands of research. We consider two ways in which the nondeterminism and state effects can interact: the high-level semantics where every nondeterministic branch has a local copy of the state, and the low-level semantics where a single sequentially threaded state is global to all branches. We give a monadic account of the folklore technique of handling local state in terms of global state, provide a novel axiomatic characterisation of global state and prove that the handler satisfies Gibbons and Hinze's local state axioms by means of a novel combination of free monads and contextual equivalence. We also provide a model for global state that is necessarily non-monadic.

show abstract

Just do it

Cited by 24 publications

References 36 publications

Staged selective parser combinators

Staged selective parser combinators

Combining predicate transformer semantics for effects: a case study in parsing regular languages

Handling Local State with Global State

Contact Info

Product

Resources

About