Ryder, Chris and Thompson, Simon (1999) Aldor meets Haskell. Technical report. Computing Laboratory, University of Kent
|
Download (157Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)
|
|
| Postscript | ||
|
Download (132Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_postscript.png)
|
|
Abstract
As part of a project to include reasoning capabilities in the Aldor computer algebra system it is necessary to modify the type checking algorithm in Aldor. This paper reports on work to write Aldor abstract syntax trees as elements of Haskell data types, and to implement a prototype modified type checker for Aldor in Haskell.
| Item Type: | Monograph (Technical report) |
|---|---|
| Uncontrolled keywords: | Aldor Haskell dependent type |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 09 Sep 2009 17:17 |
| Last Modified: | 06 Sep 2011 04:04 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/21762 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
