-
Coq built with `-O3` has an instance of a constant access to a field of a non block.
This can be
- Some untyped (or GADT) dead code
- Some bug in the compiler
- Some `Obj.magic` related bug
I wish i…
-
:uk:lize chapter 1 - lambda, revise and fix typo by the way
-
# Description
### What is this talk about?
Lambda Calculus is the theoretical basis for functional programming techniques utilized by Bitcoin scripting languages such as Simplicity and programmi…
-
### Related Issues or PRs
As mentioned in #190
### What
As @twentylemon suggests in #190, add an aside for `spliterator` which discusses (a) streams, (b) parallel, and (c) a tad functional stuf…
-
https://arxiv.org/pdf/2003.13542.pdf
-
[Write You a Haskell ( Stephen Diehl )](http://dev.stephendiehl.com/fun/)
- [x] Chapter 1: Introduction
- [x] Chapter 2: Haskell Basics
- [x] Chapter 3: Parsing
- [ ] Chapter 4: Lambda Calculus
- [ ] …
-
```
F = lambda z: (2/pi)*integral((4*cos(x)^2-1)^z*sin(x)^2,x,0,pi)
print F(1/2)
...
RuntimeError: ECL says: Error executing code in Maxima:
sage: a=numerical_integral(real(2/pi*(4*cos(x)^2-1)^(.5…
-
A limiter for the number of nodes would be useful when working with explosive patterns. There should be a limit for the number of nodes on screen, pausing when that threshold is reached. There should …
-
- 1D/2D/nD: `(map f . map g = map (f . g)`
- 2D: `transpose . transpose = id`
- 1D/2D: `extract subview (fill const t) = fill const (extract subview t)`.
Doing the last one (extract and fill co…
-
zero f x = x
one f x = f x
two f x = ... one ... ??? WTF
inc n = ... (n + 1) ... WTF?!?!