Efficient Persistent Haskell

@misc{citeulike:1187137, abstract = {. Persistent programming offers the prospect of seamless integration of programs with long-lived data, offering the prospect of constructing systems that allow more rapid program development, and also simplifying the process of writing applications whose purpose is to handle long-lived data. While there have been some previous attempts to produce persistent functional languages, the majority of these have been interpreted, and performance has generally been seriously compromised. It has...}, author = {Davie, A. and Hammond, K. and Quintela, J. }, citeulike-article-id = {1187137}, keywords = {haskell}, posted-at = {2007-09-01 13:05:31}, priority = {2}, title = {Efficient Persistent Haskell}, url = {http://citeseer.ist.psu.edu/davie98efficient.html}, year = {1998} }

TY - GEN ID - citeulike:1187137 L3 - citeulike-article-id:1187137 TI - Efficient Persistent Haskell N2 - . Persistent programming offers the prospect of seamless integration of programs with long-lived data, offering the prospect of constructing systems that allow more rapid program development, and also simplifying the process of writing applications whose purpose is to handle long-lived data. While there have been some previous attempts to produce persistent functional languages, the majority of these have been interpreted, and performance has generally been seriously compromised. It has... KW - haskell AU - Davie, A AU - Hammond, K AU - Quintela, J PY - 1998/// UR - http://citeseer.ist.psu.edu/davie98efficient.html ER -