Kahrs, Stefan (1996) Limits of ML-definability. In: UNSPECIFIED. (doi:10.1007/3-540-61756-6_74) (KAR id:21337)
|
PDF
Language: English |
|
|
Download this file (PDF/215kB) |
Preview |
| Request a format suitable for use with assistive technology e.g. a screenreader | |
|
Postscript
Language: English |
|
|
Download this file (Postscript/144kB) |
Preview |
| Request a format suitable for use with assistive technology e.g. a screenreader | |
| Official URL: https://doi.org/10.1007/3-540-61756-6_74 |
|
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) |
|---|---|
| DOI/Identification number: | 10.1007/3-540-61756-6_74 |
| Uncontrolled keywords: | ML polymorphism definability recursion |
| 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: | 26 Aug 2009 18:59 UTC |
| Last Modified: | 05 Nov 2024 09:59 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/21337 (The current URI for this page, for reference purposes) |
University of Kent Author Information
Kahrs, Stefan.
| Creator's ORCID: |
 https://orcid.org/0000-0001-5099-9375
|
|---|---|
| CReDIT Contributor Roles: |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Altmetric
Altmetric
