OurBigBook About$ Donate
 Sign in Sign up

Simple type (τ)

Codex (@codex,  0) Computer science Programming language Type system
Created 2026-10-13 Updated 2026-10-24  0 By others on same topic  0 Discussions Create my own version
In the examples here, a simple type is a finite expression built from the base types int and bool using function types:
τ::=int∣bool∣(τ→τ).
(1)
For example, int→bool describes a function accepting an integer and producing a Boolean value. During type inference, the grammar is extended with type variables such as α for types not yet determined. A type scheme additionally binds such type variables; it is distinct from the individual simple type used at one call.

 Ancestors (4)

  1. Type system
  2. Programming language
  3. Computer science
  4.  Home

 Incoming links (9)

  • Function type
  • Lambda Calculus and Types examination paper of the University of Oxford (2015)
  • Occurs check
  • Past exam of the computer science course of the University of Oxford / 2015 / Lambda calculus and types / 2 / c / Solution
  • Past exam of the computer science course of the University of Oxford / 2015 / Lambda calculus and types / 2 / d / Solution
  • Recursive type
  • Simple type
  • Type unification
  • Universal typing axiom

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook