-
Go and Algebraic Data Types
https://ift.tt/2MtEOi0
Eli Bendersky
Algebraic data types (also known as variant types, sum types or discriminated unions) is a neat feature of some programming language…
-
I've been thinking for a while about how to "correctly" implement modular arithmetic, such that it is:
- Easy to prove properties about
- Easily extensible to other rings (e.g. polynomials over the …
-
Here is some lore about abstraction and modularity mechanisms in Coq and Lean which I think may be relevant for setting conventions for stdlib2:
- example of where module functors are not good for …
-
This ticket adds a preliminary Sage package for CGAL, the Computational Geometry Algorithms Library. http://www.cgal.org/index.html
It is a huge package. My main interest, right now, comes from a n…
-
Venture has somewhat kooky handling of the creation of SPs. To wit, when applying a (P)SP A returns to Venture an SP object B (which actually has to be returned as a `VentureSPRecord` object), Ventur…
-
# @chrlschn - React is the New IBM
You’ll never get fired for picking it, but it’s going to be expensive, bloated, difficult to get right, and joyless every step of the way.
[https://chrlschn.dev/bl…
-
We need to populate the recent publications page with recent papers. We need the authors list, abstract, link to pdf, downloaded pdf, and a figure for the preview. This can be a figure from the paper …
-
# Burnside's Lemma and Pólya Enumeration Theorem
It is used to count/find combinatorial objects (i.e. equivalence classes or orbits) associated with symmetry groups.
It is a result in group the…
-
This RFC is a summary of the discussion from https://github.com/nim-lang/RFCs/issues/19
The proposal that has won is to allow repeating the case discriminator field without the ``: type`` syntax. L…
-
I personally always define this for myself:
```haskell
(◇) ∷ Semigroup α ⇒ α → α → α
(◇) = ()
{-# INLINE (◇) #-}
infixr 6 ◇
```
What do you think about to include it to this package? There are …