WG211/DomainSpecificTypes
From WG 2.11
Revision as of 10:19, 1 December 2011 by Twiki (talk) (Created page with "Category:WG211 ==Domain Specific Types.== Oege de Moor. ''Abstract'' Little languages allow richer type systems. I'll illustrate this by considering type systems for Da...")
Domain Specific Types.
Oege de Moor.
Abstract
Little languages allow richer type systems. I'll illustrate this by considering type systems for Datalog, a query language that allows recursion but which is not Turing complete. Because of its restricted nature, one can infer very precise types; the method for doing so is a generalization of Quine's method of computing prime implicants. This is joint work with Max Schaefer, Damien Sereni, Pavel Avgustinov and Mathieu Verbaere.
