@effekt-lang/effekt 0.8.0 → 0.10.0

package/README.md

@@ -17,7 +17,7 @@ If you are looking for examples of the Effekt language, we invite you to look at
 
 ## Installation
 
-Please navigate to the [getting-started guide](https://effekt-lang.org/docs/getting-started#installing-effekt) on our [website](https://effekt-lang.org) for detailed instructions of how to install Effekt.
+Please navigate to the [getting-started guide](https://effekt-lang.org/docs) on our [website](https://effekt-lang.org) for detailed instructions of how to install Effekt.
 
 ## Contributing
 

package/libraries/chez/callcc/effekt.ss

@@ -1,28 +1,15 @@
+(define (reset body)
+  (let ([p (newPrompt)])
+    (pushPrompt p (body p))))
 
-; ;; EXAMPLE
-; ; (handle ([Fail_22 (Fail_109 () resume_120 (Nil_74))])
-; ;       (let ((tmp86_121 ((Fail_109  Fail_22))))
-; ;         (Cons_73  tmp86_121  (Nil_74))))
-; (define-syntax handle
-;   (syntax-rules ()
-;     [(_ ((cap1 (op1 (arg1 ...) k exp ...) ...) ...) body ...)
-;      (let ([P (newPrompt)])
-;         (pushPrompt P
-;           (let ([cap1 (cap1 (define-effect-op P (arg1 ...) k exp ...) ...)] ...)
-;             body ...)))]))
+(define (shift p body)
+  (shift0-at p k (body k)))
 
-(define-syntax handle
-  (syntax-rules ()
-    [(_ ((cap1 (op1 (arg1 ...) k exp ...) ...) ...) body)
-     (let ([P (newPrompt)])
-        (pushPrompt P
-          (body (cap1 (define-effect-op P (arg1 ...) k exp ...) ...) ...)))]))
-
-(define-syntax define-effect-op
-  (syntax-rules ()
-    [(_ P (arg1 ...) k exp ...)
-     (lambda (arg1 ...)
-       (shift0-at P k exp ...))]))
+;(define-syntax define-effect-op
+;  (syntax-rules ()
+;    [(_ P (arg1 ...) k exp ...)
+;     (lambda (arg1 ...)
+;       (shift0-at P k exp ...))]))
 
 ; state(init) { cell => ... }
 (define (state init body)

package/libraries/chez/monadic/effekt.ss

@@ -29,10 +29,11 @@
       (if (null? frames) (underflow v rest)
           (values ((car frames) v) (cons (make-Stack (cdr frames) arena prompt) rest))))))
 
