View source for Publications/newton.18.meta

{{Publication
| published = true
| date = 2018-09-14
| authors = Jim Newton, Didier Verna
| title = Recognizing Heterogeneous Sequences by Rational Type Expression
| booktitle = Proceedings of the Meta'18: Workshop on Meta-Programming Techniques and Reflection
| address = Boston, MA USA
| lrdeprojects = Climb
| abstract = We summarize a technique for writing functions which recognize types of heterogeneous sequences in Common Lisp. The technique employs sequence recognition functionsgenerated at compile time, and evaluated at run-time. The technique we demonstrate extends the Common Lisp type system, exploiting the theory of rational languages, Binary Decision Diagrams, and the Turing complete macro facility of Common Lisp. The resulting system uses meta-programming to move an exponential complexity operation from run-time to a compile-time operation, leaving a highly optimized linear complexity operation for run-time.
| lrdestatus = accepted
| lrdenewsdate = 2018-09-14
| lrdepaper = http://www.lrde.epita.fr/dload/papers/newton.18.meta.pdf
| lrdekeywords = rational language, types, lisp, reflection
| nodoi = 
| type = inproceedings
| id = newton.18.meta
| bibtex = 
@InProceedings<nowiki>{</nowiki>	  newton.18.meta,
  author	= <nowiki>{</nowiki>Jim Newton and Didier Verna<nowiki>}</nowiki>,
  title		= <nowiki>{</nowiki>Recognizing Heterogeneous Sequences by Rational Type
		  Expression<nowiki>}</nowiki>,
  booktitle	= <nowiki>{</nowiki>Proceedings of the Meta'18: Workshop on Meta-Programming
		  Techniques and Reflection<nowiki>}</nowiki>,
  year		= 2018,
  address	= <nowiki>{</nowiki>Boston, MA USA<nowiki>}</nowiki>,
  month		= nov,
  abstract	= <nowiki>{</nowiki> We summarize a technique for writing functions which
		  recognize types of heterogeneous sequences in Common Lisp.
		  The technique employs sequence recognition functions,
		  generated at compile time, and evaluated at run-time. The
		  technique we demonstrate extends the Common Lisp type
		  system, exploiting the theory of rational languages, Binary
		  Decision Diagrams, and the Turing complete macro facility
		  of Common Lisp. The resulting system uses meta-programming
		  to move an exponential complexity operation from run-time
		  to a compile-time operation, leaving a highly optimized
		  linear complexity operation for run-time.<nowiki>}</nowiki>,
  lrdestatus	= <nowiki>{</nowiki>accepted<nowiki>}</nowiki>,
  nodoi		= <nowiki>{</nowiki><nowiki>}</nowiki>
<nowiki>}</nowiki>

}}