Description

Pascal's triangle is the arrangement of binomial coefficients in a triangular array. The rows of the triangle are staggered so that each number can be computed as the sum of the numbers to the left and right in the previous row. The function pascal produces the triangle to a given depth.

Definitions

scanIterate : {A : Type} → Nat → (A → A) → A → List ASource #

Return a list of repeated applications of a given function

singleton : {A : Type} → A → List ASource #

Produce a singleton List

concat : List String → StringSource #

Concatenates a list of strings concat (("a" :: nil) :: "b" :: nil) evaluates to "a" :: "b" :: nil

intercalate : String → List String → StringSource #

showList : List Nat → StringSource #

pascalNextRow : List Nat → List NatSource #

Compute the next row of Pascal's triangle

pascal : Nat → List (List Nat)Source #

Produce Pascal's triangle to a given depth

main : IOSource #