recentpopularlog in
« earlier   later »
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
Golang’s Garbage
Looking at the performance cost of Go's GC trade-offs
slides  presentation  golang  gc  performance  filetype:pdf 
october 2018
« earlier      later »
per page:    204080120160

Copy this bookmark:

to read