to_do.md

References

0. Basic writing and formatting syntax
1. Autolinked references and URLs

Templates

0. (Commit)

Tasks

To Do

0. Allow producing JVM artifacts without source-tracking/debugging information.
1. The Design and Implementation of an Extensible System Meta-Programming Language
2. HasChor: Functional Choreographic Programming for All (Functional Pearl)
3. Compile not-like pattern-matching with ~ in languages/targets which support it, instead of compiling them as ifs.
4. How a durable workflow engine works: you might not need a queue
5. Dag-Calculus: A Calculus for Parallel Computation
6. Allow importing profiles into project.lux files in order to allow more re-use of configuration.
7. Rhombus: A New Spin on Macros Without All the Parentheses
8. CppCon 2015: Juan Pedro Bolívar Puente “Transducers: from Clojure to C++"
9. CppCon 2015: Jason Turner “The Current State of (free) Static Analysis"
10. CppCon 2015: Andrei Alexandrescu “Declarative Control Flow"
11. CppCon 2015: Neil MacIntosh “Evolving array_view and string_view for safe C++ code"
12. CppCon 2015: Greg Miller “Time Programming Fundamentals"
13. CppCon 2015: Joel Falcou PART 1 “Expression Templates - Past, Present, Future” 0. CppCon 2015: Joel Falcou PART 2 “Expression Templates: Past, Present, Future" 0. CppCon 2015: Joel Falcou PART 3 “Expression Templates: Past, Present, Future” 0. Expression templates
14. CppCon 2015: Kyle Markley "Extreme Type Safety with Opaque Typedefs"
15. CppCon 2015: Kostya Serebryany “Beyond Sanitizers...”
16. Superscopes: Local, global... is there any more? - Fabian Renn-Giles [ CppCon 2015 ]
17. CppCon 2015: André Bergner “Faster Complex Numbers”
18. CppCon 2016: John McFarlane “fixed_point"
19. CppCon 2016: Howard Hinnant “Welcome To The Time Zone"
20. CppCon 2017: Odin Holmes “Agent based class design”
21. CppCon 2017: John McFarlane “CNL: A Compositional Numeric Library”
22. CppCon 2017: Walter E. Brown “Programming with C++ Constraints: Background, Utility, and Gotchas"
23. CppCon 2018: “Multi-Precision Arithmetic for Cryptology in C++, at Run-Time and at Compile-Time”
24. Safe numerics.
    • CppCon 2018: Robert Ramey “Safe Numerics”
25. Replace recursive type calls from (0 "") to (0 0)
26. Extract the variable link-ring machinery being used by both the control/logic and meta/type/check modules into its own module.
27. Implement type-level naming (Ghosts of Dependent Proofs-style), in order to give unique names to classes, to force distinctions between them beyond their state types.
28. Notation for 2-adic numbers (as a sibling to Rev)
    • Mathematicians Use Numbers Differently From The Rest of Us
    • Fractions and p-adic numbers | Real numbers and limits Math Foundations 90 | N J Wildberger
29. Have alternative arithmetic operators for Fraction that do not normalize the result after the operation (+', -', *', /').
    • Normalization would obfuscate an interesting fact about working with infinity.
    • ^ Which is: (infinity + point) == (infinity / point) == (infinity * (/ point))
    • It may also obfusface the possibility that there are multiple infinities (and multiple zeroes) which may be equivalente to one another, but not necessarily equal.
    • Such inequality may prove useful in some calculations, but it would be erased during normalization (leading to ambiguities).
30. Have a special rules for Fraction/Rational multiplication that says:
    • a/b * b/c = a/c && a/b * c/a = c/b && a/b * c/d = ac/bd.
    • The above rule can make a/0 * 0/b = a/b and 0/a * b/0 = b/a, bypassing any possibility for 0/0.
    • It may also make the de-normalized zeroes and infinities carry useful information, instead of losing it through normalization.
31. Unify the handling of globals between extensions, analysis & declaration.
32. Replace the usages of single-use variables with the expressions they are bound to, in order to eliminate unnecessary register allocations.
33. Polytypic Binary format machinery.
34. Go from having I32 variant tags to I08 tags. 0. Make the JVM compiler use Bytes instead of Integers for storing variant/sum tags/lefts.
35. Implement extensible pattern-matching in the compiler, guided by the experiment in control/pattern.
36. Inject the type-names of the different primitive types in the prelude using analysis extensions.
37. Eta-conversion in the synthesis phase for inlining/code-fusion optimizations.
38. Add special origin/provenance parameter to Exceptions in order to track from which definition they came, in order to disambiguate between multiple possible origins.
39. Allow inline functions to be partially applied.
40. Pre-calculate the sizes of pattern-matching stacks and allocate arrays with those sizes, rather than using dynamically-sized stacks.
41. Fix {library/lux/data/format/tar.invalid_end_of_archive} error, which makes it impossible to use manually-packaged TAR files.
    • #71
