| EPSRC Reference: |
GR/L89532/01 |
| Title: |
NOTIONS OF COMPUTABILITY FOR GENERAL DATATYPES |
| Principal Investigator: |
Fourman, Professor MP |
| Other Investigators: |
|
| Researcher Co-Investigators: |
|
| Project Partners: |
|
| Department: |
Sch of Informatics |
| Organisation: |
University of Edinburgh |
| Scheme: |
Standard Research (Pre-FEC) |
| Starts: |
01 January 1998 |
Ends: |
31 December 2000 |
Value (£): |
166,087
|
| EPSRC Research Topic Classifications: |
| Fundamentals of Computing |
|
|
| EPSRC Industrial Sector Classifications: |
| No relevance to Underpinning Sectors |
|
|
| Related Grants: |
|
| Panel History: |
|
|
Summary on Grant Application Form |
|
Church's thesis fails at higher types, in the same sense that there are competing, incompatible notions of higher-type computability. The proposed research will investigate classes of computable functions for a range of datatypes, including finite types over the natural numbers, recursive types, abstract types and object classes. It will also consider the more general question of what constitutes an effective datatype. In addition to the theoretical analysis we will investigate the practical applicability of notions of computability. We will do this mainly by via prototype implementations of simple programming languages based on these notions. This will allow us to investigate issues of computational feasibility and efficiency.
|
|
Key Findings |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
|
Potential use in non-academic contexts |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
|
Impacts |
|
| Description |
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk |
| Summary |
|
| Date Materialised |
|
|
|
|
Sectors submitted by the Researcher |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
| Project URL: |
|
| Further Information: |
|
| Organisation Website: |
http://www.ed.ac.uk |