Typed logical variables in Haskell Export

@misc{citeulike:310660, abstract = {We describe how to embed a simple typed functional logic programming language in Haskell. The embedding is a natural extension of the Prolog embedding by Seres and Spivey [16]. To get full static typing we need to use the Haskell extensions of quantified types and the ST-monad. 1 Introduction Over the last ten to twenty years, there have been many attempts to combine the flavours of logic and functional programming [3]. Among these, the most well-known ones are the programming languages...}, author = {Claessen, K. and Ljungl, P.}, citeulike-article-id = {310660}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.2565}, keywords = {embedding, haskell, logic-programming}, posted-at = {2005-09-02 04:38:45}, priority = {0}, title = {Typed logical variables in Haskell}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.2565}, year = {2000} }

TY - GEN ID - citeulike:310660 L3 - citeulike-article-id:310660 N2 - We describe how to embed a simple typed functional logic programming language in Haskell. The embedding is a natural extension of the Prolog embedding by Seres and Spivey [16]. To get full static typing we need to use the Haskell extensions of quantified types and the ST-monad. 1 Introduction Over the last ten to twenty years, there have been many attempts to combine the flavours of logic and functional programming [3]. Among these, the most well-known ones are the programming languages... TI - Typed logical variables in Haskell KW - embedding KW - haskell KW - logic-programming AU - Claessen, K AU - Ljungl, P PY - 2000/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.2565 ER -