For the function monad I find that (<*>) and (>>=)/(=<<) have two strikingly similar types. In particular, (=<<) makes the sim ...
For the function monad I find that (<*>) and (>>=)/(=<<) have two strikingly similar types. In particular, (=<<) makes the sim ...
I was reading the following Wikipedia page on combinatory logic and am puzzled by the example that is given: https://en.wikipedia.org/wiki/Combinatory ...
I was tasked with showing that S(KK)I = K Now since S takes three arguments, I was simply stuck at the beginning not knowing how to tackle this. I ...
While learning Haskell, I came across a challenge to find two functions f and g, such that f g and f . g are equivalent (and total, so things like f = ...
In a previous question SystemT Compiler and dealing with Infinite Types in Haskell I asked about how to parse a SystemT Lambda Calculus to SystemT Com ...
I'm following this blog post: http://semantic-domain.blogspot.com/2012/12/total-functional-programming-in-partial.html It shows a small OCaml compile ...
Projection functions such as id (1P1) and const (2P1) are very useful in functional programming. However, sometimes you need more complex projection f ...
I am trying to solve sure but can you SKI on codewars. It is about to express lambda in SKI combinators. Source is at https://repl.it/@delta4d/SKI. A ...
I have question about SKI-Combinators. Can XOR (exclusive or) be expressed using S and K combinators only? I have where ...
I am trying to implement a probabilistic ccg with lambda-calculus features. Basically i want to do the following code: but existing CCG implementa ...
Concept I am implementing an interpreter that allows a user to define arbitrary combinators and apply them to arbitrary terms. For example, a user ma ...
As an exercise, I converted the following combinator to point-free notation: with the usual convention of f, g, h as functions, and x, y, z as expr ...
While searching for information on Raymond Smullyan's To Mock a Mockingbird, I stumbled upon Stephen Tetley's Haskell code for the basic combinators. ...
Given a callable object ( a function ) a, and an argument b ( or a series of arguments ), I would like to deduce the type returned from f considering ...
I am trying trying to implement Combinatory Logic in Haskell, and I would like to write to parser for the language. I am having trouble getting a pars ...
I now understand the type signature of s (s k): And I can create examples that work without error in the Haskell WinGHCi tool: Example: return ...
Consider this combinator: Apply it to the arguments X Y: It contracts to: I converted S (S K) to the corresponding Lambda terms and got this ...
I was fiddling with Cominators in JavaScript and was being proud of (hopefully) getting S to work when I stumbled upon Wikipedia saying: "The Y combin ...
I'm trying out a very light-weight encoding of combinator calculus in scala. Initially, I'm simply implementing the S and K combinators, application a ...