recentpopularlog in

jabley : haskell   118

« earlier  
FUNCTIONAL PEARL Parsing Permutation Phrases
A permutation phrase is a sequence of elements (possibly of different types) in which
each element occurs exactly once and the order is irrelevant. Some of the permutable
elements may be optional. We show a way to extend a parser combinator library
with support for parsing such free-order constructs. A user of the library can easily
write parsers for permutation phrases and does not need to care about checking and
reordering the recognised elements. Possible applications include the generation of
parsers for attributes of XML tags and Haskell’s record syntax.
parsing  filetype:pdf  paper  haskell  functional-programming  combinators 
november 2018 by jabley
Monads for functional programming
The use of monads to structure functional programs is described.
Monads provide a convenient framework for simulating effects
found in other languages, such as global state, exception handling, output,
or non-determinism. Three case studies are looked at in detail: how
monads ease the modification of a simple evaluator; how monads act as
the basis of a datatype of arrays subject to in-place update; and how
monads can be used to build parsers.
functional  monads  monad  programming  paper  comp-sci  cs  filetype:pdf  functional-programming  haskell 
july 2016 by jabley
« earlier      
per page:    204080120160

Copy this bookmark:

to read