What can I do?

buscador
Discover
Carrito Total 0 0

226539 materialEducativo

textoFiltroFicha
  • I like 0
  • Visits 1
  • Comments 0
  • Save to
  • Actions

About this resource...

Simply typed lambda calculus
Dbpedia
Wikipedia articleDbpedia source
The simply typed lambda calculus (), a formof type theory, is a typed interpretation of the lambda calculus with only one type constructor: that builds function types. It is the canonical and simplest example of a typed lambda calculus. The simply typed lambda calculus was originally introduced by Alonzo Church in 1940 as an attempt to avoid paradoxical uses of the untyped lambda calculus, and it exhibits many desirable and interesting properties. The term simple type is also used to refer to extensions of the simply typed lambda calculus such as products, coproducts or natural numbers (System T) or even full recursion (like PCF). In contrast, systems which introduce polymorphic types (like System F) or dependent types (like the Logical Framework) are not considered simply typed. The former, except full recursion, are still considered simple because the Church encodings of such structures can be done using only and suitable type variables, while polymorphism and dependency cannot.

Conceptual map: Cálculo lambda simplemente tipado

Exclusive content for members of

D/i/d/a/c/t/a/l/i/a
Sign in

Mira un ejemplo de lo que te pierdes

Categories:

Tags:

Fecha publicación: 19.3.2021

Comment

0

Do you want to comment? Sign up or Sign in

Join Didactalia

Browse among 226539 resources and 574237 people

Regístrate >

O conéctate a través de:

Si ya eres usuario, Inicia sesión

Do you want to access more educational content?

Sign in Join a class
x

Add to Didactalia Arrastra el botón a la barra de marcadores del navegador y comparte tus contenidos preferidos. Más info...

Game help
Juegos de anatomía
Selecciona nivel educativo