fa.caml minor discussion on Lists
: 1 | - ocamlFunctional lists and deques from chap 7
Functional lists and deques from chapter 7 of the Purely Functional Data structures
: 1 | - ocamlExample queue implementations For cs7963, Spring 2005 Robert Ricci Some of these data structures come from the book: "Purely Functional Data Structures", by Chris Okasaki Another good resource (paricularly for ocaml's lazy evaluation
: 1 | - ocamlOcaml Lazy Lists- An Introduction
In Ocaml, the keyword lazy is used before an expression to capture the expression as a lazy thunk. The function Lazy.force can be used to then force the lazy thunk and return the value. An example of this makes things more clear. One advantage Ocaml has
: 1 | lazy - - ocaml