15312 Foundations Of Programming Languages File

| Term | Definition | |------|-------------| | | Tree representation ignoring parentheses and precedence. | | Substitution | ( [e/x]e' ) = replace free occurrences of ( x ) in ( e' ) with ( e ), avoiding capture. | | Canonical Forms | If ( v : \tau_1 \rightarrow \tau_2 ), then ( v ) must be a lambda abstraction. | | Contextual Equivalence | ( e_1 \approx e_2 ) iff for all contexts ( C[,] ), ( C[e_1] \Downarrow v ) iff ( C[e_2] \Downarrow v ). |

To the uninitiated, might look like an arbitrary alphanumeric code. To computer science students, particularly those at Carnegie Mellon University (CMU), it represents a rite of passage. 15-312 (often stylized as 15-312) is the legendary undergraduate/grad course that separates "coders" from "computer scientists." 15312 foundations of programming languages

This leads to the concept of —proving that code behaves correctly, which is the foundation of safety-critical systems in aviation, medicine, and finance. | Term | Definition | |------|-------------| | |