Editing Type Theory (section)

== <span style="color: #FFFFFF;">Remembering</span> ==
* '''Type Theory''' — A formal system in which every term has a "Type" that determines the operations that can be performed on it.
* '''Type''' — A classification of data (e.g., `Int`, `Bool`, `String`).
* '''Term''' — A specific instance of a type (e.g., `5` is a term of type `Int`).
* '''Type Inference''' — The ability of a computer to "Guess" the type of a variable based on how it is used.
* '''Polymorphism''' — When a single function can work on "Multiple Types" (e.g., a function that "Sorts" a list of numbers OR a list of names).
* '''Dependent Types''' — Types that "Depend" on values (e.g., "A list of length N," where N is a specific number).
* '''Russell’s Paradox''' — The discovery that "The set of all sets that don't contain themselves" leads to a logical contradiction—which type theory was designed to solve.
* '''The Curry-Howard Correspondence''' — The deep discovery that "A Program is a Proof" and "A Type is a Theorem."
* '''Strongly Typed''' — A language where the computer "Strictly enforces" type rules (it won't let you do something "Illegal" with a type).
* '''Algebraic Data Types (ADTs)''' — Complex types built by "Adding" or "Multiplying" simpler types together.
</div>

<div style="background-color: #006400; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">