Fix sample

Author: Demonstrandum

empty.out

@@ -0,0 +1,24 @@
+import :Prelude
+io = import :IO
+
+-- We don't need to define Zero and Succ, they can exist
+-- as application of functions, and not mean anything more,
+-- they perform no computation like normal functions.
+N = [ Zero ] | [ Succ n => n <- N ] where:
+	Zero : N
+	Succ : N -> N
+
+(+) : N -> N -> N
+n + Zero = n
+n + (Succ m) = Succ (n + m)
+
+(*) : N -> N -> N
+n * Zero = Zero
+n * (Succ m) = n + n * m
+
+one = Succ Zero
+two = Succ one
+three = two + one
+
+-- Should show: (Succ (Succ (Succ (Succ (Succ Zero)))))
+io::puts <| three + two

samples/peano_implicit.vh

@@ -0,0 +1,15 @@
+import :Prelude
+io = import :IO
+
+-- Primes is an infinte list.
+Primes = [ p : 2... => p mod n /= 0 => n <- 2..p ]
+
+-- The (..) and (...) operators mean:
+-- n..m = [ i : Int => i >= n and i < m ]
+-- n... = [ i : Int => i >= n ]
+-- ...m = [ i : Int => i < m ]
+
+
+firs_20_primes = take 20 Primes
+
+io::puts first_20_primes