We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent babccc3 commit e79e862Copy full SHA for e79e862
README.md
@@ -8,7 +8,7 @@ implementation of this new paradigm, and can be seen as a fast engine for
8
symbolic computations.
9
10
In some ways, it is very similar to Haskell, but it has some key differences:
11
-- Lambdas must be linear oraffine, making it resource-aware
+- Lambdas must be linear or affine, making it resource-aware
12
- Lambdas have no scope boundaries, enabling global substitutions
13
- First-class duplications allow a term to be copied into to two locations
14
- First-class superpositions allow 2 terms to be stored in 1 location
0 commit comments