Last active
September 4, 2020 13:03
-
-
Save 01speed1/22689bc5d7164fa2b2f622ee73bba6f8 to your computer and use it in GitHub Desktop.
Reto 28/8/2020 Functional programing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Dadas las siguientes funciones: | |
f(x)=xx+1; g(t)=11; h(m,n)=g(m)-f(n) | |
Resuelva | |
f(3) | |
g(11) | |
g(12) | |
h(3,4) | |
Eliminando el nombre de la funcion, evalue | |
((x)=xx+1)(3) | |
((t)=11)(11) | |
((t)=11)(12) | |
( (m,n)=( (t)=11 )(m) - ( (x)=xx+1 )(n) )(3,4) | |
En las siguientes expresiones se usa el caracter `λ` para denotar la letra griega Lambda, evalue cada expresión | |
(λx.xx+1) 3 | |
(λt.11) 11 | |
(λt.11) 12 | |
Dadas las siguientes expresiones | |
f: (λx.xx+1) | |
g: (λt.11) | |
h: (λm.λn.gm-fn) | |
Evalúe | |
f 3 | |
g 11 | |
g 12 | |
h 3 4 | |
Demuestre matematicamente que las siguientes expresiones son equivalentes | |
(λt.λf.f)mn == (λx.x)(λx.x)n |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment