commit bbe35c0 (2022-03-31 09:47:01 -0400) Torsten Scholak: add disclaimer

Hello Dex

Tagged as: dex

Posted on Mar 10, 2022

1 min read

Say hello to Dex and see how Dex greets you.

This article is a small demonstration of Text.Pandoc.Readers.Dex.

First, two static type definitions:

Height = Fin 3
Width = Fin 8

Let's make a rectangular array:

x = for i:Height. for j:Width. 1.0

We can see the type of x with :t:

:t x
((Fin 3) => (Fin 8) => Float32)

We can print x, too:

x
[ [1., 1., 1., 1., 1., 1., 1., 1.]
, [1., 1., 1., 1., 1., 1., 1., 1.]
, [1., 1., 1., 1., 1., 1., 1., 1.] ]

That's all folks!

Previous Post

How to Get from A Tree to A Flat Shape And Back Again

Feb 2, 2022

The adventure continues in this "Unrecurse" sequel. Previously, we bravely faced turmoil and confusion in a cruel world in which Haskell suddenly stopped supporting recursive function calls. We barely escaped the wrath of the compiler. This time, we try to survive an even more extreme situation: Haskell without recursive data types! It is the ultimate test of our programming skills. Will we make it through the final challenge, or is all hope lost? Join us in this journey about tapes and tribulations.