-
Related https://github.com/at15/papers-i-read/issues/76
Read (I don't think I can write from scratch ...
- [x] 4 An ML Implementation of Arithmetic Expression 6292de6ce2447879884d48fa63bf54d1d3b…
-
It should be possible to use a Boolean value directly as an operator, behaving the same way it would if it were the first operand to the "choice" operator (i.e. true = λxy.x and false = λxy.y).
-
Before we go too far down the path of building a traditional compiler (#9), it probably makes sense to start thinking about how we might incrementalise things. This will be super important for support…
-
``` python
f = 2*x/(3+log((Abs(x-1)))-log((Abs(x-3))))
>>> nsolve(f.diff(), x, 0)
Traceback (most recent call last):
File "", line 1, in
File "/base/data/home/apps/s~sympy-live-hrd/45.380685391…
-
Dear Victor,
In "An Algorithm for Optimal Lambda Calculus Reduction" on page 5 Lamping writes "An obvious idea is to label the fans in the graph, with fans paired if and only if they have identical l…
-
I'm probably one of the biggest Haskell fanboys alive: I [blog about Haskell](haskellforall.com) and also maintain several [Haskell packages](https://hackage.haskell.org/user/GabrielGonzalez). I beli…
-
We’ve had good results with passes transforming one sum of terms into another, e.g. desugaring and elaboration. We could do the same thing for erasable syntax, which would include types and eventually…
-
The Scott encoding is an important tool that is ultimately necessary for many efficient algorithms on the untyped lambda calculus. It is impossible to encode Scott encoded values on Morte. Things such…
-
Certainly! Let's start with the definition of the Y combinator in a lambda calculus-like notation:
```
Y = λf. (λx. f (x x)) (λx. f (x x))
```
Now, let's expand this into a chat template that repres…
-
https://en.wikipedia.org/wiki/Church_encoding
math-o-matic 프로그램이 자동으로 정리를 증명해 줄 것이다.