Skip to main content
Kent Academic Repository

Limits of ML-definability

Kahrs, Stefan (1996) Limits of ML-definability. In: UNSPECIFIED. (doi:10.1007/3-540-61756-6_74) (KAR id:21337)


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: (The current URI for this page, for reference purposes)

University of Kent Author Information

  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.