-; Control, Prompt -> Control
-(define (reset p c)
-  (lambda (mk)
-    (c (cons (make-Stack '() (make-arena) p) mk))))
+; Control -> Control
+(define (reset c)
+  (let ([p (newPrompt)])
+    (lambda (mk)
+      ((c p) (cons (make-Stack '() (make-arena) p) mk)))))
 
 ; Prompt, Body -> Control
 (define (shift p f)
@@ -64,15 +65,6 @@
 
 (define newPrompt (lambda () (string #\p)))
 
-(define-syntax handle
-  (syntax-rules ()
-    [(_ ((cap1 (op1 (arg1 ...) kid exp) ...) ...) body)
-     (let ([p (newPrompt)])
-       (reset p (body
-        (cap1 (define-effect-op p (arg1 ...) kid exp) ...)
-        ...)))]))
-
-
 (define-syntax define-effect-op
   (syntax-rules ()
     [(_ p (arg1 ...) kid exp ...)

package/libraries/common/array.effekt

@@ -77,30 +77,7 @@ extern global def unsafeSet[T](arr: Array[T], index: Int, value: T): Unit =
     ret %Pos %z
   """
 
-/// Creates a copy of `arr`
-def copy[T](arr: Array[T]): Array[T] = {
-  with on[OutOfBounds].default { <> }; // should not happen
-  val len = arr.size;
-  val newArray = allocate[T](len);
-  copy[T](arr, 0, newArray, 0, len);
-  newArray
-}
 
-/// Copies `length`-many elements from `from` to `to`
-/// starting at `start` (in `from`) and `offset` (in `to`)
-def copy[T](from: Array[T], start: Int, to: Array[T], offset: Int, length: Int): Unit / Exception[OutOfBounds] = {
-  val startValid  = start >= 0 && start + length <= from.size
-  val offsetValid = offset >= 0 && offset + length <= to.size
-
-  def go(i: Int, j: Int, length: Int): Unit =
-    if (length > 0) {
-      to.unsafeSet(j, from.unsafeGet(i))
-      go(i + 1, j + 1, length - 1)
-    }
-
-  if (startValid && offsetValid) go(start, offset, length)
-  else do raise(OutOfBounds(), "Array index out of bounds, when copying")
-}
 
 // Derived operations:
 
@@ -126,6 +103,44 @@ def build[T](size: Int) { index: Int => T }: Array[T] = {
   arr
 }
 
+def resize[T](source: Array[T], size: Int): Array[T] = {
+  val target = allocate(size)
+  val n = min(source.size, target.size)
+  def go(i: Int): Array[T] =
+    if (i < n) {
+      target.unsafeSet(i, source.unsafeGet(i))
+      go(i + 1)
+    } else {
+      target
+    }
+  go(0)
+}
+
+/**
+ * Creates a copy of `arr`
+ */
+def copy[T](array: Array[T]): Array[T] =
+  array.resize(array.size)
+
+/**
+ * Copies `length`-many elements from `from` to `to`
+ * starting at `start` (in `from`) and `offset` (in `to`)
+ */
+def copy[T](from: Array[T], start: Int, to: Array[T], offset: Int, length: Int): Unit / Exception[OutOfBounds] = {
+  val startValid  = start >= 0 && start + length <= from.size
+  val offsetValid = offset >= 0 && offset + length <= to.size
+
+  def go(i: Int, j: Int, length: Int): Unit =
+    if (length > 0) {
+      to.unsafeSet(j, from.unsafeGet(i))
+      go(i + 1, j + 1, length - 1)
+    }
+
+  if (startValid && offsetValid) go(start, offset, length)
+  else do raise(OutOfBounds(), "Array index out of bounds, when copying")
+}
+
+
 // Utility functions:
 
 def toList[T](arr: Array[T]): List[T] = {
@@ -140,26 +155,22 @@ def toList[T](arr: Array[T]): List[T] = {
 
 def foreach[T](arr: Array[T]){ action: T => Unit }: Unit =
   each(0, arr.size) { i =>
-    val x: T = arr.unsafeGet(i)
-    action(x)
+    action(arr.unsafeGet(i))
   }
 
 def foreach[T](arr: Array[T]){ action: (T) {Control} => Unit }: Unit =
   each(0, arr.size) { (i) {label} =>
-    val x: T = arr.unsafeGet(i)
-    action(x) {label}
+    action(arr.unsafeGet(i)) {label}
   }
 
 def foreachIndex[T](arr: Array[T]){ action: (Int, T) => Unit }: Unit =
   each(0, arr.size) { i =>
-    val x: T = arr.unsafeGet(i)
-    action(i, x)
+    action(i, arr.unsafeGet(i))
   }
 
 def foreachIndex[T](arr: Array[T]){ action: (Int, T) {Control} => Unit }: Unit =
   each(0, arr.size) { (i) {label} =>
-    val x: T = arr.unsafeGet(i)
-    action(i, x) {label}
+    action(i, arr.unsafeGet(i)) {label}
   }
 
 def sum(list: Array[Int]): Int = {

package/libraries/common/bytearray.effekt

@@ -50,13 +50,33 @@ def resize(source: ByteArray, size: Int): ByteArray = {
   go(0)
 }
 
-extern pure def fromUTF8(str: String): ByteArray =
+def foreach(arr: ByteArray){ action: Byte => Unit }: Unit =
+  each(0, arr.size) { i =>
+    action(arr.unsafeGet(i))
+  }
+
+def foreach(arr: ByteArray){ action: (Byte) {Control} => Unit }: Unit =
+  each(0, arr.size) { (i) {label} =>
+    action(arr.unsafeGet(i)) {label}
+  }
+
+def foreachIndex(arr: ByteArray){ action: (Int, Byte) => Unit }: Unit =
+  each(0, arr.size) { i =>
+    action(i, arr.unsafeGet(i))
+  }
+
+def foreachIndex(arr: ByteArray){ action: (Int, Byte) {Control} => Unit }: Unit =
+  each(0, arr.size) { (i) {label} =>
+    action(i, arr.unsafeGet(i)) {label}
+  }
+
+extern pure def fromString(str: String): ByteArray =
   js "(new TextEncoder().encode(${str}))"
   llvm """
     ret %Pos ${str}
   """
 
-extern pure def toUTF8(arr: ByteArray): String =
+extern pure def toString(arr: ByteArray): String =
   js "(new TextDecoder('utf-8').decode(${arr}))"
   // assuming the buffer is already in UTF-8
   llvm """

package/libraries/common/char.effekt

@@ -0,0 +1,58 @@
+/// Warning: This library currently only works with ASCII characters, **not** unicode!
+module char
+
+import exception
+
+
+/// Checks if the given character is an ASCII whitespace
+def isWhitespace(c: Char): Bool = c match {
+  case ' '    => true
+  case '\n'   => true
+  case '\r'   => true
+  case '\t'   => true
+  case '\u0B' => true // vertical tab
+  case '\u0C' => true // form feed
+  case _      => false
+}
+
+/// Checks if the given character is an ASCII digit in base 10
+/// Use `digitValue(c: Char)` to get the numeric value out.
+def isDigit(c: Char): Bool = { c >= '0' && c <= '9' }
+
+/// Checks if the given character is an ASCII digit in the given base
+/// Use `digitValue(c: Char, base: Int)` to get the numeric value out.
+def isDigit(c: Char, base: Int): Bool = {
+  with on[WrongFormat].default { false }
+  val _ = digitValue(c, base)
+  true
+}
+
+/// Gets the value of a given ASCII digit in base 10
+def digitValue(c: Char): Int / Exception[WrongFormat] =
+  digitValue(c, 10)
+
+/// Gets the value of a given ASCII digit in the given base
+def digitValue(c: Char, base: Int): Int / Exception[WrongFormat] = {
+  val v = c match {
+    case c and c >= '0' && c <= '9' => (c.toInt - '0'.toInt)
+    case c and c >= 'a' && c <= 'z' => (c.toInt - 'a'.toInt) + 10
+    case c and c >= 'A' && c <= 'Z' => (c.toInt - 'A'.toInt) + 10
+    case _ => wrongFormat("'" ++ c.toString ++ "' is not a digit")
+  }
+  if (v >= base) { wrongFormat(c.toString ++ " is not a valid digit in base " ++ base.show) } else { v }
+}
+
+/// Checks if a given character is a 7-bit ASCII character
+def isASCII(c: Char): Bool = { c.toInt < 128 }
+
+/// Checks if a given character is an ASCII lower alphabetic character
+def isLower(c: Char): Bool = { c >= 'a' && c <= 'z' }
+
+/// Checks if a given character is an ASCII upper alphabetic character
+def isUpper(c: Char): Bool = { c >= 'A' && c <= 'Z' }
+
+/// Checks if a given character is an ASCII alphabetic or numeric character
+def isAlphanumeric(c: Char): Bool = isDigit(c) || isLower(c) || isUpper(c)
+
+/// Checks if a given character is an ASCII alphabetic character
+def isAlphabetic(c: Char): Bool = isLower(c) || isUpper(c)

package/libraries/common/effekt.effekt

@@ -566,6 +566,11 @@ extern pure def bitwiseAnd(x: Int, y: Int): Int =
   chez "(logand ${x} ${y})"
   llvm "%z = and %Int ${x}, ${y} ret %Int %z"
 
+extern pure def bitwiseOr(x: Int, y: Int): Int =
+  js "(${x} | ${y})"
+  chez "(logior ${x} ${y})"
+  llvm "%z = or %Int ${x}, ${y} ret %Int %z"
+
 extern pure def bitwiseXor(x: Int, y: Int): Int =
   js "(${x} ^ ${y})"
   chez "(logxor ${x} ${y})"

package/libraries/common/io/filesystem.effekt

@@ -44,7 +44,7 @@ def readFile(path: String): String / Exception[IOError] = {
   def go(): String = {
     read(file, buffer, offset, chunkSize, -1) match {
       case 0 =>
-        buffer.resize(offset).toUTF8
+        buffer.resize(offset).toString
       case n =>
         offset = offset + n
         if (offset + chunkSize > buffer.size) {
@@ -63,7 +63,7 @@ def writeFile(path: String, contents: String): Unit / Exception[IOError] = {
   with on[IOError].finalize { close(file) }
 
   val chunkSize = 1048576 // 1MB
-  val buffer = contents.fromUTF8
+  val buffer = contents.fromString
   var offset = 0;
 
   def go(): Unit = {

package/libraries/common/stream.effekt

@@ -0,0 +1,419 @@
+module stream
+
+import array
+import bytearray
+import io/filesystem
+import io/error
+
+// Effects
+// -------
+
+/// Describes push streams by emitting values of type `A`.
+effect emit[A](value: A): Unit
+
+/// Describes pull streams by requiring values of type `A`.
+///
+/// The producer can decide to `stop` emitting values.
+effect read[A](): A / stop
+
+/// Signal from a producer to a consumer that there are no further values.
+effect stop(): Nothing
+
+/// Canonical handler of push streams that performs `action` for every
+/// value emitted by `stream`.
+def for[A, R] { stream: () => R / emit[A] } { action: A => Unit }: R =
+  try {
+    stream()
+  } with emit[A] { value =>
+    resume(action(value))
+  }
+
+/// Like `for[A, R]`, but fixes the result of producing computation to the
+/// common type `Unit`. This simplifies annotating the type of stream
+/// elements `A` without having to also annotate `R`.
+///
+/// e.g. for[Int] { prog() } { el => println(el) }
+def for[A] { stream: () => Unit / emit[A] } { action: A => Unit }: Unit =
+  for[A, Unit]{stream}{action}
+
+def continually[A] { action: () => A }: Nothing / emit[A] = {
+  def go(): Nothing = {
+    do emit(action())
+    go()
+  }
+  go()
+}
+
+/// Turns a `list` into a producer of a push stream
+/// by emitting each contained value left-to-right.
+def each[A](list: List[A]): Unit / emit[A] =
+  list match {
+    case Nil() => ()
+    case Cons(head, tail) =>
+      do emit(head)
+      each(tail)
+  }
+
+/// Turns an `array` into a producer of a push stream
+/// by emitting each contained value from 0 to length - 1.
+def each[T](array: Array[T]): Unit / emit[T] = {
+  val n = array.size
+  def go(i: Int): Unit = {
+    if (i < n) {
+      do emit(array.unsafeGet(i))
+      go(i + 1)
+    }
+  }
+  go(0)
+}
+
+/// Turns `bytes` into a producer of a push stream
+/// by emitting each contained value from 0 to length - 1.
+def each(bytes: ByteArray): Unit / emit[Byte] = {
+  val n = bytes.size
+  def go(i: Int): Unit = {
+    if (i < n) {
+      do emit(bytes.unsafeGet(i))
+      go(i + 1)
+    }
+  }
+  go(0)
+}
+
+// not option
+// not dequeue
+// not queue
+// not result
+// not seq
+
+
+def boundary[R] { program: () => R / stop }: Option[R] =
+  try {
+    Some(program())
+  } with stop {
+    def stop() = None()
+  }
+
+def exhaustively[A] { program: () => A / stop } { action: A => Unit }: Unit =
+  try {
+    def go(): Unit = {
+      action(program())
+      go()
+    }
+    go()
+  } with stop {
+    def stop() = ()
+  }
+
+
+// In Effekt lower bounds are inclusive and upper bounds are exclusive
+
+record Indexed[A](index: Int, value: A)
+
+def range(lower: Int, upper: Int): Unit / emit[Int] =
+  if (lower < upper) {
+    do emit(lower)
+    range(lower + 1, upper)
+  }
+
+def rangeTo(upper: Int): Unit / emit[Int] =
+  range(0, upper)
+
+def rangeFrom(lower: Int): Unit / emit[Int] = {
+  do emit(lower)
+  rangeFrom(lower + 1)
+}
+
+
+def index[A, R] { stream: () => R / emit[A] }: R / emit[Indexed[A]] = {
+  var i = 0;
+  try {
+    stream()
+  } with emit[A] { v =>
+    val c = i;
+    i = c + 1;
+    resume(do emit(Indexed(c, v)))
+  }
+}
+
+/// If `number` is zero or negative it does nothing
+def take[A, R](number: Int) { stream: () => R / emit[A] }: R / { emit[A], stop } = {
+  if (number <= 0) do stop();
+  var i = 1;
+  try {
+    stream()
+  } with emit[A] { v =>
+    if (i < number) {
+      i = i + 1;
+      resume(do emit(v))
+    } else {
+      do stop()
+    }
+  }
+}
+
+/// If `number` is zero or negative it does nothing
+def replicate[A](number: Int) { action: () => A }: Unit / emit[A] =
+  if (number > 0) {
+    do emit(action())
+    replicate(number - 1) {action}
+  }
+
+
+def sum[R] { stream : () => R / emit[Int] }: (R, Int) = {
+  var s = 0;
+  try {
+    (stream(), s)
+  } with emit[Int] { v =>
+    s = s + v;
+    resume(())
+  }
+}
+
+def sum { stream : () => Unit / emit[Int] }: Int =
+  sum[Unit]{stream}.second
+
+def collectList[A, R] { stream: () => R / emit[A] }: (R, List[A]) =
+  try {
+    (stream(), Nil())
+  } with emit[A] { (v) =>
+    val (r, vs) = resume(());
+    (r, Cons(v, vs))
+  }
+
+def collectList[A] { stream: () => Unit / emit[A] }: List[A] =
+  collectList[A, Unit]{stream}.second
+
+def collectArray[A, R] { stream: () => R / emit[A] }: (R, Array[A]) = {
+  var i = 0
+  var a = array::allocate(1)
+  try {
+    (stream(), a.resize(i))
+  } with emit[A] { (v) =>
+    if (i >= a.size) { a = a.resize(2 * a.size) }
+    a.unsafeSet(i, v)
+    i = i + 1
+    resume(())
+  }
+}
+
+def collectArray[A] { stream: () => Unit / emit[A] }: Array[A] =
+  collectArray[A, Unit]{stream}.second
+
+def collectBytes[R] { stream: () => R / emit[Byte] }: (R, ByteArray) = {
+  var i = 0
+  var a = bytearray::allocate(1)
+  try {
+    (stream(), a.resize(i))
+  } with emit[Byte] { (v) =>
+    if (i >= a.size) { a = a.resize(2 * a.size) }
+    a.unsafeSet(i, v)
+    i = i + 1
+    resume(())
+  }
+}
+
+def collectBytes { stream: () => Unit / emit[Byte] }: ByteArray =
+  collectBytes[Unit]{stream}.second
+
+def feed[T](list: List[T]) { reader: () => Unit / read[T] } = {
+  var l = list
+  try {
+    reader()
+  } with read[T] {
+    resume {
+      l match {
+        case Nil() => do stop()
+        case Cons(value, rest) =>
+          l = rest
+          return value
+      }
+    }
+  }
+}
+
+def feed[T](array: Array[T]) { reader: () => Unit / read[T] } = {
+  var i = 0
+  try {
+    reader()
+  } with read[T] {
+    resume {
+      if (i < array.size) {
+        array.unsafeGet(i)
+      } else {
+        do stop()
+      }
+    }
+  }
+}
+
+def feed(bytes: ByteArray) { reader: () => Unit / read[Byte] } = {
+  var i = 0
+  try {
+    reader()
+  } with read[Byte] {
+    resume {
+      if (i < bytes.size) {
+        bytes.unsafeGet(i)
+      } else {
+        do stop()
+      }
+    }
+  }
+}
+
+def source[A, R] { stream: () => Unit / emit[A] } { reader: () => R / read[A] }: R = {
+  var next = box { None() }
+  next = box {
+    try {
+      stream()
+      None()
+    } with emit[A] { (v) =>
+      next = box { resume(()) }
+      Some(v)
+    }
+  }
+  try {
+    reader()
+  } with read[A] {
+    resume {
+      next().getOrElse { do stop() }
+    }
+  }
+}
+
+
+def writeFile[R](path: String) { stream: () => R / emit[Byte] }: R / Exception[IOError] = {
+
+  val file = open(path, WriteOnly());
+  with on[IOError].finalize { close(file) }
+
+  val chunkSize = 1048576 // 1MB
+  val buffer = bytearray::allocate(chunkSize)
+  var offset = 0
+
+  def push(i: Int, n: Int): Unit = {
+    val r = write(file, buffer, i, n, -1)
+    if (r < n) {
+      push(i + r, n - r)
+    }
+  }
+
+  try {
+    val r = stream()
+    push(0, offset)
+    return r
+  } with emit[Byte] { (byte) =>
+    if (offset >= buffer.size) { push(0, buffer.size) }
+    buffer.unsafeSet(offset, byte)
+    offset = offset + 1
+    resume(())
+  }
+}
+
+def readFile[R](path: String) { reader: () => R / read[Byte] }: R / Exception[IOError] = {
+
+  val file = open(path, ReadOnly());
+  with on[IOError].finalize { close(file) }
+
+  val chunkSize = 1048576 // 1MB
+  val buffer = bytearray::allocate(chunkSize)
+  var offset = 0
+  var length = 0
+
+  def pull(): Unit / stop = {
+    read(file, buffer, 0, chunkSize, -1) match {
+      case 0 =>
+        do stop()
+      case n =>
+        offset = 0
+        length = n
+    }
+  }
+
+  try {
+    reader()
+  } with read[Byte] {
+    resume {
+      if (offset >= length) { pull() }
+      val byte = buffer.unsafeGet(offset)
+      offset = offset + 1
+      return byte
+    }
+  }
+}
+
+def decodeChar(): Char / {read[Byte], stop} = {
+  val b = do read().toInt
+  if (b < 128) {
+    b.toChar
+  } else if (b < 224) {
+    val part1 = bitwiseShl(bitwiseAnd(b, 31), 6)
+    val part2 = bitwiseAnd(do read().toInt, 63)
+    bitwiseOr(part1, part2).toChar
+  } else if (b < 240) {
+    val part1 = bitwiseShl(bitwiseAnd(b, 15), 12)
+    val part2 = bitwiseShl(bitwiseAnd(do read().toInt, 63), 6)
+    val part3 = bitwiseAnd(do read().toInt, 63)
+    bitwiseOr(bitwiseOr(part1, part2), part3).toChar
+  } else {
+    val part1 = bitwiseShl(bitwiseAnd(b, 7), 18)
+    val part2 = bitwiseShl(bitwiseAnd(do read().toInt, 63), 12)
+    val part3 = bitwiseShl(bitwiseAnd(do read().toInt, 63), 6)
+    val part4 = bitwiseAnd(do read().toInt, 63)
+    bitwiseOr(bitwiseOr(bitwiseOr(part1, part2), part3), part4).toChar
+  }
+}
+
+def encodeChar(char: Char): Unit / emit[Byte] = {
+  val code = char.toInt
+  if (code < 128) {
+    do emit(code.toByte)
+  } else if (code < 2048) {
+    do emit(bitwiseOr(192, bitwiseShr(code, 6)).toByte)
+    do emit(bitwiseOr(128, bitwiseAnd(code, 63)).toByte)
+  } else if (code < 65536) {
+    do emit(bitwiseOr(224, bitwiseShr(code, 12)).toByte)
+    do emit(bitwiseOr(128, bitwiseAnd(bitwiseShr(code, 6), 63)).toByte)
+    do emit(bitwiseOr(128, bitwiseAnd(code, 63)).toByte)
+  } else {
+    do emit(bitwiseOr(240, bitwiseShr(code, 18)).toByte)
+    do emit(bitwiseOr(128, bitwiseAnd(bitwiseShr(code, 12), 63)).toByte)
+    do emit(bitwiseOr(128, bitwiseAnd(bitwiseShr(code, 6), 63)).toByte)
+    do emit(bitwiseOr(128, bitwiseAnd(code, 63)).toByte)
+  }
+}
+
+def decodeUTF8[R] { reader: () => R / read[Char] }: R / read[Byte] =
+  try {
+    reader()
+  } with read[Char] {
+    resume { decodeChar() }
+  }
+
+def encodeUTF8[R] { stream: () => R / emit[Char] }: R / emit[Byte] =
+  try {
+    stream()
+  } with emit[Char] { char =>
+    resume(encodeChar(char))
+  }
+
+def feed(string: String) { reader: () => Unit / read[Char] } =
+  feed(string.fromString) {
+    decodeUTF8 {
+      reader()
+    }
+  }
+
+def each(string: String): Unit / emit[Char] =
+  feed(string) {
+    exhaustively[Char] { do read() } { char => do emit(char) }
+  }
+
+def collectString[R] { stream: () => R / emit[Char] }: (R, String) = {
+  val (result, bytes) = collectBytes { encodeUTF8 { stream } }
+  (result, bytes.toString)
+}
+
+def collectString { stream: () => Unit / emit[Char] }: String =
+  collectString[Unit]{stream}.second

package/libraries/common/string.effekt

@@ -222,15 +222,6 @@ def lastIndexOf(str: String, sub: String, from: Int): Option[Int] = {
 // extern pure def unsafeIndexOf(str: String, sub: String): Int =
 //   js "${str}.indexOf(${sub})"
 
-interface Stream {
-  def emit(string: Char): Unit
-}
-
-def string[T] { prog: => T / Stream }: (T, String) = <>
-
-// TODO implement after concurrent IO (we need to stub `process.stdout` in JS for browsers).
-def printing[T] { prog: => T / Stream }: T = <>
-
 
 // Characters
 // ----------
@@ -299,10 +290,6 @@ extern pure def infixGte(x: Char, y: Char): Bool =
     ret %Pos %adt_boolean
   """
 
-// TODO iterator over codepoints (maybe use the JS primitive feature???)
-
-extern type StringIterator
-
 
 /**
  * Determines the number of bytes needed by a codepoint

package/libraries/js/effekt_runtime.js

@@ -23,7 +23,7 @@ function Arena(_region) {
     fresh: function(init) {
       const cell = Cell(init);
       // region keeps track what to backup, but we do not need to backup unreachable cells
-      region.push(new WeakRef(cell))
+      region.push(cell) // new WeakRef(cell))
       return cell;
     },
     region: _region,
@@ -31,15 +31,14 @@ function Arena(_region) {
       // a region aggregates weak references
       const nested = Arena([])
       // this doesn't work yet, since Arena.backup doesn't return a thunk
-      region.push(new WeakRef(nested))
+      region.push(nested) //new WeakRef(nested))
       return nested;
     },
     backup: function() {
       const _backup = []
       let nextIndex = 0;
       for (const ref of region) {
-        // console.log(ref)
-        const cell = ref.deref()
+        const cell = ref //.deref()
         // only backup live cells
         if (cell) {
           _backup[nextIndex] = cell.backup()
@@ -50,7 +49,7 @@ function Arena(_region) {
         const region = []
         let nextIndex = 0;
         for (const restoreCell of _backup) {
-          region[nextIndex] = new WeakRef(restoreCell())
+          region[nextIndex] = restoreCell() // new WeakRef(restoreCell())
           nextIndex++
         }
         return Arena(region)
@@ -114,11 +113,7 @@ function SHIFT(p, body, ks, k) {
   cont = { stack: meta.stack, prompt: meta.prompt, backup: meta.arena.backup(), rest: cont }
   meta = meta.rest
 
-  function resumeValue(a, ks, k) {
-    return resumeComp((ks, k) => k(a, ks), ks, k)
-  }
   function resumeComp(c, ks, k) {
-    //console.log("Resuming", ks.arena)
     let meta = { stack: k, prompt: ks.prompt, arena: ks.arena, rest: ks.rest }
     let toRewind = cont
     while (!!toRewind) {
@@ -133,7 +128,7 @@ function SHIFT(p, body, ks, k) {
 
   let k1 = meta.stack
   meta.stack = null
-  return body(resumeValue, resumeComp, meta, k1)
+  return body(resumeComp, meta, k1)
 }
 
 function RUN_TOPLEVEL(comp) {

package/libraries/llvm/bytearray.c

@@ -81,7 +81,7 @@ char* c_bytearray_into_nullterminated_string(const struct Pos arr) {
 // TODO do this in Effekt
 struct Pos c_bytearray_show_Int(const Int n) {
     char str[24];
-    sprintf(str, "%" PRId64, n);
+    snprintf(str, sizeof(str), "%" PRId64, n);
     return c_bytearray_from_nullterminated_string(str);
 }
 
@@ -112,14 +112,14 @@ struct Pos c_bytearray_show_Char(const uint64_t n) {
 // TODO do this in Effekt
 struct Pos c_bytearray_show_Byte(const Byte n) {
     char str[4];  // Byte values range from 0 to 255, 3 characters + null terminator
-    sprintf(str, "%" PRIu8, n);
+    snprintf(str, sizeof(str), "%" PRIu8, n);
     return c_bytearray_from_nullterminated_string(str);
 }
 
 // TODO do this in Effekt
 struct Pos c_bytearray_show_Double(const Double x) {
-    char str[64]; // TODO is this large enough? Possibly use snprintf first
-    sprintf(str, "%g", x);
+    char str[64]; // TODO is this large enough?
+    snprintf(str, sizeof(str), "%g", x);
     return c_bytearray_from_nullterminated_string(str);
 }
 

package/libraries/llvm/rts.ll

@@ -58,14 +58,6 @@
 ; Pointers for a heap allocated stack
 %Memory = type { %StackPointer, %Base, %Limit }
 
-; The garbage collector differentiates three groups of types:
-; - Values (Integer, Double)
-; - Objects (Positive, Negative)
-; - Strings
-; For each group we have an arena where mutable state is allocated.
-;
-%Region = type [ 3 x %Memory ]
-
 ; Unique address for each handler.
 %Prompt = type ptr
 
@@ -82,7 +74,7 @@
 ; This is used for two purposes:
 ;   - a refied first-class list of stacks (cyclic linked-list)
 ;   - as part of an intrusive linked-list of stacks (meta stack)
-%StackValue = type { %ReferenceCount, %Memory, %Region, %Prompt, i1, %Stack }
+%StackValue = type { %ReferenceCount, %Memory, %Prompt, i1, %Stack }
 
 
 
@@ -124,7 +116,7 @@ declare void @exit(i64)
 ; Prompts
 
 define private %Prompt @currentPrompt(%Stack %stack) {
-    %prompt_pointer = getelementptr %StackValue, ptr %stack, i64 0, i32 3
+    %prompt_pointer = getelementptr %StackValue, ptr %stack, i64 0, i32 2
     %prompt = load %Prompt, ptr %prompt_pointer
     ret %Prompt %prompt
 }
@@ -222,77 +214,6 @@ define void @eraseNegative(%Neg %val) alwaysinline {
 
 
 ; Arena management
-define private ptr @getRegionPointer(%Prompt %prompt) {
-    %stack_pointer = getelementptr %PromptValue, %Prompt %prompt, i64 0, i32 1
-    %stack = load %Stack, ptr %stack_pointer
-    %region_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 2
-    ret ptr %region_pointer
-}
-
-define private { ptr, %Reference } @alloc(i64 %index, %Prompt %prompt) alwaysinline {
-    %region_pointer = call ptr @getRegionPointer(%Prompt %prompt)
-
-    %stackPointer_pointer = getelementptr %Region, ptr %region_pointer, i64 0, i64 %index, i32 0
-    %base_pointer = getelementptr %Region, ptr %region_pointer, i64 0, i64 %index, i32 1
-    %limit_pointer = getelementptr %Region, ptr %region_pointer, i64 0, i64 %index, i32 2
-
-    %stackPointer = load %StackPointer, ptr %stackPointer_pointer
-    %base = load %Base, ptr %base_pointer
-    %limit = load %Limit, ptr %limit_pointer
-
-    %object = icmp ne i64 %index, 0
-    %size = select i1 %object, i64 16, i64 8
-
-    %nextStackPointer = getelementptr i8, %StackPointer %stackPointer, i64 %size
-
-    %cmp = icmp ule %StackPointer %nextStackPointer, %limit
-    br i1 %cmp, label %continue, label %realloc
-
-continue:
-    store %StackPointer %nextStackPointer, ptr %stackPointer_pointer
-    %intBase = ptrtoint %Base %base to i64
-    %intStackPointer = ptrtoint %StackPointer %stackPointer to i64
-    %offset = sub i64 %intStackPointer, %intBase
-
-    %ret.0 = insertvalue { ptr, %Reference } undef, %StackPointer %stackPointer, 0
-    %ret.1 = insertvalue { ptr, %Reference } %ret.0, %Prompt %prompt, 1, 0
-    %ret.2 = insertvalue { ptr, %Reference } %ret.1, i64 %offset, 1, 1
-    ret { ptr, %Reference } %ret.2
-
-realloc:
-    %intBase_2 = ptrtoint %Base %base to i64
-    %intLimit = ptrtoint %Limit %limit to i64
-    %arenaSize = sub i64 %intLimit, %intBase_2
-    %empty = icmp eq i64 %arenaSize, 0
-    %double = mul i64 %arenaSize, 2
-    %newArenaSize = select i1 %empty, i64 1024, i64 %double
-
-    %newBase = call ptr @realloc(ptr %base, i64 %newArenaSize)
-    %newlimit = getelementptr i8, %Base %newBase, i64 %newArenaSize
-    %newStackPointer = getelementptr i8, %Base %newBase, i64 %arenaSize
-    %newNextStackPointer = getelementptr i8, %StackPointer %newStackPointer, i64 %size
-
-    store %Base %newBase, ptr %base_pointer
-    store %Limit %newlimit, ptr %limit_pointer
-    store %StackPointer %newNextStackPointer, ptr %stackPointer_pointer
-
-    %ret..0 = insertvalue { ptr, %Reference } undef, %StackPointer %newStackPointer, 0
-    %ret..1 = insertvalue { ptr, %Reference } %ret..0, %Prompt %prompt, 1, 0
-    %ret..2 = insertvalue { ptr, %Reference } %ret..1, i64 %arenaSize, 1, 1
-    ret { ptr, %Reference } %ret..2
-}
-
-
-define private ptr @getPointer(%Reference %reference, i64 %index, %Stack %stack) {
-    %prompt = extractvalue %Reference %reference, 0
-    %offset = extractvalue %Reference %reference, 1
-
-    %region_pointer = call ptr @getRegionPointer(%Prompt %prompt)
-    %base_pointer = getelementptr %Region, ptr %region_pointer, i64 0, i64 %index, i32 1
-    %base = load %Base, ptr %base_pointer
-    %pointer = getelementptr i8, ptr %base, i64 %offset
-    ret ptr %pointer
-}
 
 define private %Stack @getStack(%Prompt %prompt) {
     %stack_pointer = getelementptr %PromptValue, %Prompt %prompt, i64 0, i32 1
@@ -414,8 +335,8 @@ define private %Stack @reset(%Stack %oldStack) {
     %stackMemory = call %Memory @newMemory()
 
     %stack.0 = insertvalue %StackValue zeroinitializer, %Memory %stackMemory, 1
-    %stack.1 = insertvalue %StackValue %stack.0, %Prompt %prompt, 3
-    %stack.2 = insertvalue %StackValue %stack.1, %Stack %oldStack, 5
+    %stack.1 = insertvalue %StackValue %stack.0, %Prompt %prompt, 2
+    %stack.2 = insertvalue %StackValue %stack.1, %Stack %oldStack, 4
 
     store %StackValue %stack.2, %Stack %stack
 
@@ -426,7 +347,7 @@ define private %Stack @reset(%Stack %oldStack) {
 }
 
 define private void @updatePrompts(%Stack %stack) {
-    %dirtyBit_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 4
+    %dirtyBit_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 3
     %dirtyBit = load i1, ptr %dirtyBit_pointer
     br i1 %dirtyBit, label %continue, label %done
 
@@ -434,7 +355,7 @@ done:
     ret void
 
 continue:
-    %prompt_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 3
+    %prompt_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 2
     %prompt = load %Prompt, ptr %prompt_pointer
     %stack_pointer = getelementptr %PromptValue, %Prompt %prompt, i64 0, i32 1
     %promptStack = load %Stack, ptr %stack_pointer
@@ -449,16 +370,16 @@ update:
     store %Stack %stack, ptr %stack_pointer
     store i1 0, ptr %dirtyBit_pointer
 
-    %next_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 5
+    %next_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 4
     %next = load %Stack, ptr %next_pointer
     tail call void @updatePrompts(%Stack %next)
     ret void
 }
 
 define void @displace(%Stack %stack) {
-    %prompt_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 3
-    %next_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 5
-    %dirtyBit_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 4
+    %prompt_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 2
+    %next_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 4
+    %dirtyBit_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 3
     %dirtyBit = load i1, ptr %dirtyBit_pointer
     br i1 %dirtyBit, label %done, label %continue
 
@@ -478,7 +399,7 @@ continue:
 
 define %Stack @resume(%Resumption %resumption, %Stack %oldStack) {
     %uniqueResumption = call %Resumption @uniqueStack(%Resumption %resumption)
-    %rest_pointer = getelementptr %StackValue, %Resumption %uniqueResumption, i64 0, i32 5
+    %rest_pointer = getelementptr %StackValue, %Resumption %uniqueResumption, i64 0, i32 4
     %start = load %Stack, ptr %rest_pointer
     call void @updatePrompts(%Stack %start)
 
@@ -490,7 +411,7 @@ define %Stack @resume(%Resumption %resumption, %Stack %oldStack) {
 define private {%Resumption, %Stack} @shift(%Stack %stack, %Prompt %prompt) {
     %resumpion_pointer = getelementptr %PromptValue, %Prompt %prompt, i64 0, i32 1
     %resumption = load %Stack, ptr %resumpion_pointer
-    %next_pointer = getelementptr %StackValue, %Stack %resumption, i64 0, i32 5
+    %next_pointer = getelementptr %StackValue, %Stack %resumption, i64 0, i32 4
     %next = load %Stack, ptr %next_pointer
 
     store %Stack %stack, ptr %next_pointer
@@ -522,23 +443,6 @@ return:
     ret void
 }
 
-define private void @eraseRegion(%Region %region) alwaysinline {
-    %valuesBase = extractvalue %Region %region, 0, 1
-    call void @free(%Base %valuesBase)
-
-    %objectsBase = extractvalue %Region %region, 1, 1
-    %objectsStackPointer = extractvalue %Region %region, 1, 0
-    call void @forEachObject(%Base %objectsBase, %StackPointer %objectsStackPointer, %Eraser @erasePositive)
-    call void @free(%Base %objectsBase)
-
-    %stringsBase = extractvalue %Region %region, 2, 1
-    %stringsStackPointer = extractvalue %Region %region, 2, 0
-    call void @forEachObject(%Base %stringsBase, %StackPointer %stringsStackPointer, %Eraser @erasePositive)
-    call void @free(%Base %stringsBase)
-
-    ret void
-}
-
 define void @erasePrompt(%Prompt %prompt, i1 %dirtyBit) alwaysinline {
     br i1 %dirtyBit, label %continue, label %clearPrompt
 
@@ -572,25 +476,26 @@ define void @sharePrompt(%Prompt %prompt) alwaysinline {
 
 define private %Stack @underflowStack(%Stack %stack) {
     %stackMemory = getelementptr %StackValue, %Stack %stack, i64 0, i32 1
-    %stackRegion = getelementptr %StackValue, %Stack %stack, i64 0, i32 2
-    %stackPrompt = getelementptr %StackValue, %Stack %stack, i64 0, i32 3
-    %stackDirtyBit = getelementptr %StackValue, %Stack %stack, i64 0, i32 4
-    %stackRest = getelementptr %StackValue, %Stack %stack, i64 0, i32 5
+    %stackPrompt = getelementptr %StackValue, %Stack %stack, i64 0, i32 2
+    %stackDirtyBit = getelementptr %StackValue, %Stack %stack, i64 0, i32 3
+    %stackRest = getelementptr %StackValue, %Stack %stack, i64 0, i32 4
 
     %memory = load %Memory, ptr %stackMemory
-    %region = load %Region, ptr %stackRegion
     %prompt = load %Prompt, ptr %stackPrompt
     %rest = load %Stack, ptr %stackRest
     %dirtyBit = load i1, ptr %stackDirtyBit
 
     call void @eraseMemory(%Memory %memory)
-    call void @eraseRegion(%Region %region)
     call void @erasePrompt(%Prompt %prompt, i1 false)
     call void @free(%Stack %stack)
 
     ret %Stack %rest
 }
 
+define private void @nop(%Stack %stack) {
+    ret void
+}
+
 define private %Memory @copyMemory(%Memory %memory) alwaysinline {
     %stackPointer = extractvalue %Memory %memory, 0
     %base = extractvalue %Memory %memory, 1
@@ -618,29 +523,6 @@ define private %Memory @copyMemory(%Memory %memory) alwaysinline {
     ret %Memory %memory.2
 }
 
-define private %Region @copyRegion(%Region %region) alwaysinline {
-    %memory.0 = extractvalue %Region %region, 0
-    %memory.1 = extractvalue %Region %region, 1
-    %memory.2 = extractvalue %Region %region, 2
-
-    %objectsBase = extractvalue %Region %region, 1, 1
-    %objectsStackPointer = extractvalue %Region %region, 1, 0
-    call void @forEachObject(%Base %objectsBase, %StackPointer %objectsStackPointer, %Sharer @sharePositive)
-
-    %stringsBase = extractvalue %Region %region, 2, 1
-    %stringsStackPointer = extractvalue %Region %region, 2, 0
-    call void @forEachObject(%Base %stringsBase, %StackPointer %stringsStackPointer, %Sharer @sharePositive)
-
-    %newMemory.0 = call %Memory @copyMemory(%Memory %memory.0)
-    %newMemory.1 = call %Memory @copyMemory(%Memory %memory.1)
-    %newMemory.2 = call %Memory @copyMemory(%Memory %memory.2)
-
-    %region.0 = insertvalue %Region undef, %Memory %newMemory.0, 0
-    %region.1 = insertvalue %Region %region.0, %Memory %newMemory.1, 1
-    %region.2 = insertvalue %Region %region.1, %Memory %newMemory.2, 2
-
-    ret %Region %region.2
-}
 
 define private %Resumption @uniqueStack(%Resumption %resumption) alwaysinline {
 
@@ -655,7 +537,7 @@ done:
 copy:
     %newOldReferenceCount = sub %ReferenceCount %referenceCount, 1
     store %ReferenceCount %newOldReferenceCount, ptr %referenceCount_pointer
-    %stack_pointer = getelementptr %StackValue, %Resumption %resumption, i64 0, i32 5
+    %stack_pointer = getelementptr %StackValue, %Resumption %resumption, i64 0, i32 4
     %stack = load %Stack, ptr %stack_pointer
 
     %size = ptrtoint ptr getelementptr (%StackValue, ptr null, i64 1) to i64
@@ -668,34 +550,28 @@ loop:
     %newStack = phi %Stack [%newHead, %copy], [%nextNew, %next]
 
     %stackMemory = getelementptr %StackValue, %Stack %old, i64 0, i32 1
-    %stackRegion = getelementptr %StackValue, %Stack %old, i64 0, i32 2
-    %stackPrompt = getelementptr %StackValue, %Stack %old, i64 0, i32 3
-    %stackRest = getelementptr %StackValue, %Stack %old, i64 0, i32 5
+    %stackPrompt = getelementptr %StackValue, %Stack %old, i64 0, i32 2
+    %stackRest = getelementptr %StackValue, %Stack %old, i64 0, i32 4
 
     %memory = load %Memory, ptr %stackMemory
-    %region = load %Region, ptr %stackRegion
     %prompt = load %Prompt, ptr %stackPrompt
     %rest = load %Stack, ptr %stackRest
 
     %newStackReferenceCounter = getelementptr %StackValue, %Stack %newStack, i64 0, i32 0
     %newStackMemory = getelementptr %StackValue, %Stack %newStack, i64 0, i32 1
-    %newStackRegion = getelementptr %StackValue, %Stack %newStack, i64 0, i32 2
-    %newStackPrompt = getelementptr %StackValue, %Stack %newStack, i64 0, i32 3
-    %newStackDirtyBit = getelementptr %StackValue, %Stack %newStack, i64 0, i32 4
-    %newStackRest = getelementptr %StackValue, %Stack %newStack, i64 0, i32 5
+    %newStackPrompt = getelementptr %StackValue, %Stack %newStack, i64 0, i32 2
+    %newStackDirtyBit = getelementptr %StackValue, %Stack %newStack, i64 0, i32 3
+    %newStackRest = getelementptr %StackValue, %Stack %newStack, i64 0, i32 4
 
     %newMemory = call %Memory @copyMemory(%Memory %memory)
 
     %newStackPointer = extractvalue %Memory %newMemory, 0
     call void @shareFrames(%StackPointer %newStackPointer)
 
-    %newRegion = call %Region @copyRegion(%Region %region)
-
     call void @sharePrompt(%Prompt %prompt)
 
-    store i64 0, ptr %newStackReferenceCounter
+    store %ReferenceCount 0, ptr %newStackReferenceCounter
     store %Memory %newMemory, ptr %newStackMemory
-    store %Region %newRegion, ptr %newStackRegion
     store %Prompt %prompt, ptr %newStackPrompt
     store i1 1, ptr %newStackDirtyBit
 
@@ -731,7 +607,7 @@ define void @eraseResumption(%Resumption %resumption) alwaysinline {
     ret void
 
     free:
-    %stack_pointer = getelementptr %StackValue, %Resumption %resumption, i64 0, i32 5
+    %stack_pointer = getelementptr %StackValue, %Resumption %resumption, i64 0, i32 4
     %stack = load %Stack, ptr %stack_pointer
     store %Stack null, ptr %stack_pointer
     call void @eraseStack(%Stack %stack)
@@ -740,20 +616,17 @@ define void @eraseResumption(%Resumption %resumption) alwaysinline {
 
 define void @eraseStack(%Stack %stack) alwaysinline {
     %stackPointer_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 1, i32 0
-    %region_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 2
-    %prompt_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 3
-    %dirtyBit_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 4
-    %rest_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 5
+    %prompt_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 2
+    %dirtyBit_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 3
+    %rest_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 4
 
     %stackPointer = load %StackPointer, ptr %stackPointer_pointer
-    %region = load %Region, ptr %region_pointer
     %prompt = load %Stack, ptr %prompt_pointer
     %dirtyBit = load i1, ptr %dirtyBit_pointer
     %rest = load %Stack, ptr %rest_pointer
 
     call void @free(%Stack %stack)
     call void @eraseFrames(%StackPointer %stackPointer)
-    call void @eraseRegion(%Region %region)
     call void @erasePrompt(%Prompt %prompt, i1 %dirtyBit)
 
     %isNull = icmp eq %Stack %rest, null
@@ -787,7 +660,8 @@ define private void @eraseFrames(%StackPointer %stackPointer) alwaysinline {
 
 define private tailcc void @topLevel(%Pos %val, %Stack %stack) {
     %rest = call %Stack @underflowStack(%Stack %stack)
-    ; assert %rest == null
+    ; rest holds global variables
+    call void @eraseStack(%Stack %rest)
     ret void
 }
 
@@ -804,7 +678,23 @@ define private void @topLevelEraser(%Environment %environment) {
 @global = private global { i64, %Stack } { i64 0, %Stack null }
 
 define private %Stack @withEmptyStack() {
-    %stack = call %Stack @reset(%Stack null)
+    %globals = call %Stack @reset(%Stack null)
+
+    %globalsStackPointer_pointer = getelementptr %StackValue, %Stack %globals, i64 0, i32 1, i32 0
+    %globalsStackPointer = load %StackPointer, ptr %globalsStackPointer_pointer
+
+    %returnAddressPointer.0 = getelementptr %FrameHeader, %StackPointer %globalsStackPointer, i64 0, i32 0
+    %sharerPointer.0 = getelementptr %FrameHeader, %StackPointer %globalsStackPointer, i64 0, i32 1
+    %eraserPointer.0 = getelementptr %FrameHeader, %StackPointer %globalsStackPointer, i64 0, i32 2
+
+    store ptr @nop, ptr %returnAddressPointer.0
+    store ptr @nop, ptr %sharerPointer.0
+    store ptr @free, ptr %eraserPointer.0
+
+    %globalsStackPointer_2 = getelementptr %FrameHeader, %StackPointer %globalsStackPointer, i64 1
+    store %StackPointer %globalsStackPointer_2, ptr %globalsStackPointer_pointer
+
+    %stack = call %Stack @reset(%Stack %globals)
 
     %globalStack = getelementptr %PromptValue, %Prompt @global, i64 0, i32 1
     store %Stack %stack, ptr %globalStack

package/licenses/eclipse public license, version 2.0 - epl-2.0.html

@@ -1,4 +1,4 @@
-<!doctype html><html lang=en><head><meta charset=utf-8><meta http-equiv=x-ua-compatible content="IE=edge"><meta name=viewport content="width=device-width,initial-scale=1"><title>Eclipse Public License 2.0 (EPL) | The Eclipse Foundation</title><meta property="og:title" content="Eclipse Public License 2.0 (EPL) | The Eclipse Foundation"><meta name=twitter:title content="Eclipse Public License 2.0 (EPL) | The Eclipse Foundation"><meta name=description content="The Eclipse Foundation provides our global community of individuals and organisations with a mature, scalable, and business-friendly environment for open source …"><meta property="og:description" content="The Eclipse Foundation provides our global community of individuals and organisations with a mature, scalable, and business-friendly environment for open source …"><meta name=twitter:description content="The Eclipse Foundation provides our global community of individuals and organisations with a mature, scalable, and business-friendly environment for open source …"><meta name=author content="Wayne Beaton"><link href=/favicon.ico rel=icon type=image/x-icon><meta property="og:image" content="https://www.eclipse.org/images/logos/eclipse-foundation-400x400.png"><meta name=twitter:image content="https://www.eclipse.org/images/logos/eclipse-foundation-400x400.png"><meta name=twitter:card content="summary"><meta name=twitter:site content="@eclipsefdn"><meta name=twitter:creator content="@eclipsefdn"><meta property="og:url" content="https://www.eclipse.org/legal/epl-2.0/"><meta property="og:type" content="website"><meta property="og:site_name" content="Eclipse Foundation"><meta name=keywords content="epl,epl-2.0,legal,foundation,eclipse,eclipse public license,license,licenses"><meta name=generator content="Hugo 0.110.0"><link rel=canonical href=https://www.eclipse.org/legal/epl-2.0/><link rel=alternate href=/legal/epl-2.0/index.xml type=application/rss+xml title><link rel=stylesheet href="/public/css/styles.css?v=1730661366"><script>(function(e,t,n,s,o){e[s]=e[s]||[],e[s].push({"gtm.start":(new Date).getTime(),event:"gtm.js"});var a=t.getElementsByTagName(n)[0],i=t.createElement(n),r=s!="dataLayer"?"&l="+s:"";i.async=!0,i.src="https://www.googletagmanager.com/gtm.js?id="+o+r,a.parentNode.insertBefore(i,a)})(window,document,"script","dataLayer","GTM-5WLCZXC")</script><script>var tableClasses="table"</script><link href="https://fonts.googleapis.com/css2?family=Roboto:ital,wght@0,100;0,300;0,400;0,500;0,700;0,900;1,100;1,300;1,400;1,500;1,700;1,900&display=swap" rel=stylesheet type=text/css></head><body><noscript><iframe src="https://www.googletagmanager.com/ns.html?id=GTM-5WLCZXC" height=0 width=0 style=display:none;visibility:hidden></iframe></noscript><a class=sr-only href=#content>Skip to main content</a><header class="header-wrapper header-wrapper" id=header><div class=header-toolbar><div class=container><div class=header-toolbar-row><div class="toolbar-btn toolbar-search-btn dropdown"><button class=dropdown-toggle id=toolbar-search type=button data-toggle=dropdown tabindex=0 aria-label=Search>
+<!doctype html><html lang=en><head><meta charset=utf-8><meta http-equiv=x-ua-compatible content="IE=edge"><meta name=viewport content="width=device-width,initial-scale=1"><title>Eclipse Public License 2.0 (EPL) | The Eclipse Foundation</title><meta property="og:title" content="Eclipse Public License 2.0 (EPL) | The Eclipse Foundation"><meta name=twitter:title content="Eclipse Public License 2.0 (EPL) | The Eclipse Foundation"><meta name=description content="The Eclipse Foundation provides our global community of individuals and organisations with a mature, scalable, and business-friendly environment for open source …"><meta property="og:description" content="The Eclipse Foundation provides our global community of individuals and organisations with a mature, scalable, and business-friendly environment for open source …"><meta name=twitter:description content="The Eclipse Foundation provides our global community of individuals and organisations with a mature, scalable, and business-friendly environment for open source …"><meta name=author content="Wayne Beaton"><link href=/favicon.ico rel=icon type=image/x-icon><meta property="og:image" content="https://www.eclipse.org/images/logos/eclipse-foundation-400x400.png"><meta name=twitter:image content="https://www.eclipse.org/images/logos/eclipse-foundation-400x400.png"><meta name=twitter:card content="summary"><meta name=twitter:site content="@eclipsefdn"><meta name=twitter:creator content="@eclipsefdn"><meta property="og:url" content="https://www.eclipse.org/legal/epl-2.0/"><meta property="og:type" content="website"><meta property="og:site_name" content="Eclipse Foundation"><meta name=keywords content="epl,epl-2.0,legal,foundation,eclipse,eclipse public license,license,licenses"><meta name=generator content="Hugo 0.110.0"><link rel=canonical href=https://www.eclipse.org/legal/epl-2.0/><link rel=alternate href=/legal/epl-2.0/index.xml type=application/rss+xml title><link rel=stylesheet href="/public/css/styles.css?v=1731870966"><script>(function(e,t,n,s,o){e[s]=e[s]||[],e[s].push({"gtm.start":(new Date).getTime(),event:"gtm.js"});var a=t.getElementsByTagName(n)[0],i=t.createElement(n),r=s!="dataLayer"?"&l="+s:"";i.async=!0,i.src="https://www.googletagmanager.com/gtm.js?id="+o+r,a.parentNode.insertBefore(i,a)})(window,document,"script","dataLayer","GTM-5WLCZXC")</script><script>var tableClasses="table"</script><link href="https://fonts.googleapis.com/css2?family=Roboto:ital,wght@0,100;0,300;0,400;0,500;0,700;0,900;1,100;1,300;1,400;1,500;1,700;1,900&display=swap" rel=stylesheet type=text/css></head><body><noscript><iframe src="https://www.googletagmanager.com/ns.html?id=GTM-5WLCZXC" height=0 width=0 style=display:none;visibility:hidden></iframe></noscript><a class=sr-only href=#content>Skip to main content</a><header class="header-wrapper header-wrapper" id=header><div class=header-toolbar><div class=container><div class=header-toolbar-row><div class="toolbar-btn toolbar-search-btn dropdown"><button class=dropdown-toggle id=toolbar-search type=button data-toggle=dropdown tabindex=0 aria-label=Search>
 <i class="fa fa-search fa-lg" aria-role=none></i></button><div class="toolbar-search-bar-wrapper dropdown-menu dropdown-menu-right" aria-labelledby=toolbar-search><form action=https://www.eclipse.org/home/search method=get><div class=search-bar><input class=search-bar-input name=q placeholder=Search>
 <button>
 <i class="fa fa-search" type=submit></i></button></div></form></div></div><div class="toolbar-btn toolbar-user-menu-btn dropdown"><button class=dropdown-toggle id=toolbar-user-menu type=button data-toggle=dropdown tabindex=0 aria-label="User Menu">
@@ -57,5 +57,5 @@ open source software collaboration and innovation.</p></div><div class=mega-menu
 <i class="fa fa-linkedin fa-stack-1x fa-inverse" aria-hidden=true></i>
 <span class=sr-only>Linkedin account</span></span></a></li></ul></div></div><div class="footer-sections row equal-height-md font-bold"><div class=col-md-15><div class=row><section id=footer-eclipse-foundation class="footer-section col-sm-8"><div class=menu-heading>Eclipse Foundation</div><ul class=nav><li><a href=https://www.eclipse.org/org/>About</a></li><li><a href=https://projects.eclipse.org/>Projects</a></li><li><a href=https://www.eclipse.org/collaborations/>Collaborations</a></li><li><a href=https://www.eclipse.org/membership/>Membership</a></li><li><a href=https://www.eclipse.org/sponsor/>Sponsor</a></li></ul></section><section id=footer-legal class="footer-section col-sm-8"><div class=menu-heading>Legal</div><ul class=nav><li><a href=https://www.eclipse.org/legal/privacy/>Privacy Policy</a></li><li><a href=https://www.eclipse.org/legal/terms-of-use/>Terms of Use</a></li><li><a href=https://www.eclipse.org/legal/compliance/>Compliance</a></li><li><a href=https://www.eclipse.org/org/documents/Community_Code_of_Conduct.php>Code of Conduct</a></li><li><a href=https://www.eclipse.org/legal/>Legal Resources</a></li><li><a class=toolbar-manage-cookies href=# onclick=event.preventDefault()>Manage Cookies</a></li></ul></section><section id=footer-more class="footer-section col-sm-8"><div class=menu-heading>More</div><ul class=nav><li><a href=https://www.eclipse.org/security/>Report a Vulnerability</a></li><li><a href=https://status.eclipse.org/>Service Status</a></li><li><a href=https://www.eclipse.org/org/foundation/contact.php>Contact Us</a></li><li><a href=https://www.eclipse.org/projects/support/>Support</a></li></ul></section></div></div><div id=footer-end class="footer-section col-md-8 col-md-offset-1 col-sm-24"><div class=footer-end-newsletter><form id=mc-embedded-subscribe-form action=https://eclipsecon.us6.list-manage.com/subscribe/post method=post novalidate target=_blank><label class=footer-end-newsletter-label for=email>Subscribe to our Newsletter</label><div class=footer-end-newsletter-input-wrapper><input class=footer-end-newsletter-input type=email id=email name=EMAIL autocomplete=email placeholder="Enter your email address"><div><i class="fa fa-solid fa-envelope fa-lg" aria-hidden=true></i></div></div><input type=hidden name=u value=eaf9e1f06f194eadc66788a85>
 <input type=hidden name=id value=46e57eacf1>
-<input id=mc-embedded-subscribe type=submit name=subscribe hidden></form></div></div></div><div class="col-sm-24 margin-top-20"><div class=row><div id=copyright class=col-md-16><p id=copyright-text>Copyright &copy; Eclipse Foundation AISBL. All Rights Reserved.</p></div></div></div><a href=# class=scrollup>Back to the top</a></div></footer><div id=footer-js><script src="/public/js/main.js?v1.0?v=1730661366"></script>
+<input id=mc-embedded-subscribe type=submit name=subscribe hidden></form></div></div></div><div class="col-sm-24 margin-top-20"><div class=row><div id=copyright class=col-md-16><p id=copyright-text>Copyright &copy; Eclipse Foundation AISBL. All Rights Reserved.</p></div></div></div><a href=# class=scrollup>Back to the top</a></div></footer><div id=footer-js><script src="/public/js/main.js?v1.0?v=1731870966"></script>
 <script>(function(){})(jQuery,document)</script></div></body></html>

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@effekt-lang/effekt",
   "author": "Jonathan Brachthäuser",
-  "version": "0.8.0",
+  "version": "0.10.0",
   "repository": {
     "type": "git",
     "url": "git+https://github.com/effekt-lang/effekt.git"