Ryder, Chris and Thompson, Simon (1999) Aldor meets Haskell. Technical report. Computing Laboratory, University of Kent (KAR id:21762)
PDF
Language: English |
|
Download this file (PDF/186kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader | |
Postscript
Language: English |
|
Download this file (Postscript/136kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader |
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: | Reports and Papers (Technical report) |
---|---|
Uncontrolled keywords: | Aldor Haskell dependent type |
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Mark Wheadon |
Date Deposited: | 09 Sep 2009 17:17 UTC |
Last Modified: | 05 Nov 2024 10:00 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/21762 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):