Clowns to the left of me, jokers to the right (pearl): dissecting data structures

Reference. Clowns to the left of me, jokers to the right (pearl): dissecting data structures

Conor McBride · POPL · 2008 · generic-programming · PDF · DOI · pldb

Cite

Cite as @mcbride-2008-clowns (helia, typst) · \cite{mcbride-2008-clowns} (LaTeX)

BibTeX

bibtex · 1 line

@inproceedings{mcbride-2008-clowns, series={POPL08}, title={Clowns to the left of me, jokers to the right (pearl): dissecting data structures}, url={http://dx.doi.org/10.1145/1328438.1328474}, DOI={10.1145/1328438.1328474}, booktitle={Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages}, publisher={ACM}, author={McBride, Conor}, year={2008}, month=Jan, pages={287–295}, collection={POPL08} }

hayagriva YAML (typst)

yaml · 16 lines

mcbride-2008-clowns:
  type: article
  title: 'Clowns to the left of me, jokers to the right (pearl): dissecting data structures'
  author: McBride, Conor
  date: 2008-01
  page-range: 287-295
  url: http://dx.doi.org/10.1145/1328438.1328474
  serial-number:
    doi: 10.1145/1328438.1328474
  parent:
    type: proceedings
    title: Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
    publisher: ACM
    parent:
      type: proceedings
      title: POPL08

Download: mcbride-2008-clowns.bib · mcbride-2008-clowns.yml

Cites 19 works (2 here)

With notes (2)

Datatype-Generic Programming gibbons-2007-datatypeDatatype-Generic Programming · 2007

DOI

Derivatives of Regular Expressions brzozowskiDerivativesRegularExpressions1964JACM · 1964

Kleene’s regular expressions, which can be used for describing sequential circuits, were defined using three operators (union, concatenation and iterate) on sets of sequences. Word descriptions of problems can be more easily put in the regular expression language if the language is enriched by the inclusion of other logical operations. However, in the problem of converting the regular expression description to a state diagram, the existing methods either cannot handle expressions with additional operators, or are made quite complicated by the presence of such operators.In this paper the notion of a derivative of a regular expression is introduced and the properties of derivatives are discussed. This leads, in a very natural way, to the construction of a state diagram from a regular expression containing any number of logical operators.

DOI

External (17)

Containers: Constructing strictly positive types (2005)
∂ for data: differentiating data structures (2005)
Type-indexed data types (2004)
A functional correspondence between evaluators and abstract machines (2003)
Static prediction of heap space usage for first-order functional programs (2003)
Faking it: simulating dependent types in Haskell (2002)
Fun with functional dependencies (2001)
A functional notation for functional dependencies (2001)
The derivative of a regular type is its type of one-hole contexts (2001)
de Bruijn notation as a nested datatype (1999)
The Zipper (1997)
PolyP—a polytypic programming language extension (1997)
Algebra of programming (1997)
Type classes: an exploration of the design space (1997)
How to make ad-hoc polymorphism less ad hoc (1989)
Foncteurs analytiques et espèces de structures (1986)
Toposes, triples and theories (1984)