@effekt-lang/effekt 0.30.0 → 0.32.0

package/libraries/chez/common/effekt_primitives.ss

@@ -11,6 +11,7 @@
     ;     (string-append name))]
     [(list? obj) (map show_impl obj)]
     [(record? obj) (show-record obj)]
+    [(eqv? obj (void)) "()"]
     [else (generic-show obj)]))
 
 (define (generic-show obj)

package/libraries/common/char.effekt

@@ -1,7 +1,10 @@
 /// Warning: This library currently only works with ASCII characters, **not** unicode!
 module char
 
+import effekt
 import exception
+import option
+import result
 
 
 /// Checks if the given character is an ASCII whitespace
@@ -15,56 +18,51 @@ def isWhitespace(c: Char): Bool = c match {
   case _      => false
 }
 
-/// Gets the value of a given ASCII digit in base 10
-def digitValue(char: Char): Option[Int] =
-  // TODO use fail
+/// Gets the value of a given ASCII digit in base 10,
+/// throwing an exception on wrong format
+def digitValue(char: Char): Int / Exception[WrongFormat] =
   if (char >= '0' && char <= '9') {
-    Some(char.toInt - '0'.toInt)
+    char.toInt - '0'.toInt
   } else {
-    None()
+    wrongFormat("Not a valid digit: '" ++ char.toString ++ "' in base 10")
   }
 
-/// Gets the value of a given ASCII digit in base 16
-def hexDigitValue(char: Char): Option[Int] =
-  // TODO use fail
+/// Gets the value of a given ASCII digit in base 16,
+/// throwing an exception on wrong format
+def hexDigitValue(char: Char): Int / Exception[WrongFormat] =
   char match {
-    case char and char >= '0' && char <= '9' => Some(char.toInt - '0'.toInt)
-    case char and char >= 'A' && char <= 'F' => Some((char.toInt - 'A'.toInt) + 10)
-    case char and char >= 'a' && char <= 'f' => Some((char.toInt - 'a'.toInt) + 10)
-    case _ => None()
+    case char and char >= '0' && char <= '9' => char.toInt - '0'.toInt
+    case char and char >= 'A' && char <= 'F' => (char.toInt - 'A'.toInt) + 10
+    case char and char >= 'a' && char <= 'f' => (char.toInt - 'a'.toInt) + 10
+    case _ => wrongFormat("Not a valid digit: '" ++ char.toString ++ "' in base 16")
   }
 
-/// Gets the value of a given ASCII digit in the given base up to 36
-def digitValue(char: Char, base: Int): Option[Int] = {
-  // TODO use fail
-  val perhapsDigit = char match {
-      case char and char >= '0' && char <= '9' => Some(char.toInt - '0'.toInt)
-      case char and char >= 'A' && char <= 'Z' => Some((char.toInt - 'A'.toInt) + 10)
-      case char and char >= 'a' && char <= 'z' => Some((char.toInt - 'a'.toInt) + 10)
-      case _ => None()
-    }
-  perhapsDigit match {
-    case Some(digit) =>
-      if (digit < base) {
-        Some(digit)
-      } else {
-        None()
-      }
-    case None() => None()
+/// Gets the value of a given ASCII digit in the given base up to 36,
+/// throwing an exception on wrong format
+def digitValue(char: Char, base: Int): Int / Exception[WrongFormat] = {
+  val digit = char match {
+    case char and char >= '0' && char <= '9' => char.toInt - '0'.toInt
+    case char and char >= 'A' && char <= 'Z' => (char.toInt - 'A'.toInt) + 10
+    case char and char >= 'a' && char <= 'z' => (char.toInt - 'a'.toInt) + 10
+    case _ => wrongFormat("Not a valid digit: '" ++ char.toString ++ "'")
   }
+  if (digit >= base) {
+    wrongFormat("Digit '" ++ digit.show ++ "' is too big for base " ++ base.show)
+  }
+  digit
 }
 
 /// Checks if the given character is an ASCII digit in base 10
-/// Use `digitValue(c: Char)` to get the numeric value out.
-def isDigit(char: Char): Bool = digitValue(char).isDefined
+/// Prefer using `digitValue(c: Char)` to get the numeric value out.
+def isDigit(char: Char): Bool = result[Int, WrongFormat] { digitValue(char) }.isSuccess
 
 /// Checks if the given character is an ASCII digit in base 16
-/// Use `hexDigitValue(c: Char)` to get the numeric value out.
-def isHexDigit(char: Char): Bool = hexDigitValue(char).isDefined
+/// Prefer using `hexDigitValue(c: Char)` to get the numeric value out.
+def isHexDigit(char: Char): Bool = result[Int, WrongFormat] { hexDigitValue(char)}.isSuccess
 
 /// Checks if the given character is an ASCII digit in base 10
-/// Use `digitValue(c: Char)` to get the numeric value out.
-def isDigit(char: Char, base: Int): Bool = digitValue(char, base).isDefined
+/// Prefer using `digitValue(c: Char, base: Int)` to get the numeric value out.
+def isDigit(char: Char, base: Int): Bool = result[Int, WrongFormat] { digitValue(char, base) }.isSuccess
 
 /// Checks if a given character is a 7-bit ASCII character
 def isASCII(c: Char): Bool = { c.toInt < 128 }
@@ -80,3 +78,100 @@ 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)
+
+// Characters
+// ----------
+//
+//   JS: Int (Unicode codepoints)
+//   Chez: ?
+//   LLVM: i64 representing utf-8 (varying length 1-4 bytes)
+
+extern pure def toString(ch: Char): String =
+  js "String.fromCodePoint(${ch})"
+  chez "(string (integer->char ${ch}))"
+  llvm """
+    %z = call %Pos @c_bytearray_show_Char(%Int ${ch})
+    ret %Pos %z
+  """
+
+// Since we currently represent Char by integers in all backends, we could reuse comparison
+extern pure def toInt(ch: Char): Int =
+  js "${ch}"
+  chez "${ch}"
+  llvm "ret %Int ${ch}"
+  vm "string::toInt(Char)"
+
+extern pure def toChar(codepoint: Int): Char =
+  js "${codepoint}"
+  chez "${codepoint}"
+  llvm "ret %Int ${codepoint}"
+  vm "string::toChar(Int)"
+
+
+extern pure def infixLt(x: Char, y: Char): Bool =
+  js "(${x} < ${y})"
+  chez "(< ${x} ${y})"
+  llvm """
+    %z = icmp slt %Int ${x}, ${y}
+    %fat_z = zext i1 %z to i64
+    %adt_boolean = insertvalue %Pos zeroinitializer, i64 %fat_z, 0
+    ret %Pos %adt_boolean
+  """
+  vm "string::infixLt(Char, Char)"
+
+extern pure def infixLte(x: Char, y: Char): Bool =
+  js "(${x} <= ${y})"
+  chez "(<= ${x} ${y})"
+  llvm """
+    %z = icmp sle %Int ${x}, ${y}
+    %fat_z = zext i1 %z to i64
+    %adt_boolean = insertvalue %Pos zeroinitializer, i64 %fat_z, 0
+    ret %Pos %adt_boolean
+  """
+  vm "string::infixLte(Char, Char)"
+
+extern pure def infixGt(x: Char, y: Char): Bool =
+  js "(${x} > ${y})"
+  chez "(> ${x} ${y})"
+  llvm """
+    %z = icmp sgt %Int ${x}, ${y}
+    %fat_z = zext i1 %z to i64
+    %adt_boolean = insertvalue %Pos zeroinitializer, i64 %fat_z, 0
+    ret %Pos %adt_boolean
+  """
+  vm "string::infixGt(Char, Char)"
+
+extern pure def infixGte(x: Char, y: Char): Bool =
+  js "(${x} >= ${y})"
+  chez "(>= ${x} ${y})"
+  llvm """
+    %z = icmp sge %Int ${x}, ${y}
+    %fat_z = zext i1 %z to i64
+    %adt_boolean = insertvalue %Pos zeroinitializer, i64 %fat_z, 0
+    ret %Pos %adt_boolean
+  """
+  vm "string::infixGte(Char, Char)"
+
+
+/**
+ * Determines the number of bytes needed by a codepoint
+ *
+ * Also see: https://en.wikipedia.org/wiki/UTF-8
+ */
+def utf8ByteCount(codepoint: Char): Int = codepoint match {
+  case c and c >= \u0000  and c <= \u007F   => 1
+  case c and c >= \u0080  and c <= \u07FF   => 2
+  case c and c >= \u0800  and c <= \uFFFF   => 3
+  case c and c >= \u10000 and c <= \u10FFFF => 4
+  case c => panic("Not a valid code point")
+}
+
+def utf16UnitCount(codepoint: Char): Int = codepoint match {
+  case c and c >= \u0000  and c <= \uFFFF   => 1
+  case c and c >= \u10000 and c <= \u10FFFF => 4
+  case c => panic("Not a valid code point")
+}
+
+extern pure def charWidth(c: Char): Int =
+  // JavaScript strings are UTF-16 where every unicode character after 0xffff takes two units
+  js "(${c} > 0xffff) ? 2 : 1"

package/libraries/common/effekt.effekt

@@ -42,11 +42,32 @@ extern def println(value: String): Unit =
   js "$effekt.println(${value})"
   chez "(println_impl ${value})"
   llvm """
-    call void @c_io_println_String(%Pos ${value})
+    call void @c_io_println(%Pos ${value})
     ret %Pos zeroinitializer ; Unit
   """
   vm "effekt::println(String)"
 
+extern jsNode """
+$effekt.readln = function readln$impl(callback) {
+  const readline = require('node:readline').createInterface({
+    input: process.stdin,
+    output: process.stdout,
+  });
+  readline.question('', (answer) => {
+    readline.close();
+    callback(answer);
+  });
+}
+"""
+
+extern async def readln(): String =
+  jsNode "$effekt.capture(callback => $effekt.readln(callback))"
+  llvm """
+    %result = call %Pos @c_io_readln()
+    tail call void @resume_Pos(%Stack %stack, %Pos %result)
+    ret void
+  """
+
 def println(value: Int): Unit = println(value.show)
 def println(value: Unit): Unit = println(value.show)
 def println(value: Double): Unit = println(value.show)
@@ -736,6 +757,9 @@ def repeat(n: Int) { action: () => Unit } = each(0, n) { n => action() }
 
 def repeat(n: Int) { action: () {Control} => Unit } = each(0, n) { (n) {l} => action() {l} }
 
+// NOTE: This is emitted by the close hole code action: do not remove unless you also adjust the code action
+/// Scopes a local computation
+def locally[R] { p: => R } : R = p()
 
 // Splices
 // =======

package/libraries/common/exception.effekt

@@ -54,7 +54,7 @@ extern io def panic(msg: String): Nothing =
   js "(function() { throw ${msg} })()"
   chez "(raise ${msg})"
   llvm """
-    call void @c_io_println_String(%Pos ${msg})
+    call void @c_io_println(%Pos ${msg})
     call void @exit(i32 1)
     ret %Pos zeroinitializer ; Unit
   """

package/libraries/common/json.effekt

@@ -1,6 +1,5 @@
 module json
 
-import char
 import scanner
 import stream
 
@@ -390,4 +389,4 @@ namespace test {
       resume(println(e))
     }
   }
-}
+}

