@effekt-lang/effekt 0.11.0 → 0.13.0

package/libraries/common/stream.effekt

@@ -11,7 +11,7 @@ import io/error
 /// Describes push streams by emitting values of type `A`.
 effect emit[A](value: A): Unit
 
-/// Describes pull streams by requiring values of type `A`.
+/// Describes pull streams by reading values of type `A`.
 ///
 /// The producer can decide to `stop` emitting values.
 effect read[A](): A / stop
@@ -28,20 +28,14 @@ def for[A, R] { stream: () => R / emit[A] } { action: A => Unit }: R =
     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`.
+/// Like `for[A, R]`, but ignores the result of the stream, and consequently
+/// works for any type. Use this to annotate 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()
+def for[A] { stream: () => Any / emit[A] } { action: A => Unit }: Unit = {
+  for[A, Any]{stream}{action}
+  ()
 }
 
 /// Turns a `list` into a producer of a push stream
@@ -91,23 +85,28 @@ def boundary[R] { program: () => R / stop }: Option[R] =
   try {
     Some(program())
   } with stop {
-    def stop() = None()
+    None()
   }
 
-def exhaustively[A] { program: () => A / stop } { action: A => Unit }: Unit =
+def boundary { program: () => Any / stop }: Unit = {
+  boundary[Any]{program}
+  ()
+}
+
+/// Run `program` forever until `stop` is thrown.
+def exhaustively { program: () => Any / stop }: Unit =
   try {
     def go(): Unit = {
-      action(program())
+      program()
       go()
     }
     go()
   } with stop {
-    def stop() = ()
+    ()
   }
 
 
-// In Effekt lower bounds are inclusive and upper bounds are exclusive
-
+/// 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] =
@@ -137,7 +136,7 @@ def index[A, R] { stream: () => R / emit[A] }: R / emit[Indexed[A]] = {
 }
 
 /// If `number` is zero or negative it does nothing
-def take[A, R](number: Int) { stream: () => R / emit[A] }: R / { emit[A], stop } = {
+def limit[A, R](number: Int) { stream: () => R / emit[A] }: R / { emit[A], stop } = {
   if (number <= 0) do stop();
   var i = 1;
   try {
@@ -152,6 +151,13 @@ def take[A, R](number: Int) { stream: () => R / emit[A] }: R / { emit[A], stop }
   }
 }
 
+/// If `number` is zero or negative it does nothing
+def limit[A](number: Int) { stream: () => Any / emit[A] }: Unit / emit[A] =
+  boundary {
+    limit[A, Any](number){stream}
+  }
+
+
 /// If `number` is zero or negative it does nothing
 def replicate[A](number: Int) { action: () => A }: Unit / emit[A] =
   if (number > 0) {
@@ -170,8 +176,8 @@ def sum[R] { stream : () => R / emit[Int] }: (R, Int) = {
   }
 }
 
-def sum { stream : () => Unit / emit[Int] }: Int =
-  sum[Unit]{stream}.second
+def sum { stream : () => Any / emit[Int] }: Int =
+  sum[Any]{stream}.second
 
 def collectList[A, R] { stream: () => R / emit[A] }: (R, List[A]) =
   try {
@@ -181,8 +187,8 @@ def collectList[A, R] { stream: () => R / emit[A] }: (R, List[A]) =
     (r, Cons(v, vs))
   }
 
-def collectList[A] { stream: () => Unit / emit[A] }: List[A] =
-  collectList[A, Unit]{stream}.second
+def collectList[A] { stream: () => Any / emit[A] }: List[A] =
+  collectList[A, Any]{stream}.second
 
 def collectArray[A, R] { stream: () => R / emit[A] }: (R, Array[A]) = {
   var i = 0
@@ -197,8 +203,8 @@ def collectArray[A, R] { stream: () => R / emit[A] }: (R, Array[A]) = {
   }
 }
 
-def collectArray[A] { stream: () => Unit / emit[A] }: Array[A] =
-  collectArray[A, Unit]{stream}.second
+def collectArray[A] { stream: () => Any / emit[A] }: Array[A] =
+  collectArray[A, Any]{stream}.second
 
 def collectBytes[R] { stream: () => R / emit[Byte] }: (R, ByteArray) = {
   var i = 0
@@ -213,10 +219,10 @@ def collectBytes[R] { stream: () => R / emit[Byte] }: (R, ByteArray) = {
   }
 }
 
-def collectBytes { stream: () => Unit / emit[Byte] }: ByteArray =
-  collectBytes[Unit]{stream}.second
+def collectBytes { stream: () => Any / emit[Byte] }: ByteArray =
+  collectBytes[Any]{stream}.second
 
-def feed[T](list: List[T]) { reader: () => Unit / read[T] } = {
+def feed[T, R](list: List[T]) { reader: () => R / read[T] }: R = {
   var l = list
   try {
     reader()
@@ -232,14 +238,16 @@ def feed[T](list: List[T]) { reader: () => Unit / read[T] } = {
   }
 }
 
-def feed[T](array: Array[T]) { reader: () => Unit / read[T] } = {
+def feed[T, R](array: Array[T]) { reader: () => R / read[T] }: R = {
   var i = 0
   try {
     reader()
   } with read[T] {
     resume {
       if (i < array.size) {
-        array.unsafeGet(i)
+        val c = i
+        i = c + 1
+        array.unsafeGet(c)
       } else {
         do stop()
       }
@@ -247,14 +255,16 @@ def feed[T](array: Array[T]) { reader: () => Unit / read[T] } = {
   }
 }
 
-def feed(bytes: ByteArray) { reader: () => Unit / read[Byte] } = {
+def feed[R](bytes: ByteArray) { reader: () => R / read[Byte] }: R = {
   var i = 0
   try {
     reader()
   } with read[Byte] {
     resume {
       if (i < bytes.size) {
-        bytes.unsafeGet(i)
+        val c = i
+        i = c + 1
+        bytes.unsafeGet(c)
       } else {
         do stop()
       }
@@ -262,7 +272,7 @@ def feed(bytes: ByteArray) { reader: () => Unit / read[Byte] } = {
   }
 }
 
-def source[A, R] { stream: () => Unit / emit[A] } { reader: () => R / read[A] }: R = {
+def source[A, R] { stream: () => Any / emit[A] } { reader: () => R / read[A] }: R = {
   var next = box { None() }
   next = box {
     try {
@@ -282,6 +292,21 @@ def source[A, R] { stream: () => Unit / emit[A] } { reader: () => R / read[A] }:
   }
 }
 
+def source[A] { stream: () => Any / emit[A] } { reader: () => Any / read[A] }: Unit = {
+  source[A, Any]{stream}{reader}
+  ()
+}
+
+/// Combines two streams together producing a stream of pairs in lockstep.
+/// Given two streams of length `n` and `m`, it produces a stream of length `min(n, m)`.
+def zip[A, B] { stream1: () => Any / emit[A] } { stream2: () => Any / emit[B] } { action: (A, B) => Any }: Unit = {
+  with source[A] { stream1 }
+  with source[B] { stream2 }
+
+  exhaustively {
+    action(do read[A](), do read[B]())
+  }
+}
 
 def writeFile[R](path: String) { stream: () => R / emit[Byte] }: R / Exception[IOError] = {
 
@@ -407,13 +432,15 @@ def feed(string: String) { reader: () => Unit / read[Char] } =
 
 def each(string: String): Unit / emit[Char] =
   feed(string) {
-    exhaustively[Char] { do read() } { char => do emit(char) }
+    exhaustively {
+      do emit[Char](do read[Char]())
+    }
   }
 
 def collectString[R] { stream: () => R / emit[Char] }: (R, String) = {
-  val (result, bytes) = collectBytes { encodeUTF8 { stream } }
+  val (result, bytes) = collectBytes[R] { encodeUTF8 { stream } }
   (result, bytes.toString)
 }
 
-def collectString { stream: () => Unit / emit[Char] }: String =
-  collectString[Unit]{stream}.second
+def collectString { stream: () => Any / emit[Char] }: String =
+  collectString[Any]{stream}.second

package/libraries/llvm/rts.ll

@@ -74,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, %Prompt, i1, %Stack }
+%StackValue = type { %ReferenceCount, %Memory, %Prompt, %Stack }
 
 
 
@@ -111,6 +111,7 @@ declare double @llvm.ceil.f64(double)
 declare double @llvm.floor.f64(double)
 declare void @print(i64)
 declare void @exit(i64)
+declare void @llvm.assume(i1)
 
 
 ; Prompts
@@ -258,20 +259,19 @@ define private %StackPointer @stackAllocate(%Stack %stack, i64 %n) {
     %stackPointer_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 1, i32 0
     %limit_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 1, i32 2
 
-    %currentStackPointer = load %StackPointer, ptr %stackPointer_pointer
-    %limit = load %Limit, ptr %limit_pointer
-
+    %currentStackPointer = load %StackPointer, ptr %stackPointer_pointer, !alias.scope !2
+    %limit = load %Limit, ptr %limit_pointer, !alias.scope !2
     %nextStackPointer = getelementptr i8, %StackPointer %currentStackPointer, i64 %n
     %isInside = icmp ule %StackPointer %nextStackPointer, %limit
     br i1 %isInside, label %continue, label %realloc
 
 continue:
-    store %StackPointer %nextStackPointer, ptr %stackPointer_pointer
+    store %StackPointer %nextStackPointer, ptr %stackPointer_pointer, !alias.scope !2
     ret %StackPointer %currentStackPointer
 
 realloc:
     %base_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 1, i32 1
-    %base = load %Base, ptr %base_pointer
+    %base = load %Base, ptr %base_pointer, !alias.scope !2
 
     %intStackPointer = ptrtoint %StackPointer %currentStackPointer to i64
     %intBase = ptrtoint %Base %base to i64
@@ -285,31 +285,48 @@ realloc:
     %newStackPointer = getelementptr i8, %Base %newBase, i64 %size
     %newNextStackPointer = getelementptr i8, %StackPointer %newStackPointer, i64 %n
 
-    store %StackPointer %newNextStackPointer, ptr %stackPointer_pointer
-    store %Base %newBase, ptr %base_pointer
-    store %Limit %newLimit, ptr %limit_pointer
+    store %StackPointer %newNextStackPointer, ptr %stackPointer_pointer, !alias.scope !2
+    store %Base %newBase, ptr %base_pointer, !alias.scope !2
+    store %Limit %newLimit, ptr %limit_pointer, !alias.scope !2
 
     ret %StackPointer %newStackPointer
 }
 
 define private %StackPointer @stackDeallocate(%Stack %stack, i64 %n) {
     %stackPointer_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 1, i32 0
-    %stackPointer = load %StackPointer, ptr %stackPointer_pointer
+    %stackPointer = load %StackPointer, ptr %stackPointer_pointer, !alias.scope !2
+
+    %limit_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 1, i32 2
+    %limit = load %Limit, ptr %limit_pointer, !alias.scope !2
+    %isInside = icmp ule %StackPointer %stackPointer, %limit
+    call void @llvm.assume(i1 %isInside)
 
     %o = sub i64 0, %n
     %newStackPointer = getelementptr i8, %StackPointer %stackPointer, i64 %o
-    store %StackPointer %newStackPointer, ptr %stackPointer_pointer
+    store %StackPointer %newStackPointer, ptr %stackPointer_pointer, !alias.scope !2
 
     ret %StackPointer %newStackPointer
 }
 
-define i64 @nextPowerOfTwo(i64 %x) {
+define private i64 @nextPowerOfTwo(i64 %x) {
     %leadingZeros = call i64 @llvm.ctlz.i64(i64 %x, i1 false)
     %numBits = sub i64 64, %leadingZeros
     %result = shl i64 1, %numBits
     ret i64 %result
 }
 
+define private void @assumeFrameHeaderWasPopped(%Stack %stack) alwaysinline {
+    %stackPointer_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 1, i32 0
+    %stackPointer = load %StackPointer, ptr %stackPointer_pointer, !alias.scope !2
+    %oldStackPointer = getelementptr %FrameHeader, %StackPointer %stackPointer, i64 1
+
+    %limit_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 1, i32 2
+    %limit = load %Limit, ptr %limit_pointer, !alias.scope !2
+    %isInside = icmp ule %StackPointer %oldStackPointer, %limit
+    call void @llvm.assume(i1 %isInside)
+    ret void
+}
+
 ; Meta-stack management
 
 define private %Memory @newMemory() {
@@ -336,7 +353,7 @@ define private %Stack @reset(%Stack %oldStack) {
 
     %stack.0 = insertvalue %StackValue zeroinitializer, %Memory %stackMemory, 1
     %stack.1 = insertvalue %StackValue %stack.0, %Prompt %prompt, 2
-    %stack.2 = insertvalue %StackValue %stack.1, %Stack %oldStack, 4
+    %stack.2 = insertvalue %StackValue %stack.1, %Stack %oldStack, 3
 
     store %StackValue %stack.2, %Stack %stack
 
@@ -347,59 +364,55 @@ define private %Stack @reset(%Stack %oldStack) {
 }
 
 define private void @updatePrompts(%Stack %stack) {
-    %dirtyBit_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 3
-    %dirtyBit = load i1, ptr %dirtyBit_pointer
-    br i1 %dirtyBit, label %continue, label %done
+    %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
+    %isThis = icmp eq %Stack %promptStack, %stack
+    br i1 %isThis, label %done, label %continue
 
 done:
     ret void
 
 continue:
-    %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
     %isOccupied = icmp ne %Stack %promptStack, null
     br i1 %isOccupied, label %displace, label %update
 
 displace:
-    call void @displace(%Stack %promptStack)
+    call void @displace(%Stack %promptStack, %Stack %promptStack)
     br label %update
 
 update:
     store %Stack %stack, ptr %stack_pointer
-    store i1 0, ptr %dirtyBit_pointer
 
-    %next_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 4
+    %next_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 3
     %next = load %Stack, ptr %next_pointer
     tail call void @updatePrompts(%Stack %next)
     ret void
 }
 
-define void @displace(%Stack %stack) {
+define private void @displace(%Stack %stack, %Stack %end) {
     %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
-
-done:
-    ret void
-
-continue:
+    %next_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 3
     %prompt = load %Prompt, ptr %prompt_pointer
     %stack_pointer = getelementptr %PromptValue, %Prompt %prompt, i64 0, i32 1
     store %Stack null, ptr %stack_pointer
-    store i1 1, ptr %dirtyBit_pointer
 
     %next = load %Stack, ptr %next_pointer
-    tail call void @displace(%Stack %next)
+    %isEnd = icmp eq %Stack %next, %end
+    br i1 %isEnd, label %done, label %continue
+
+done:
+    ret void
+
+continue:
+    tail call void @displace(%Stack %next, %Stack %end)
     ret void
 }
 
-define %Stack @resume(%Resumption %resumption, %Stack %oldStack) {
+define private %Stack @resume(%Resumption %resumption, %Stack %oldStack) {
     %uniqueResumption = call %Resumption @uniqueStack(%Resumption %resumption)
-    %rest_pointer = getelementptr %StackValue, %Resumption %uniqueResumption, i64 0, i32 4
+    %rest_pointer = getelementptr %StackValue, %Resumption %uniqueResumption, i64 0, i32 3
     %start = load %Stack, ptr %rest_pointer
     call void @updatePrompts(%Stack %start)
 
@@ -411,7 +424,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 4
+    %next_pointer = getelementptr %StackValue, %Stack %resumption, i64 0, i32 3
     %next = load %Stack, ptr %next_pointer
 
     store %Stack %stack, ptr %next_pointer
@@ -427,31 +440,7 @@ define private void @eraseMemory(%Memory %memory) {
     ret void
 }
 
-define private void @forEachObject(ptr %elementPointer, ptr %end, ptr %f) alwaysinline {
-    %done = icmp uge ptr %elementPointer, %end
-    br i1 %done, label %return, label %erase
-
-erase:
-    %element = load %Pos, ptr %elementPointer
-    call void %f(%Pos %element)
-
-    %nextElementPointer = getelementptr %Pos, ptr %elementPointer, i64 1
-    tail call void @forEachObject(ptr %nextElementPointer, ptr %end, ptr %f)
-    ret void
-
-return:
-    ret void
-}
-
-define void @erasePrompt(%Prompt %prompt, i1 %dirtyBit) alwaysinline {
-    br i1 %dirtyBit, label %continue, label %clearPrompt
-
-clearPrompt:
-    %stack_pointer = getelementptr %PromptValue, %Prompt %prompt, i64 0, i32 1
-    store %Stack null, ptr %stack_pointer
-    br label %continue
-
-continue:
+define private void @erasePrompt(%Prompt %prompt) alwaysinline {
     %referenceCount_pointer = getelementptr %PromptValue, %Prompt %prompt, i64 0, i32 0
     %referenceCount = load %ReferenceCount, ptr %referenceCount_pointer
     switch %ReferenceCount %referenceCount, label %decrement [%ReferenceCount 0, label %free]
@@ -466,7 +455,7 @@ free:
     ret void
 }
 
-define void @sharePrompt(%Prompt %prompt) alwaysinline {
+define private void @sharePrompt(%Prompt %prompt) alwaysinline {
     %referenceCount_pointer = getelementptr %PromptValue, %Prompt %prompt, i64 0, i32 0
     %referenceCount = load %ReferenceCount, ptr %referenceCount_pointer
     %newReferenceCount = add %ReferenceCount %referenceCount, 1
@@ -477,16 +466,17 @@ define void @sharePrompt(%Prompt %prompt) alwaysinline {
 define private %Stack @underflowStack(%Stack %stack) {
     %stackMemory = getelementptr %StackValue, %Stack %stack, i64 0, i32 1
     %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
+    %stackRest = getelementptr %StackValue, %Stack %stack, i64 0, i32 3
 
     %memory = load %Memory, ptr %stackMemory
     %prompt = load %Prompt, ptr %stackPrompt
     %rest = load %Stack, ptr %stackRest
-    %dirtyBit = load i1, ptr %stackDirtyBit
+
+    %promptStack_pointer = getelementptr %PromptValue, %Prompt %prompt, i64 0, i32 1
+    store %Stack null, ptr %promptStack_pointer
 
     call void @eraseMemory(%Memory %memory)
-    call void @erasePrompt(%Prompt %prompt, i1 false)
+    call void @erasePrompt(%Prompt %prompt)
     call void @free(%Stack %stack)
 
     ret %Stack %rest
@@ -537,7 +527,7 @@ done:
 copy:
     %newOldReferenceCount = sub %ReferenceCount %referenceCount, 1
     store %ReferenceCount %newOldReferenceCount, ptr %referenceCount_pointer
-    %stack_pointer = getelementptr %StackValue, %Resumption %resumption, i64 0, i32 4
+    %stack_pointer = getelementptr %StackValue, %Resumption %resumption, i64 0, i32 3
     %stack = load %Stack, ptr %stack_pointer
 
     %size = ptrtoint ptr getelementptr (%StackValue, ptr null, i64 1) to i64
@@ -551,7 +541,7 @@ loop:
 
     %stackMemory = getelementptr %StackValue, %Stack %old, i64 0, i32 1
     %stackPrompt = getelementptr %StackValue, %Stack %old, i64 0, i32 2
-    %stackRest = getelementptr %StackValue, %Stack %old, i64 0, i32 4
+    %stackRest = getelementptr %StackValue, %Stack %old, i64 0, i32 3
 
     %memory = load %Memory, ptr %stackMemory
     %prompt = load %Prompt, ptr %stackPrompt
@@ -560,8 +550,7 @@ loop:
     %newStackReferenceCounter = getelementptr %StackValue, %Stack %newStack, i64 0, i32 0
     %newStackMemory = getelementptr %StackValue, %Stack %newStack, i64 0, i32 1
     %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
+    %newStackRest = getelementptr %StackValue, %Stack %newStack, i64 0, i32 3
 
     %newMemory = call %Memory @copyMemory(%Memory %memory)
 
@@ -573,7 +562,6 @@ loop:
     store %ReferenceCount 0, ptr %newStackReferenceCounter
     store %Memory %newMemory, ptr %newStackMemory
     store %Prompt %prompt, ptr %newStackPrompt
-    store i1 1, ptr %newStackDirtyBit
 
     %isEnd = icmp eq %Stack %old, %resumption
     br i1 %isEnd, label %stop, label %next
@@ -607,7 +595,7 @@ define void @eraseResumption(%Resumption %resumption) alwaysinline {
     ret void
 
     free:
-    %stack_pointer = getelementptr %StackValue, %Resumption %resumption, i64 0, i32 4
+    %stack_pointer = getelementptr %StackValue, %Resumption %resumption, i64 0, i32 3
     %stack = load %Stack, ptr %stack_pointer
     store %Stack null, ptr %stack_pointer
     call void @eraseStack(%Stack %stack)
@@ -617,17 +605,25 @@ define void @eraseResumption(%Resumption %resumption) alwaysinline {
 define void @eraseStack(%Stack %stack) alwaysinline {
     %stackPointer_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 1, i32 0
     %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
+    %rest_pointer = getelementptr %StackValue, %Stack %stack, i64 0, i32 3
 
     %stackPointer = load %StackPointer, ptr %stackPointer_pointer
     %prompt = load %Stack, ptr %prompt_pointer
-    %dirtyBit = load i1, ptr %dirtyBit_pointer
     %rest = load %Stack, ptr %rest_pointer
 
+    %promptStack_pointer = getelementptr %PromptValue, %Prompt %prompt, i64 0, i32 1
+    %promptStack = load %Stack, ptr %promptStack_pointer
+    %isThisStack = icmp eq %Stack %promptStack, %stack
+    br i1 %isThisStack, label %clearPrompt, label %free
+
+clearPrompt:
+    store %Stack null, ptr %promptStack_pointer
+    br label %free
+
+free:
     call void @free(%Stack %stack)
     call void @eraseFrames(%StackPointer %stackPointer)
-    call void @erasePrompt(%Prompt %prompt, i1 %dirtyBit)
+    call void @erasePrompt(%Prompt %prompt)
 
     %isNull = icmp eq %Stack %rest, null
     br i1 %isNull, label %done, label %next
@@ -776,3 +772,13 @@ define void @run_Pos(%Neg %f, %Pos %argument) {
     tail call tailcc %Pos %functionPointer(%Object %object, %Evidence 0, %Pos %argument, %Stack %stack)
     ret void
 }
+
+
+; Scope domains
+!0 = !{!"types"}
+
+; Scopes
+!1 = !{!"stackValues", !0}
+
+; Scope lists
+!2 = !{!1}

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=1732475737"><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=1733685326"><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=1732475737"></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=1733685326"></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.11.0",
+  "version": "0.13.0",
   "repository": {
     "type": "git",
     "url": "git+https://github.com/effekt-lang/effekt.git"