LetItCrash
  • Articles
  • Leaderboard
  • Register
  • Log in

Articles

All Foundations Learning how to learn Algorithms & theory Concurrency & the BEAM Proofs & logic

Learning how to learn

  • How to read a proof exercise
    Learning how to learn Proofs & logic

Proofs & logic

  • How to read a proof exercise
    Learning how to learn Proofs & logic
  • What is a proof?
    Proofs & logic
  • Truth tables: the logic your code already runs on
    Proofs & logic
  • The named logic laws
    Proofs & logic
  • Algebra you forgot, and why it's the on-ramp to lambda calculus
    Proofs & logic
  • Lambda calculus: a formal system in three rules
    Proofs & logic
  • Induction: the proof pattern recursion already uses
    Proofs & logic
  • The laws hidden in your code: what associativity buys you
    Proofs & logic
  • Why lambda calculus is on this site
    Proofs & logic

We can't find the internet

Attempting to reconnect

Something went wrong!

Attempting to reconnect

Sound continues across pages in this tab. A full reload stops it — click a kind to resume.
Privacy Terms Contact
  • Navigation
  • Articles
  • Leaderboard
  • Register
  • Log in

Exercises

  • From imperative code to FP
  • Refactoring
  • Tracing
  • Abstract foundations
  • Substitutions
  • Functions
  • Logic
  • Language introductions
  • Port JS to Elixir
  • Lua for algorithm practice
  • Elixir for algorithm practice
  • Erlang for algorithm practice
  • Parson Puzzles
  • Practice and recall
  • Menu-pick
  • Swipe
  • Match pairs
  • Bucket Sort
  • Solving real problems
  • Algebraic Laws
  • Reasoning Replays
  • Algorithms
  • Flowcharts
  • Deeper theory
  • Proofs
  • Induction
  • Lambda Calculus
  • Projects
  • take-local
  • Luerl Labs