Queen's University - Utility Bar

QSpace at Queen's University >
Theses, Dissertations & Graduate Projects >
Queen's Theses & Dissertations >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1974/1237

Title: Using Haskell to Implement Syntactic Control of Interference
Authors: Warren, Jared

Files in This Item:

File Description SizeFormat
warren_jared_200806_msc.pdf603.96 kBAdobe PDFView/Open
Keywords: programming
type system
interference
haskell
embedding
definitional interpreter
denotational semantics
domain-specific language
imperative
functional
Issue Date: 2008
Series/Report no.: Canadian theses
Abstract: Interference makes reasoning about imperative programs difficult but it can be controlled syntactically by a language's type system, such as Syntactic Control of Interference (SCI). Haskell is a purely-functional, statically-typed language with a rich type system including algebraic datatypes and type classes. It is popular as a defining language for definitional interpreters of domain-specific languages, making it an ideal candidate for implementation of definitional interpreters for SCI and Syntactic Control of Interference Revisited (SCIR), a variant that improves on SCI. Inference rules and denotational semantics functions are presented for PCF, IA, SCI, and SCIR. An extension to Haskell98 is used to define Haskell functions for those languages' semantics and to define type constructions to statically check their syntax. The results in applied programming language theory demonstrate the suitability and techniques of Haskell for definitional interpretation of languages with rich type systems.
Description: Thesis (Master, Computing) -- Queen's University, 2008-06-10 21:23:33.291
URI: http://hdl.handle.net/1974/1237
Appears in Collections:Computing Graduate Theses
Queen's Theses & Dissertations

Items in QSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

  DSpace Software Copyright © 2002-2008  The DSpace Foundation - TOP