Skip to content

Milestones and todos

Jump to bottom
Emil Soman edited this page Nov 1, 2020 · 2 revisions

Milestone 1

Write simple programs that deal with stdin/out. Our exercise would be to implement the following algorithms from the "Introduction to Algorithms" (a.k.a CLRS) book:

  • Bubble sort
  • Quick sort
  • Binary search tree
  • Red Black tree
  • Dijkstra's shortest path

TODO:

  1. Custom types
  2. Lambdas
  3. case with pattern matching (Elm like)
  4. Side effects (stdin/out)
  5. Standard library modules for List and Map
  6. Allow recursion (and mutual recursion) in functions and types
  7. Anything else needed for our exercise

Where we're going after Milestone 1:

  • Managing projects (dependencies and compilation)
  • Processes and OTP
  • Build CRUD API endpoints
  • Modern observability and debugging tools
  • Feature flags and live deployments
  • IDE integrations
Clone this wiki locally