What now?
So we've covered quite a bit of OCaml syntax such as how to add numbers, write loops, write higher order functions, etc. We've also covered what, abstractly, a first class function might be in other languages, as well as some information about the stack, recursion, etc. So now what?
Well, we can use what we've learned to dig deeper into some interesting theory and its intersection with OCaml.
We'll first attempt to better understand OCaml expressions by learning about the substitution/functional evaluation model. And then we'll explore some cool data structures and algorithms (like self-balancing trees and cool multiplication). And we'll try to get to things like lazy evaluation and infinite streams. So let's click along to see how to use OCaml to learn about cool computer science concepts and why those computer science concepts can make your life faster/easier.
Well, we can use what we've learned to dig deeper into some interesting theory and its intersection with OCaml.
We'll first attempt to better understand OCaml expressions by learning about the substitution/functional evaluation model. And then we'll explore some cool data structures and algorithms (like self-balancing trees and cool multiplication). And we'll try to get to things like lazy evaluation and infinite streams. So let's click along to see how to use OCaml to learn about cool computer science concepts and why those computer science concepts can make your life faster/easier.