Kahrs, Stefan (1996) Limits of ML-definability. In: UNSPECIFIED.
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 > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group|
|Depositing User:||Mark Wheadon|
|Date Deposited:||26 Aug 2009 18:59|
|Last Modified:||06 Sep 2011 03:50|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/21337 (The current URI for this page, for reference purposes)|
- Depositors only (login required):