simplytyped
Simplytyped, in the context of logic and computer science, refers to the simply typed lambda calculus (STLC). STLC is a typed version of the lambda calculus that assigns a simple type to every term, preventing ill‑formed expressions such as applying a non-function to an argument. The basic idea is to separate terms into base types and function types, so every term has a well-defined type.
Terms in STLC are built from variables, abstractions, and applications. Types are either base types (such as
STLC enjoys type safety: well-typed terms do not get stuck, and every well-typed term terminates (strong normalization).