aboutsummaryrefslogtreecommitdiff
path: root/readme.md
diff options
context:
space:
mode:
Diffstat (limited to 'readme.md')
-rw-r--r--readme.md7
1 files changed, 3 insertions, 4 deletions
diff --git a/readme.md b/readme.md
index fe9f111..514efde 100644
--- a/readme.md
+++ b/readme.md
@@ -12,13 +12,12 @@ benchmarking, or general term optimization.
- BLC (sharing by abstraction): Terms having BLoC entry indices get
abstracted and applied to the respective term. The indices get
converted to De Bruijn indices. The dependency graph is resolved by
- a topological sort so De Bruijn indices won't get unnecessarily
- large. Flag `bblc` (bits) and `blc` (ASCII 0/1).
+ a topological sort. Flag `bblc` (bits) and `blc` (ASCII 0/1).
- BLC (unshared): Every BLoC entry gets reinserted into the original
term. Do not use this if you want efficiency or small files. Flag
`unbblc` (bits) and `unblc` (ASCII 0/1).
-- [Effekt](https://effekt-lang.org): Because, why not? Flag `effekt`.
-- Planned: Scala, HVM, C, LLVM, JS, Haskell
+- Planned: [Effekt](https://effekt-lang.org), Scala, HVM, C, LLVM, JS,
+ Haskell
## Benchmarks