Pages that link to "Simply typed lambda calculus"
Showing 50 items.
- Currying (links | edit)
- Church–Turing thesis (links | edit)
- Functional programming (links | edit)
- Lambda calculus (links | edit)
- Turing completeness (links | edit)
- Type theory (links | edit)
- Alonzo Church (links | edit)
- Tuple (links | edit)
- Church–Rosser theorem (links | edit)
- Fixed-point combinator (links | edit)
- Curry's paradox (links | edit)
- Intuitionistic logic (links | edit)
- Subtyping (links | edit)
- Cartesian closed category (links | edit)
- Curry–Howard correspondence (links | edit)
- Type inference (links | edit)
- List of mathematical logic topics (links | edit)
- Typed lambda calculus (links | edit)
- Typing rule (links | edit)
- Function type (links | edit)
- Eval (links | edit)
- System F (links | edit)
- Categorial grammar (links | edit)
- Lambda cube (links | edit)
- Categorical logic (links | edit)
- Logic in computer science (links | edit)
- First-class function (links | edit)
- Joachim Lambek (links | edit)
- Simply-typed lambda calculus (redirect page) (links | edit)
- Greek letters used in mathematics, science, and engineering (links | edit)
- Dependent type (links | edit)
- William Alvin Howard (links | edit)
- Simply typed lambda (redirect page) (links | edit)
- Hom functor (links | edit)
- Church encoding (links | edit)
- Ternary relation (links | edit)
- Meta-circular evaluator (links | edit)
- Normal form (abstract rewriting) (links | edit)
- Robert Feys (links | edit)
- Generalized algebraic data type (links | edit)
- POPLmark challenge (links | edit)
- Normalisation by evaluation (links | edit)
- Apply (links | edit)
- Substructural type system (links | edit)
- Type inhabitation (links | edit)
- Markov's principle (links | edit)
- Judgment (mathematical logic) (links | edit)
- Pure type system (links | edit)
- Richard Statman (links | edit)
- Gérard Huet (links | edit)