---
tag: SNNY92DV7R
kind: concept
name: Typed lambda calculus
aliases: [typed-lambda-calculi]
sources:
  - wikipedia: en:366208@r1318206586
    locator: Typed lambda calculus
    note: adopted
    mention: wikipedia://en/366208
    sections: [Summary]
same_as:
  wikidata: Q2607208
  wikipedia: Typed lambda calculus
inventory: [Y36786VX03]
---

## Summary

In mathematics and computer science, a **typed lambda calculus** is a typed formalism that uses the lambda symbol ($\lambda$) to denote anonymous function abstraction. In this context, types are usually objects of a syntactic nature that are assigned to lambda terms; the exact nature of a type depends on the calculus considered (see kinds below). From a certain point of view, typed lambda calculi can be seen as refinements of the untyped lambda calculus, but from another point of view, they can also be considered the more fundamental theory and *untyped lambda calculus* a special case with only one type.