42. Aggressively optimize the compiler.
43. Replace the usage of .tar files in the compiler with a new (more consistent) archiving format. Both for packaging libraries and making cache files.
    • https://en.wikipedia.org/wiki/List_of_archive_formats
44. Unary - and / for numbers that feature inverses.
45. multithreading: a tiny runtime that allows you to execute JavaScript functions on separate threads
46. Get rid of the .in_module# extension. It can be replaced by a macro that piggy-backs on the existing quoted_module mechanism.
47. An anonymous type for un-tagged sums. E.g. {3 #1 x} = (All (_ a b c d) (Or a b c (Or d (type_of x)))) && {3 #0 x} = (All (_ a b c d) (Or a b c (Or (type_of x) d)))
48. Unsafe text module.
49. Dissolve math/random into the rest of the standard library.
50. Dissolve injection/.../text into the rest of the standard library.

Done

0. (Commit) Optimize compilation of pattern-matching expressions like (when <input> <literal> <then> _ <else>) into if expressions that test the literal, instead of full-blown pattern-matching.
   • Add if_i64 & if_f64 & if_text synthesis Terms.
1. (Commit) Add <, <=, >, >= definitions to every module that has an Order.
2. (Commit) Re-name panic! to halt! in honor of the halting problem.
3. (Commit) Re-name I8 to I08
4. (Commit) N/D native parser syntax for Fraction numbers.
5. (Commit) (+|-)N/D native parser syntax for Rational numbers.
6. (Commit) The safe_decimal random generator should produce Decimals all over the range of safe values, instead of just the [0, 1] interval.
7. (Commit) Make the denominator in Rational a Natural number.
8. (Commit) Fix stack-overflow error during TAR compression when trying to deploy with Aedifex.
9. (Commit) When setting nested directories in Aedifex's "target", have the compiler create the nested directories.
10. (Commit) Fix Cannot find artifact data. bug in scripting compilers.
11. (Commit) Number alias in all the math/number modules.
12. (Commit) Compile or-like pattern-matching, and and-like pattern-matching with || and && in languages/targets which support it, instead of compiling them as ifs.

0.8.0

0. (Commit) Full names for number modules. nat => natural, dec => decimal, rat => rational, int => integer, rev => revolution, frac => fraction, char => character.
   • Also, big-name aliases for the types.
1. (Commit) Fix bug wherein two imported modules can have the same alias.
2. (Commit) Add a = definition to every module that has an Equivalence.
3. (Commit) Eliminated the bootstrapping compiler
4. (Commit) Better syntax for the .when# extension.
5. (Commit) Re-name the left and right macros in the prelude. Also, get rid of their highlighting in lux-mode.
6. (Commit) Make type-normalization no longer confuse local type parameters with globally-defined types/macros.
   • Remove instances of (.except left right).
7. (Commit) Favor partial calls over successive calls when compiling function application.
8. (Commit) Re-name Codec to Embedding. Alternatively, re-name to Format.
   • Embedding
   • Format
9. (Commit) Get rid of library/lux/world/db.
10. (Commit) Replace uses of All with for_all or for_any. Do the same for Ex.
11. (Commit) Get rid of licentia.
12. (Commit) Add extensions for pattern-matching and function definition, instead of having custom syntax for both.
13. (Commit) Re-name Format to Injection.
    • Injection
14. (Commit) Fix bug wherein private aliases in module A of public definitions in module B are seen in module C, if it imports A.
15. (Commit) Re-name Parser to Projection.
    • Projection
16. (Commit) Introduce an Int-based alternative to Frac(tion) called Rat(tional).
    • Rational number
17. (Commit) <- as reverse-order function syntax.
18. (Commit) Re-name Codec#encoded to injection, and Codec#decoded to projection.
19. (Commit) Move abstract/mix to algorithm/mix.
20. (Commit) Re-name Ratio to Frac(tion).
    • Fraction
21. (Commit) Re-name check.subsumes? to check.subsumed?.
22. (Commit) Get rid of Dec encoding/decoding default extensions.
23. (Commit) Re-name Frac(tion) to Dec(imal).
    • Decimal
24. (Commit) Implement polytypic counting/length via induction.
25. (Commit) Re-implement all the current polytypic code just using induction.
    • (Commit)
    • (Commit)
26. (Commit) Allow for an alternative syntax for anonymous Variant/Sum construction where just a statically-known bit and a term are provided.
    • e.g. {#0 left}, or {#1 right}. They are equivalent to similar terms with a 0 lefts term prepended.
27. (Commit) Aliases: Any => True/Verum && Nothing => False/Falsum