CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Typed logical variables in Haskell

Koen Claessen (Institutionen för datavetenskap) ; Peter Ljunglöf (Institutionen för datavetenskap)
Electronic Notes in Theoretical Computer Science Vol. 41 (2000), 1,
[Artikel, refereegranskad vetenskaplig]

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. To get full static typing we need to use the Haskell extensions of quantified types and the ST-monad.

Denna post skapades 2009-10-07. Senast ändrad 2011-11-11.
CPL Pubid: 99880


Läs direkt!

Lokal fulltext (fritt tillgänglig)

Institutioner (Chalmers)

Institutionen för datavetenskap (1993-2001)


Teoretisk datalogi

Chalmers infrastruktur