Skip to content
Programming Language Theory Concept

Arrow type

Books JourneyProgramming Language Theory Statuslearning Tags
  • formal system
  • language feature design
  • type theory

This generalization unifies simple function types, universal types (forallalpha.T), and dependent function types under a single constructor.

  • In simple type systems: T1→T₂, classifying functions from T1 to T2, where the result type is independent of the input.

  • In Pure type systems: generalized to the Dependent type product Π(x:T1).T2, where the result type T2 may depend on the input value x.

  • The simple arrow T1→T2 is the special case where T2 does not mention x.

This generalization unifies simple function types, universal types (∀α.T), and dependent function types under a single constructor.