You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Implementing Data Fields in Haskell

Fulltext:


Authors:

Jonas Holmerin

Note:

This report was first published as a MSc thesis at KTH.

Research group:


Publication Type:

Report


Abstract

Indexed data structures such as arrays are basic building blocks in many applications. The data field model is a general semantic model which provides an abstract and homogeneous way of describing such structures and operations on them. A data field is a generalized indexed structure, and is as such a function with explicit information about its domain. Data fields can be seen as partial functions, and this intuition is used to guide the semantics for the operations on data fields.This model for indexed data structures is functional in its design, and is thus natural to include in a functional language. In this thesis, we design and implement a dialect of the functional language Haskell which has been extended with data fields. Since the implementation for practical reasons had to be based on an existing Haskell system, we also evaluate different Haskell system to see how suited they are for such extensions.

Bibtex

@techreport{Holmerin5438,
author = {Jonas Holmerin},
title = {Implementing Data Fields in Haskell},
note = {This report was first published as a MSc thesis at KTH.},
month = {November},
year = {1999},
url = {http://www.es.mdu.se/publications/5438-}
}