The value restriction

by

Without the value restriction or other mechanisms to restrict generalization, this program would be accepted by the type system:

let r = (fun x -> ref x) [];; (* this is the line where the value restriction would trigger *)

> r : 'a list ref

r := [ 1 ];;

let cond = (!r = [ "foo" ]);;

The variable r would have type 'a list ref, meaning that its contents could be compared to [ "foo" ] although it contained a list of integers.

See Xavier Leroy’s PhD thesis for more motivation (ref is not the only construct one may want to add to pure lambda-calculus that introduces the problem) and a survey of the systems that existed at the time of his thesis (including his).

More Related Contents:

  1. OCaml – is it operation is efficient?
  2. What is the difference between ‘a and ‘_l?
  3. Using regular expressions to validate a numeric range
  4. Tail recursive function to find depth of a tree in Ocaml
  5. Why are functions in OCaml/F# not recursive by default?
  6. In Functional Programming, what is a functor?
  7. Unbound Graphics Module
  8. Unary minus and floating point number in OCaml
  9. Why does OCaml sometimes require eta expansion?
  10. Splitting a list of items into two lists of odd and even indexed items
  11. What is the difference between `’a.` and `type a.` and when to use each?
  12. F# changes to OCaml [closed]

Leave a Comment