Quick Overview: In this tutorial, I will show the basic ideas of immutable lists (cons lists), as well as polymorphic functions that operate over lists. How to implement the `map` functional. Textbook: Hi, I'm Gabrielle! I'm a UPenn Comp Sci student and I'm here to help you understand the
Ocaml Fold Lecture - Detailed Overview & Context
In this tutorial, I will show the basic ideas of immutable lists (cons lists), as well as polymorphic functions that operate over lists. How to implement the `map` functional. Textbook: Hi, I'm Gabrielle! I'm a UPenn Comp Sci student and I'm here to help you understand the Defining a persistent stack data structure as an How to implement a function that counts up with every invocation, using references Textbook: This talk describes the process of generating documentation for every version of every package that can be built from the opam ...
References, or ref cells, are pointers to typed locations in memory. They enable imperative programming. (I'm wearing black in ... Functional data structure do not use imperative features, hence are persistent rather than ephemeral Textbook: ... Structural induction can be used to prove the correctness of functions on trees Textbook:
