@effekt-lang/effekt 0.14.0 → 0.16.0

package/libraries/common/stream.effekt

@@ -19,24 +19,13 @@ 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 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: () => Any / emit[A] } { action: A => Unit }: Unit = {
-  for[A, Any]{stream}{action}
-  ()
-}
+def for[A] { stream: () => Unit / emit[A] } { action: A => Unit }: Unit =
+  returning::for[A, Unit]{stream}{action}
 
 /// Turns a `list` into a producer of a push stream
 /// by emitting each contained value left-to-right.
@@ -81,20 +70,13 @@ def each(bytes: ByteArray): Unit / emit[Byte] = {
 // not seq
 
 
-def boundary[R] { program: () => R / stop }: Option[R] =
-  try {
-    Some(program())
-  } with stop {
-    None()
-  }
-
-def boundary { program: () => Any / stop }: Unit = {
-  boundary[Any]{program}
+def boundary { program: () => Unit / stop }: Unit = {
+  returning::boundary[Unit]{program}
   ()
 }
 
 /// Run `program` forever until `stop` is thrown.
-def exhaustively { program: () => Any / stop }: Unit =
+def exhaustively { program: () => Unit / stop }: Unit =
   try {
     def go(): Unit = {
       program()
@@ -105,6 +87,24 @@ def exhaustively { program: () => Any / stop }: Unit =
     ()
   }
 
+def many[A] { action: () => A / stop }: Unit / emit[A] =
+  exhaustively { do emit(action()) }
+
+def some[A] { action: () => A / stop }: Unit / { emit[A], stop } = {
+  do emit(action())
+  many { action() }
+}
+
+def optionally { program: () => Unit / stop }: Bool =
+  returning::optionally[Unit]{program}.isDefined
+
+def attempt[R] { program: () => R / stop } { fallback: () => R }: R =
+  try {
+    program()
+  } with stop {
+    fallback()
+  }
+
 
 /// In Effekt lower bounds are inclusive and upper bounds are exclusive
 record Indexed[A](index: Int, value: A)
@@ -123,39 +123,13 @@ def rangeFrom(lower: Int): Unit / emit[Int] = {
   rangeFrom(lower + 1)
 }
 
+def index[A] { stream: () => Unit / emit[A] }: Unit / emit[Indexed[A]] =
+  returning::index[A, Unit]{stream}
 
-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 limit[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 limit[A](number: Int) { stream: () => Any / emit[A] }: Unit / emit[A] =
-  boundary {
-    limit[A, Any](number){stream}
-  }
+def limit[A](number: Int) { stream: () => Unit / emit[A] }: Unit / {emit[A], stop} =
+  returning::limit[A, Unit](number){stream}
 
 
 /// If `number` is zero or negative it does nothing
@@ -166,61 +140,17 @@ def replicate[A](number: Int) { action: () => A }: Unit / emit[A] =
   }
 
 
-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 =
+  returning::sum[Unit]{stream}.second
 
-def sum { stream : () => Any / emit[Int] }: Int =
-  sum[Any]{stream}.second
+def collectList[A] { stream: () => Unit / emit[A] }: List[A] =
+  returning::collectList[A, 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: () => Any / emit[A] }: List[A] =
-  collectList[A, Any]{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: () => Any / emit[A] }: Array[A] =
-  collectArray[A, Any]{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 collectArray[A] { stream: () => Unit / emit[A] }: Array[A] =
+  returning::collectArray[A, Unit]{stream}.second
 
-def collectBytes { stream: () => Any / emit[Byte] }: ByteArray =
-  collectBytes[Any]{stream}.second
+def collectBytes { stream: () => Unit / emit[Byte] }: ByteArray =
+  returning::collectBytes[Unit]{stream}.second
 
 def feed[T, R](list: List[T]) { reader: () => R / read[T] }: R = {
   var l = list
@@ -272,34 +202,12 @@ def feed[R](bytes: ByteArray) { reader: () => R / read[Byte] }: R = {
   }
 }
 
-def source[A, R] { stream: () => Any / 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 source[A] { stream: () => Any / emit[A] } { reader: () => Any / read[A] }: Unit = {
-  source[A, Any]{stream}{reader}
-  ()
-}
+def source[A] { stream: () => Unit / emit[A] } { reader: () => Unit / read[A] }: Unit =
+  returning::source[A, Unit]{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 = {
+/// Terminates when either of them terminates.
+def zip[A, B] { stream1: () => Unit / emit[A] } { stream2: () => Unit / emit[B] } { action: (A, B) => Unit }: Unit = {
   with source[A] { stream1 }
   with source[B] { stream2 }
 
@@ -423,7 +331,7 @@ def encodeUTF8[R] { stream: () => R / emit[Char] }: R / emit[Byte] =
     resume(encodeChar(char))
   }
 
-def feed(string: String) { reader: () => Unit / read[Char] } =
+def feed[R](string: String) { reader: () => R / read[Char] } =
   feed(string.fromString) {
     decodeUTF8 {
       reader()
@@ -437,10 +345,129 @@ def each(string: String): Unit / emit[Char] =
     }
   }
 
+def collectString { stream: () => Unit / emit[Char] }: String =
+  returning::collectString[Unit]{stream}.second
+
+namespace returning {
+
+/// 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))
+  }
+
+def boundary[R] { program: () => R / stop }: Option[R] =
+  try {
+    Some(program())
+  } with stop {
+    None()
+  }
+
+def optionally[R] { program: () => R / stop }: Option[R] =
+  try {
+    Some(program())
+  } with stop {
+    None()
+  }
+
+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 limit[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()
+    }
+  }
+}
+
+def sum[R] { stream : () => R / emit[Int] }: (R, Int) = {
+  var s = 0;
+  try {
+    (stream(), s)
+  } with emit[Int] { v =>
+    s = s + v;
+    resume(())
+  }
+}
+
+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 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 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 collectString[R] { stream: () => R / emit[Char] }: (R, String) = {
   val (result, bytes) = collectBytes[R] { encodeUTF8 { stream } }
   (result, bytes.toString)
 }
 
-def collectString { stream: () => Any / emit[Char] }: String =
-  collectString[Any]{stream}.second
+def source[A, R] { stream: () => Unit / emit[A] } { reader: () => R / read[A] }: R = {
+  var next = box { None() }
+  next = box {
+    try {
+      stream()
+      next = box { None() }
+      None()
+    } with emit[A] { (v) =>
+      next = box { resume(()) }
+      Some(v)
+    }
+  }
+  try {
+    reader()
+  } with read[A] {
+    resume {
+      next().getOrElse { do stop() }
+    }
+  }
+}
+
+}

package/libraries/llvm/array.c

@@ -32,13 +32,16 @@ struct Pos c_array_new(const Int size) {
 
 Int c_array_size(const struct Pos arr) {
   uint64_t *sizePtr = arr.obj + sizeof(struct Header);
-  return *sizePtr;
+  uint64_t size = *sizePtr;
+  erasePositive(arr);
+  return size;
 }
 
 struct Pos c_array_get(const struct Pos arr, const Int index) {
   struct Pos *dataPtr = arr.obj + sizeof(struct Header) + sizeof(uint64_t);
   struct Pos element = dataPtr[index];
   sharePositive(element);
+  erasePositive(arr);
   return element;
 }
 
@@ -47,6 +50,7 @@ struct Pos c_array_set(const struct Pos arr, const Int index, const struct Pos v
   struct Pos element = dataPtr[index];
   erasePositive(element);
   dataPtr[index] = value;
+  erasePositive(arr);
   return Unit;
 }
 

package/libraries/llvm/bytearray.c

@@ -29,30 +29,34 @@ struct Pos c_bytearray_new(const Int size) {
 }
 
 Int c_bytearray_size(const struct Pos arr) {
+  erasePositive(arr);
   return arr.tag;
 }
 
-uint8_t* c_bytearray_data(const struct Pos arr) {
-  return arr.obj + sizeof(struct Header);
-}
-
 Byte c_bytearray_get(const struct Pos arr, const Int index) {
   Byte *dataPtr = arr.obj + sizeof(struct Header);
   Byte element = dataPtr[index];
+  erasePositive(arr);
   return element;
 }
 
 struct Pos c_bytearray_set(const struct Pos arr, const Int index, const Byte value) {
   Byte *dataPtr = arr.obj + sizeof(struct Header);
   dataPtr[index] = value;
+  erasePositive(arr);
   return Unit;
 }
 
+// Internal Operations
+
+uint8_t* c_bytearray_data(const struct Pos arr) {
+    uint8_t *data = arr.obj + sizeof(struct Header);
+    return data;
+}
+
 struct Pos c_bytearray_construct(const uint64_t n, const uint8_t *data) {
     struct Pos arr = c_bytearray_new(n);
-
     memcpy(c_bytearray_data(arr), data, n);
-
     return arr;
 }
 
@@ -66,7 +70,7 @@ struct Pos c_bytearray_from_nullterminated_string(const char *data) {
 }
 
 char* c_bytearray_into_nullterminated_string(const struct Pos arr) {
-    uint64_t size = c_bytearray_size(arr);
+    uint64_t size = arr.tag;
 
     char* result = (char*)malloc(size + 1);
 
@@ -125,12 +129,14 @@ struct Pos c_bytearray_show_Double(const Double x) {
 
 // TODO do this in Effekt
 struct Pos c_bytearray_concatenate(const struct Pos left, const struct Pos right) {
-    const struct Pos concatenated = c_bytearray_new(c_bytearray_size(left) + c_bytearray_size(right));
-    for (int64_t j = 0; j < c_bytearray_size(concatenated); ++j)
+    uint64_t left_size = left.tag;
+    uint64_t right_size = right.tag;
+    const struct Pos concatenated = c_bytearray_new(left_size + right_size);
+    for (uint64_t j = 0; j < concatenated.tag; ++j)
         c_bytearray_data(concatenated)[j]
-            = j < c_bytearray_size(left)
+            = j < left_size
             ? c_bytearray_data(left)[j]
-            : c_bytearray_data(right)[j - c_bytearray_size(left)];
+            : c_bytearray_data(right)[j - left_size];
 
     erasePositive(left);
     erasePositive(right);
@@ -139,8 +145,8 @@ struct Pos c_bytearray_concatenate(const struct Pos left, const struct Pos right
 
 // TODO do this in Effekt
 struct Pos c_bytearray_equal(const struct Pos left, const struct Pos right) {
-    uint64_t left_size = c_bytearray_size(left);
-    uint64_t right_size = c_bytearray_size(right);
+    uint64_t left_size = left.tag;
+    uint64_t right_size = right.tag;
     if (left_size != right_size) {
         erasePositive(left);
         erasePositive(right);
@@ -161,7 +167,7 @@ struct Pos c_bytearray_equal(const struct Pos left, const struct Pos right) {
 // TODO deprecate
 struct Pos c_bytearray_substring(const struct Pos str, uint64_t start, uint64_t end) {
     const struct Pos substr = c_bytearray_new(end - start);
-    for (int64_t j = 0; j < c_bytearray_size(substr); ++j) {
+    for (uint64_t j = 0; j < substr.tag; ++j) {
         c_bytearray_data(substr)[j] = c_bytearray_data(str)[start+j];
     }
     erasePositive(str);
@@ -174,27 +180,27 @@ uint32_t c_bytearray_character_at(const struct Pos str, const uint64_t index) {
     uint8_t first_byte = bytes[index];
     uint32_t character = 0;
 
-    uint32_t length = c_bytearray_size(str);
+    uint32_t size = str.tag;
 
     if (first_byte < 0x80) {
         // Single-byte character (0xxxxxxx)
         character = first_byte;
     } else if ((first_byte & 0xE0) == 0xC0) {
         // Two-byte character (110xxxxx 10xxxxxx)
-        if (index + 1 < length) {
+        if (index + 1 < size) {
             character = ((first_byte & 0x1F) << 6) |
                         (bytes[index + 1] & 0x3F);
         }
     } else if ((first_byte & 0xF0) == 0xE0) {
         // Three-byte character (1110xxxx 10xxxxxx 10xxxxxx)
-        if (index + 2 < length) {
+        if (index + 2 < size) {
             character = ((first_byte & 0x0F) << 12) |
                         ((bytes[index + 1] & 0x3F) << 6) |
                         (bytes[index + 2] & 0x3F);
         }
     } else if ((first_byte & 0xF8) == 0xF0) {
         // Four-byte character (11110xxx 10xxxxxx 10xxxxxx 10xxxxxx)
-        if (index + 3 < length) {
+        if (index + 3 < size) {
             character = ((first_byte & 0x07) << 18) |
                         ((bytes[index + 1] & 0x3F) << 12) |
                         ((bytes[index + 2] & 0x3F) << 6) |

package/libraries/llvm/io.c

@@ -20,7 +20,7 @@ void c_io_println_Double(const Double x) {
 }
 
 void c_io_println_String(String text) {
-    for (int64_t j = 0; j < c_bytearray_size(text); ++j)
+    for (uint64_t j = 0; j < text.tag; ++j)
         putchar(c_bytearray_data(text)[j]);
     erasePositive(text);
     putchar('\n');
@@ -126,8 +126,8 @@ void c_fs_open(String path, struct Pos mode, Stack stack) {
 void c_fs_read(Int file, struct Pos buffer, Int offset, Int size, Int position, Stack stack) {
 
     uv_buf_t buf = uv_buf_init((char*)(c_bytearray_data(buffer) + offset), size);
-    // erasePositive(buffer);
-    // TODO we should erase the buffer but abort if this was the last reference
+    erasePositive(buffer);
+    // TODO panic if this was the last reference
 
     uv_fs_t* request = malloc(sizeof(uv_fs_t));
     request->data = stack;
@@ -144,8 +144,8 @@ void c_fs_read(Int file, struct Pos buffer, Int offset, Int size, Int position,
 void c_fs_write(Int file, struct Pos buffer, Int offset, Int size, Int position, Stack stack) {
 
     uv_buf_t buf = uv_buf_init((char*)(c_bytearray_data(buffer) + offset), size);
-    // erasePositive(buffer);
-    // TODO we should erase the buffer but abort if this was the last reference
+    erasePositive(buffer);
+    // TODO panic if this was the last reference
 
     uv_fs_t* request = malloc(sizeof(uv_fs_t));
     request->data = stack;

package/libraries/llvm/main.c

@@ -9,7 +9,6 @@
 
 #define DEBUG_REFCOUNT (false)
 
-#include "sanity.c"
 #include "types.c"
 #include "bytearray.c"
 #include "io.c"

package/libraries/llvm/ref.c

@@ -31,6 +31,7 @@ struct Pos c_ref_get(const struct Pos ref) {
   struct Pos *fieldPtr = ref.obj + sizeof(struct Header);
   struct Pos element = *fieldPtr;
   sharePositive(element);
+  erasePositive(ref);
   return element;
 }
 
@@ -39,6 +40,7 @@ struct Pos c_ref_set(const struct Pos ref, const struct Pos value) {
   struct Pos element = *fieldPtr;
   erasePositive(element);
   *fieldPtr = value;
+  erasePositive(ref);
   return Unit;
 }
 

package/libraries/llvm/rts.ll

@@ -114,6 +114,26 @@ declare void @exit(i64)
 declare void @llvm.assume(i1)
 
 
+; Boxing (externs functions, hence ccc)
+define ccc %Pos @box(%Neg %input) {
+    %vtable = extractvalue %Neg %input, 0
+    %heap_obj = extractvalue %Neg %input, 1
+    %vtable_as_int = ptrtoint ptr %vtable to i64
+    %pos_result = insertvalue %Pos undef, i64 %vtable_as_int, 0
+    %pos_result_with_heap = insertvalue %Pos %pos_result, ptr %heap_obj, 1
+    ret %Pos %pos_result_with_heap
+}
+
+define ccc %Neg @unbox(%Pos %input) {
+    %tag = extractvalue %Pos %input, 0
+    %heap_obj = extractvalue %Pos %input, 1
+    %vtable = inttoptr i64 %tag to ptr
+    %neg_result = insertvalue %Neg undef, ptr %vtable, 0
+    %neg_result_with_heap = insertvalue %Neg %neg_result, ptr %heap_obj, 1
+    ret %Neg %neg_result_with_heap
+}
+
+
 ; Prompts
 
 define private %Prompt @currentPrompt(%Stack %stack) {

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=1734290143"><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=1736104525"><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-brands fa-linkedin-in 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=1734290143"></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=1736104525"></script>
 <script>(function(){})(jQuery,document)</script></div></body></html>