System F is a typed lambda calculus that introduces universal quantification over types, forming the theoretical basis for languages such as Haskell and ML. It has variables ranging over terms and types, and binders for them. System F is strongly normalizing but type inference is undecidable. The "F" in System F was picked by chance.
Carnegie Mellon University
Spring 2014
A comprehensive course at Carnegie Mellon University that introduces fundamental principles of programming language design and implementation from a mathematical perspective. It delves deep into the structural and dynamic aspects of programming languages, studying concepts like recursion, objects, polymorphism, and parallelism.
No concepts data
+ 38 more concepts