package/libraries/common/result.effekt

@@ -35,3 +35,9 @@ def toOption[A, E](r: Result[A, E]): Option[A] = r match {
   case Success(a) => Some(a)
   case Error(exc, msg) => None()
 }
+
+def isError[A, E](r: Result[A, E]): Bool =
+  if (r is Error(_, _)) true else false
+
+def isSuccess[A, E](r: Result[A, E]): Bool =
+  if (r is Success(_)) true else false

package/libraries/common/scanner.effekt

@@ -1,6 +1,5 @@
 module scanner
 
-import char
 import stream
 
 interface Scan[A] {
@@ -49,6 +48,15 @@ def readSome[A, B] { convert: A => Option[B] }: B / { Scan[A], stop } =
     do stop()
   }
 
+/// like `readSome`, but for functions `A => B / Exception[WrongFormat]` such as `char::digitValue`
+def tryRead[A, B] { convert: A => B / Exception[WrongFormat] }: B / { Scan[A], stop } = {
+  with on[WrongFormat].default { do stop() }
+
+  val t = convert(do peek())
+  do skip[A]()
+  return t
+}
+
 /// Reads until the predicate does not hold for the next token.
 /// Emits the tokens read.
 def readWhile[A] { predicate: A => Bool }: Unit / { Scan[A], emit[A] } =
