• The curious case of exponentiation in simply typed lambda calculus

  • May 4 2024
  • Durée: 7 min
  • Podcast

The curious case of exponentiation in simply typed lambda calculus

Écouter gratuitement

Voir les détails du balado

  • Résumé

  • Like addition and multiplication on Church-encoded numbers, exponentiation can be assigned a type in simply typed lambda calculus (STLC). But surprisingly, the type is non-uniform. If we abbreviate (A -> A) -> A -> A as Nat_A, then exponentiation, which is defined as \ x . \ y . y x, can be assigned type Nat_A -> Nat_(A -> A) -> Nat_A. The second argument needs to have type at strictly higher order than the first argument. This has the fascinating consequence that we cannot define self-exponentiation, \ x . exp x x. That term would reduce to \ x . x x, which is provably not typable in STLC.

    Voir plus Voir moins
Voir plus Voir moins

Ce que les auditeurs disent de The curious case of exponentiation in simply typed lambda calculus

Moyenne des évaluations de clients

Évaluations – Cliquez sur les onglets pour changer la source des évaluations.

Évaluations sur Audible.ca

Évaluations sur Amazon.ca
Il n'y a pas encore de critiques pour ce titre.