<p>That sounds pretty awesome to me.</p>
<p>Have you given any thought as to how you want to approach versioning?</p>
<p>Maybe I'm asking a silly question - I have very little real world experience with relation databases and how to version schemas.</p>
<p>Antoine</p>
<p>On Sep 25, 2010 2:31 PM, "Jonathan Geddes" <<a href="mailto:geddes.jonathan@gmail.com">geddes.jonathan@gmail.com</a>> wrote:<br type="attribution">> Cafe,<br>> <br>> HaskellDB takes a database schema and produces Haskell data structures<br>
> (plus some other query-related stuff for its EDSL query language).<br>> <br>> What I'm looking for is the inverse of this functionality. I want to<br>> create tables based on a Haskell data structure with a few simple<br>
> rules. These rules include: if a field is not of the form `Maybe a'<br>> then it can't be nullable in the database. If a field is not a<br>> primitive (in the database) then it is actually stored in another<br>
> table and a reference id is stored in the table. Tables are produced<br>> recursively, unless they already exist, etc.<br>> <br>> The HaskellDB approach is great for interfacing with existing tables,<br>> but in my case I already have data structures and now I would like a<br>
> quick way to create tables to persist them.<br>> <br>> Does such a thing exist? If not, would you find it useful? I may take<br>> this up as a side project if it does not already exist and others<br>> would find it useful.<br>
> <br>> Thanks,<br>> <br>> --Jonathan<br>> _______________________________________________<br>> Haskell-Cafe mailing list<br>> <a href="mailto:Haskell-Cafe@haskell.org">Haskell-Cafe@haskell.org</a><br>
> <a href="http://www.haskell.org/mailman/listinfo/haskell-cafe">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br></p>