Kahrs, Stefan (1996) Limits of ML-definability. In: UNSPECIFIED. (doi:10.1007/3-540-61756-6_74) (KAR id:21337)
PDF
Language: English |
|
Click to download this file (215kB)
Preview
|
Preview |
This file may not be suitable for users of assistive technology.
Request an accessible format
|
|
Postscript
Language: English |
|
Click to download this file (144kB)
Preview
|
Preview |
This file may not be suitable for users of assistive technology.
Request an accessible format
|
|
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: | 09 Mar 2023 11:29 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/21337 (The current URI for this page, for reference purposes) |
Kahrs, Stefan: |
![]() |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):