@@ -78,7 +86,7 @@ def readString(string: String): Unit / { Scan[Char], stop } =
 
 /// Check that the next character is a digit in base 10, and if so read and return it.
 def readDigit(): Int / { Scan[Char], stop } =
-  readSome[Char, Int]{ char => digitValue(char) }
+  tryRead[Char, Int]{ char => digitValue(char) }
 
 /// Read a positive decimal number.
 def readDecimal(): Int / Scan[Char] = {
@@ -91,7 +99,7 @@ def readDecimal(): Int / Scan[Char] = {
 
 /// Check that the next character is a digit in base 16, and if so read and return it.
 def readHexDigit(): Int / { Scan[Char], stop } =
-  readSome[Char, Int]{ char => hexDigitValue(char) }
+  tryRead[Char, Int]{ char => hexDigitValue(char) }
 
 /// Read a hexadecimal number.
 def readHexadecimal(): Int / Scan[Char] = {

package/libraries/common/string.effekt

@@ -5,6 +5,7 @@ import option
 import list
 import exception
 import result
+import char
 
 // TODO
 // - [ ] handle unicode codepoints (that can span two indices) correctly
@@ -61,12 +62,22 @@ def endsWith(str: String, suffix: String): Bool =
 /// TODO use a more efficient way of appending strings like a buffer
 def repeat(str: String, n: Int): String = {
   def go(n: Int, result: String): String = {
-    if (n == 0) result
+    if (n <= 0) result
     else go(n - 1, result ++ str)
   }
   go(n, "")
 }
 
+/// Left-pad the given string with spaces
+def padLeft(str: String, n: Int): String = {
+  " ".repeat(n - str.length) ++ str
+}
+
+/// Right-pad the given string with spaces
+def padRight(str: String, n: Int): String = {
+  str ++ " ".repeat(n - str.length)
+}
+
 // TODO use .split() in JS
 def split(str: String, sep: String): List[String] = {
   val strLength = str.length
@@ -113,20 +124,18 @@ def toBool(s: String): Bool / Exception[WrongFormat] = s match {
 
 // TODO optimize (right now this will be horribly slow (compared to the native JS version)
 def toInt(str: String): Int / Exception[WrongFormat] = {
-
-  val zero = '0'.toInt
-
   def go(index: Int, acc: Int): Int = {
-    result[Char, OutOfBounds] { str.charAt(index) } match {
-      case Success(c) and c >= '0' and c <= '9' =>
-        go(index + 1, 10 * acc + (c.toInt - zero))
-      case Success(c) => wrongFormat("Not a valid number: '" ++ str ++ "'")
-      // wrong index means we are done parsing
-      case Error(_, _) => acc
-    }
+    // wrong index means we're done parsing
+    with on[OutOfBounds].default { () => acc };
+
+    val c = str.charAt(index)
+    val d = char::digitValue(c)
+    go(index + 1, 10 * acc + d)
   }
 
-  with default[OutOfBounds, Int] { wrongFormat("Empty string is not a valid number") };
+  with on[OutOfBounds].default {
+    wrongFormat("Empty string is not a valid number")
+  }
 
   str.charAt(0) match {
     case '-' => 0 - go(1, 0)
@@ -136,38 +145,22 @@ def toInt(str: String): Int / Exception[WrongFormat] = {
 
 // TODO optimize (right now this will be horribly slow (compared to the native JS version)
 def toInt(str: String, base: Int): Int / Exception[WrongFormat] = {
-
-  if( base > 36 || base < 1 ) {
+  if (base > 36 || base < 1) {
     wrongFormat("Invalid base: " ++ base.show)
   }
 
-  val zero = '0'.toInt
-  val l_a = 'a'.toInt
-  val u_a = 'A'.toInt
-
-  def parseDigit(c: Char): Option[Int] = {
-    if( c >= '0' and c <= '9' and c.toInt - zero < base ) {
-      Some(c.toInt - zero)
-    } else if( c >= 'a' and c <= 'z' and c.toInt - l_a < base - 10 ) {
-      Some(c.toInt - l_a + 10)
-    } else if( c >= 'A' and c <= 'Z' and c.toInt - u_a < base - 10) {
-      Some(c.toInt - u_a + 10)
-    } else {
-      None()
-    }
-  }
-
   def go(index: Int, acc: Int): Int = {
-    result[Char, OutOfBounds] { str.charAt(index) } match {
-      case Success(c) and parseDigit(c) is Some(d) =>
-        go(index + 1, base * acc + d)
-      case Success(c) => wrongFormat("Not a valid number: '" ++ str ++ "'")
-      // wrong index means we are done parsing
-      case Error(_, _) => acc
-    }
+    // wrong index means we're done parsing
+    with on[OutOfBounds].default { () => acc };
+
+    val c = str.charAt(index)
+    val d = char::digitValue(c, base)
+    go(index + 1, base * acc + d)
   }
 
-  with default[OutOfBounds, Int] { wrongFormat("Empty string is not a valid number") };
+  with on[OutOfBounds].default {
+    wrongFormat("Empty string is not a valid number")
+  }
 
   str.charAt(0) match {
     case '-' => 0 - go(1, 0)
@@ -222,104 +215,6 @@ def lastIndexOf(str: String, sub: String, from: Int): Option[Int] = {
 // extern pure def unsafeIndexOf(str: String, sub: String): Int =
 //   js "${str}.indexOf(${sub})"
 
-
-// Characters
-// ----------
-//
-//   JS: Int (Unicode codepoints)
-//   Chez: ?
-//   LLVM: i64 representing utf-8 (varying length 1-4 bytes)
-
-extern pure def toString(ch: Char): String =
-  js "String.fromCodePoint(${ch})"
-  chez "(string (integer->char ${ch}))"
-  llvm """
-    %z = call %Pos @c_bytearray_show_Char(%Int ${ch})
-    ret %Pos %z
-  """
-
-// Since we currently represent Char by integers in all backends, we could reuse comparison
-extern pure def toInt(ch: Char): Int =
-  js "${ch}"
-  chez "${ch}"
-  llvm "ret %Int ${ch}"
-  vm "string::toInt(Char)"
-
-extern pure def toChar(codepoint: Int): Char =
-  js "${codepoint}"
-  chez "${codepoint}"
-  llvm "ret %Int ${codepoint}"
-  vm "string::toChar(Int)"
-
-
-extern pure def infixLt(x: Char, y: Char): Bool =
-  js "(${x} < ${y})"
-  chez "(< ${x} ${y})"
-  llvm """
-    %z = icmp slt %Int ${x}, ${y}
-    %fat_z = zext i1 %z to i64
-    %adt_boolean = insertvalue %Pos zeroinitializer, i64 %fat_z, 0
-    ret %Pos %adt_boolean
-  """
-  vm "string::infixLt(Char, Char)"
-
-extern pure def infixLte(x: Char, y: Char): Bool =
-  js "(${x} <= ${y})"
-  chez "(<= ${x} ${y})"
-  llvm """
-    %z = icmp sle %Int ${x}, ${y}
-    %fat_z = zext i1 %z to i64
-    %adt_boolean = insertvalue %Pos zeroinitializer, i64 %fat_z, 0
-    ret %Pos %adt_boolean
-  """
-  vm "string::infixLte(Char, Char)"
-
-extern pure def infixGt(x: Char, y: Char): Bool =
-  js "(${x} > ${y})"
-  chez "(> ${x} ${y})"
-  llvm """
-    %z = icmp sgt %Int ${x}, ${y}
-    %fat_z = zext i1 %z to i64
-    %adt_boolean = insertvalue %Pos zeroinitializer, i64 %fat_z, 0
-    ret %Pos %adt_boolean
-  """
-  vm "string::infixGt(Char, Char)"
-
-extern pure def infixGte(x: Char, y: Char): Bool =
-  js "(${x} >= ${y})"
-  chez "(>= ${x} ${y})"
-  llvm """
-    %z = icmp sge %Int ${x}, ${y}
-    %fat_z = zext i1 %z to i64
-    %adt_boolean = insertvalue %Pos zeroinitializer, i64 %fat_z, 0
-    ret %Pos %adt_boolean
-  """
-  vm "string::infixGte(Char, Char)"
-
-
-/**
- * Determines the number of bytes needed by a codepoint
- *
- * Also see: https://en.wikipedia.org/wiki/UTF-8
- */
-def utf8ByteCount(codepoint: Char): Int = codepoint match {
-  case c and c >= \u0000  and c <= \u007F   => 1
-  case c and c >= \u0080  and c <= \u07FF   => 2
-  case c and c >= \u0800  and c <= \uFFFF   => 3
-  case c and c >= \u10000 and c <= \u10FFFF => 4
-  case c => panic("Not a valid code point")
-}
-
-def utf16UnitCount(codepoint: Char): Int = codepoint match {
-  case c and c >= \u0000  and c <= \uFFFF   => 1
-  case c and c >= \u10000 and c <= \u10FFFF => 4
-  case c => panic("Not a valid code point")
-}
-
-extern pure def charWidth(c: Char): Int =
-  // JavaScript strings are UTF-16 where every unicode character after 0xffff takes two units
-  js "(${c} > 0xffff) ? 2 : 1"
-
 def charAt(str: String, index: Int): Char / Exception[OutOfBounds] =
   if (index < 0 || index >= length(str))
     do raise(OutOfBounds(), "Index out of bounds: " ++ show(index) ++ " in string: '" ++ str ++ "'")

package/libraries/js/effekt_builtins.js

@@ -58,4 +58,4 @@ $effekt.unit = { __unit: true }
 
 $effekt.emptyMatch = function() { throw "empty match" }
 
-$effekt.hole = function() { throw "not implemented, yet" }
+$effekt.hole = function() { throw "not implemented, yet" }

package/libraries/llvm/bytearray.c

@@ -72,7 +72,7 @@ struct Pos c_bytearray_from_nullterminated_string(const char *data) {
 char* c_bytearray_into_nullterminated_string(const struct Pos arr) {
     uint64_t size = arr.tag;
 
-    char* result = (char*)malloc(size + 1);
+    char* result = malloc(size + 1);
 
     memcpy(result, c_bytearray_data(arr), size);
 

package/libraries/llvm/forward-declare-c.ll

@@ -3,10 +3,8 @@
 declare i64 @c_get_argc()
 declare %Pos @c_get_arg(i64)
 
-declare void @c_io_println_Boolean(%Pos)
-declare void @c_io_println_Int(%Int)
-declare void @c_io_println_Double(%Double)
-declare void @c_io_println_String(%Pos)
+declare void @c_io_println(%Pos)
+declare %Pos @c_io_readln()
 
 declare void @hole()
 declare void @duplicated_prompt()

package/libraries/llvm/io.c

@@ -4,28 +4,35 @@
 #include <uv.h>
 #include <string.h> // to compare flag names
 
-// Println
-// -------
+// Println and Readln
+// ------------------
 
-void c_io_println_Int(const Int n) {
-    printf("%" PRId64 "\n", n);
-}
-
-void c_io_println_Boolean(const struct Pos p) {
-    printf("%s\n", p.tag ? "true" : "false");
-}
-
-void c_io_println_Double(const Double x) {
-    printf("%g\n", x);
-}
-
-void c_io_println_String(String text) {
-    for (uint64_t j = 0; j < text.tag; ++j)
+void c_io_println(String text) {
+    for (uint64_t j = 0; j < text.tag; ++j) {
         putchar(c_bytearray_data(text)[j]);
+    };
     erasePositive(text);
     putchar('\n');
 }
 
+String c_io_readln() {
+    uint64_t capacity = 64;
+    uint64_t length = 0;
+    char* buffer = malloc(capacity * sizeof(char));
+
+    for (int c = getchar(); c != '\n' && c != EOF; c = getchar()) {
+        if (length >= capacity) {
+            capacity *= 2;
+            buffer = realloc(buffer, capacity * sizeof(char));
+        }
+        buffer[length] = (char)c;
+        length++;
+    }
+
+    String result = c_bytearray_construct(length, (const uint8_t*)buffer);
+    free(buffer);
+    return result;
+}
 
 // Lib UV Bindings
 // ---------------

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

@@ -1,5 +1,5 @@
 <!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.144.2"><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=1746987328"><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>
+<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.144.2"><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=1748196930"><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">
@@ -60,4 +60,4 @@ 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://eclipse.us6.list-manage.com/subscribe/post?u=eaf9e1f06f194eadc66788a85&amp;id=e7538485cd&amp;f_id=00f9c2e1f0" 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">
 <button class="footer-end-newsletter-submit btn btn-link" id=mc-embedded-subscribe type=submit name=subscribe>
-<i class="fa fa-solid fa-envelope fa-lg" aria-hidden=true></i></button></div></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=1746987328"></script><script>(function(){})(jQuery,document)</script></div></body></html>
+<i class="fa fa-solid fa-envelope fa-lg" aria-hidden=true></i></button></div></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=1748196930"></script><script>(function(){})(jQuery,document)</script></div></body></html>