I\'m starting to learn lambda calculus and I need to implement I, S, K combinators in Erlang. Of course, S, K, I stands for:
I 开发者_JAVA百科have this lambda lambda expression : λx.(λy.(λz.x(yz))) I\'m trying to write a Scheme expression out of it.
I gotta solve a lambda calculus problem. I reached certain point and I don´t know how to continue: h f x = \\g -> g (f x g)
I\'m trying to learn the Y-combinator better (I sort of understand it in Scheme) and implement it in D 2.0, and I\'m failing pretty miserably:
I\'m attempting to implement church numerals in Haskell, but I\'ve hit a minor problem. Haskell complains of an infinite type with
I am kinda new to Ruby and still trying to understand some of the language design principles. IF I\'ve got it right, the lambda expression call in Ruby must be with square brac开发者_JS百科es, while t
I\'m working my way through Types and Programming Languages, and Pierce, for the call by value red开发者_如何学JAVAuction strategy, gives the example of the term id (id (λz. id z)). The inner redex i
I am new to lambda开发者_如何学C calculus and struggling to prove the following. SKK and II are beta equivalent.
I\'m looking at the tutorial http://haskell.org/haskellwiki/How_to_write_a_Haskell_program import System.Environment
I ha开发者_开发知识库ve a function like this iter :: Int -> (a -> a) -> a -> a iter n f a = f (f ... (f a) .. )
加载中,请稍侯......