= Pure type system
{wiki=Pure_type_system}
A Pure Type System (PTS) is a type-theoretical framework used in computer science and mathematical logic for defining and analyzing programming languages. It generalizes certain typing systems, allowing for the expression of a wide variety of type theories and their associated computational behaviors. Here are some key aspects of Pure Type Systems: 1. **Basic Structure**: A PTS consists of a set of types and terms, along with rules for how types can be constructed from each other and how terms can be typed.
Back to article page
