build site

uiua-lang · Mar 25, 2024 · 2f7d0c2 · 2f7d0c2
1 parent 0bbb764
commit 2f7d0c2
Show file tree

Hide file tree

Showing 44 changed files with 5,043 additions and 1 deletion.
diff --git a/.gitignore b/.gitignore
@@ -1,7 +1,6 @@
 .vscode
 .idea
 /target
-/docs
 site/dist
 /uiua-modules
 

diff --git a/Cargo.toml b/Cargo.toml
@@ -130,3 +130,6 @@ members = ["site", "tests_ffi"]
 
 [profile.dev]
 incremental = true
+
+[profile.release]
+opt-level = 's'
diff --git a/docs/404.html b/docs/404.html
@@ -0,0 +1,43 @@
+<!DOCTYPE html>
+<html>
+
+<head>
+  <meta charset="utf-8">
+  <title>Uiua</title>
+  <script type="text/javascript">
+    // Single Page Apps for GitHub Pages
+    // MIT License
+    // https://github.com/rafgraph/spa-github-pages
+    // This script takes the current url and converts the path and query
+    // string into just a query string, and then redirects the browser
+    // to the new url with only a query string and hash fragment,
+    // e.g. https://www.foo.tld/one/two?a=b&c=d#qwe, becomes
+    // https://www.foo.tld/?/one/two&a=b~and~c=d#qwe
+    // Note: this 404.html file must be at least 512 bytes for it to work
+    // with Internet Explorer (it is currently > 512 bytes)
+
+    // If you're creating a Project Pages site and NOT using a custom domain,
+    // then set pathSegmentsToKeep to 1 (enterprise users may need to set it to > 1).
+    // This way the code will only replace the route part of the path, and not
+    // the real directory in which the app resides, for example:
+    // https://username.github.io/repo-name/one/two?a=b&c=d#qwe becomes
+    // https://username.github.io/repo-name/?/one/two&a=b~and~c=d#qwe
+    // Otherwise, leave pathSegmentsToKeep as 0.
+    var pathSegmentsToKeep = 0;
+
+    var l = window.location;
+    l.replace(
+      l.protocol + '//' + l.hostname + (l.port ? ':' + l.port : '') +
+      l.pathname.split('/').slice(0, 1 + pathSegmentsToKeep).join('/') + '/?/' +
+      l.pathname.slice(1).split('/').slice(pathSegmentsToKeep).join('/').replace(/&/g, '~and~') +
+      (l.search ? '&' + l.search.slice(1).replace(/&/g, '~and~') : '') +
+      l.hash
+    );
+
+  </script>
+</head>
+
+<body>
+</body>
+
+</html>
diff --git a/docs/CNAME b/docs/CNAME
@@ -0,0 +1 @@
+www.uiua.org
diff --git a/docs/DejaVuSansMono.ttf b/docs/DejaVuSansMono.ttf
diff --git a/docs/Uiua386.ttf b/docs/Uiua386.ttf
diff --git a/docs/blog/list.txt b/docs/blog/list.txt
@@ -0,0 +1,2 @@
+second-class-functions: 2023-12-15 - Why doesn't Uiua have first-class functions?
+what-will-1-look-like: 2024-01-19 - What will Uiua 1.0 look like?
diff --git a/docs/blog/second-class-functions-text.md b/docs/blog/second-class-functions-text.md
@@ -0,0 +1,19 @@
+# Why doesn't Uiua have first-class functions?
+
+2023-12-15
+
+People often ask why Uiua doesn't have first-class functions. That is, functions that can be put on the stack and in arrays.
+
+In the beginning, functions *were* normal array elements. Modifiers popped their functions from the stack like regular values. Functions could be put in arrays, and lists of functions even had some special uses. There was a `! call` function which called the top function on the stack. Boxes were not even a dedicated type. They were just functions that took no arguments and returned a single value.
+
+However, as Uiua's development continued, the language began to rely more and more on stack signatures being well-defined. This property catches errors early, enables some optimizations, and allows modifiers to behave differently depending on their function's siganture. That last point lets us avoid having multiple modifiers that work the same way but on different numbers of arguments. For example, [Factor](https://factorcode.org/) has the words `bi`, `2bi`, `3bi`, `tri`, `2tri`, and `3tri`. Uiua can express all of these and more with just [fork]().
+
+Unfortunately, having first-class functions was at odds with this design. Because functions could be put into arrays and (conditionally) moved around on the stack, the compiler was not able to determine the signature of a function that called a function value. This meant that anywhere the `! call` function was used needed a signature annotation nearby, which you better hope was correct, or the code would break somewhere else. It also incurred additional interpreter overhead to get the functions from arrays and made certain types of optimizations impossible.
+
+Other than these design and implementation concerns, the ability to move functions around on the stack made code much harder to read when it was used. You had to keep in your mind not only the values, but the functions that worked on them as well. They were another value you had to deal with, and the related stack manipulation could get quite messy.
+
+And so I settled on a different approach. Functions were removed as an element type and were put elsewhere in the interpreter. Boxes became a type in their own right. The `! call` function was removed, and `!` was repurposed to be part of defining custom modifiers. [Custom modifiers](/docs/custommodifiers) capture the primary use case of first-class functions: injecting some variable code into a function. While they are technically more limited, their uniform structure makes them easier to both read and write. This change also massively simplified the interpreter, as well as the complexity of the language itself.
+
+Despite the downgrading of functions to second-class status, it should be noted that I do like functional programming languages. I just don't think that first-class functions are a good fit for Uiua. In practice, first-class functions are mostly unnecessary if you have higher-order functions, which array languages have had for decades. APL's operators, J's adverbs and conjunctions, and BQN and Uiua's modifiers are all versions of higher-order functions. They allow the mapping, reduction, and general transformation of data in the same way that first-class functions do in other languages.
+
+Now if only I could find a way to get rid of boxes...
diff --git a/docs/blog/what-will-1-look-like-text.md b/docs/blog/what-will-1-look-like-text.md
@@ -0,0 +1,35 @@
+# What will Uiua 1.0 look like?
+
+2024-01-19
+
+The [Uiua pad](https://uiua.org/pad) page prominently displays the words "Uiua is not yet stable". And so it has been asked: when will Uiua be stable? What features will it have? Is there a roadmap?
+
+This post is to organize and present my thoughts on the future of Uiua.
+
+## Stability
+
+Uiua will be made officially stable only after it has been unofficially stable for some time. That is, not until no breaking changes have been made for a long time.
+
+The following language features will need to be nailed down before Uiua can ever be stable.
+
+### Stack manipulation
+
+I think working with the stack, at least for up to 3 values, has become mostly pretty nice. However, things start to get complicated when working with more values, as is often necessary. There is some design work to be done here, and it's not out of the question that a very small amount of non-tacitness could be introduced to improve this.
+
+The experimental [`bind`](https://uiua.org/docs/bind) modifier is a potential solution to this problem.
+
+There is a balance to be struc between Uiua's goal of tacitness and its goal of being ergonomic. While the beauty of fully tacit code is a worthy goal, some problems involve data flows that are inherently complex, and so some kind of labeling system may be necessary to make such problems workable.
+
+### Box Ergonomics
+
+While I've explored alternatives, I've come to the conclusion that nested arrays are a necessary pest. The data we work with is often nested or ragged, and while there are ways to represent such data with flat structures, those representations are cumbersome in their own ways.
+
+And so boxes are likely here to stay. However, I do think some design work can be done to improve their ergonomics. Currently, Uiua's boxes are very similar to J's, but I think it may be worth it to make their usage a bit more implicit in some cases, closer to the nested arrays of APL or BQN.
+
+### System APIs
+
+The current [system functions](https://uiua.org/docs/system) are useful and *mostly* work. There are definitely implementation gaps which need to be filled. There are a good number of missing filesystem operations, and some other things like UDP sockets and proper interaction with child processes still need to be implemented.
+
+### FFI
+
+An FFI system similar to [BQN's](https://mlochbaum.github.io/BQN/spec/system.html#foreign-function-interface) is planned. This will allow Uiua to call into C libraries and will enable a lot more functionality.
diff --git a/docs/combinators/B.svg b/docs/combinators/B.svg
diff --git a/docs/combinators/B1.svg b/docs/combinators/B1.svg
diff --git a/docs/combinators/C.svg b/docs/combinators/C.svg
diff --git a/docs/combinators/D.svg b/docs/combinators/D.svg
diff --git a/docs/combinators/D2.svg b/docs/combinators/D2.svg
diff --git a/docs/combinators/E.svg b/docs/combinators/E.svg
diff --git a/docs/combinators/I.svg b/docs/combinators/I.svg
diff --git a/docs/combinators/K.svg b/docs/combinators/K.svg
diff --git a/docs/combinators/KI.svg b/docs/combinators/KI.svg
diff --git a/docs/combinators/N.svg b/docs/combinators/N.svg
diff --git a/docs/combinators/R.svg b/docs/combinators/R.svg
diff --git a/docs/combinators/S.svg b/docs/combinators/S.svg