Kahrs, Stefan (1996) Limits of ML-definability. In: UNSPECIFIED. (KAR id:21337)
|
PDF
Language: English |
||
|
Download (350kB)
Preview
|
|
|
|
This file may not be suitable for user of assistive technology. Request an accessible format. |
||
|
Postscript
Language: English |
||
|
Download (144kB)
Preview
|
|
|
|
This file may not be suitable for user of assistive technology. Request an accessible format. |
||
Abstract
It is well-known that the type system of ML is overly restrictive in its handling of recursion: certain intuitively sound emphterms do not pass ML's type-check. We formalise this intuition and show that the restriction is semantical: there are computable (semantical) emphfunctions which cannot be expressed by well-typed (syntactical) terms.
| Item Type: | Conference or workshop item (UNSPECIFIED) |
|---|---|
| Uncontrolled keywords: | ML polymorphism definability recursion |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Sciences > School of Computing > Theoretical Computing Group |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 26 Aug 2009 18:59 UTC |
| Last Modified: | 06 May 2020 03:04 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/21337 (The current URI for this page, for reference purposes) |
| Kahrs, Stefan: |  https://orcid.org/0000-0001-5099-9375 |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Download Statistics
Download Statistics