Co-dfns Alternatives
Similar projects and alternatives to Co-dfns
-
-
-
Scout APM
Scout APM: A developer's best friend. Try free for 14-days. Scout APM uses tracing logic that ties bottlenecks to source code so you know the exact line of code causing performance issues and can get back to building a great product faster.
-
-
-
zig
General-purpose programming language and toolchain for maintaining robust, optimal, and reusable software.
-
cloc
cloc counts blank lines, comment lines, and physical lines of source code in many programming languages.
-
Nim
Nim is a statically typed compiled systems programming language. It combines successful concepts from mature languages like Python, Ada and Modula. Its design focuses on efficiency, expressiveness, and elegance (in that order of priority).
-
-
-
quickjs
Public repository of the QuickJS Javascript Engine. Pull requests are not accepted. Use the mailing list to submit patches.
-
-
-
-
-
-
tigerbeetle
A distributed financial accounting database designed for mission critical safety and performance to power the future of financial services.
-
medley
The main repo for the Medley Interlisp project. Other repositories are maiko (the VM implementation) and Interlisp.github.io (web site sources) (by Interlisp)
-
-
-
-
Reviews and mentions
- Array programming language(s) for 3d-graphics?
-
Is C the only right option for implementing an array language?
As an example, Aaron Hsu's Co-dfns APL compiler is written in Dyalog APL.
-
Let's build a simple interpreter for APL, part 2 (2020)
Does "make use of the speed of array-based language, but save computation time by compiling" refer to using an array language that is compiled? [Co-dfns](https://github.com/co-dfns/co-dfns) compiles a dialect of APL, so that might be interesting to you.
-
Zig 0.8.0 Release Notes
The changes to the IR data structures in this release are really neat- whole trees and graphs fit in a small fixed number of flat arrays. This saves on allocations, saves on total memory usage, and makes them trivial to serialize because there are no pointers.
I recently arrived at a similar design for manipulating NFAs as adjacency matrices, as a replacement for more pointer-y adjacency lists, by way of sparse matrix data structures. Rather than Zig's performance angle, I found that it made whole-graph operations much easier to implement and reuse.
I've also seen similar approaches from array languages like APL, for example this project for running this kind of stuff on GPUs: https://github.com/Co-dfns/Co-dfns
And, I've seen it in Rust as a "workaround" for the borrow checker, where that framing tends to make it feel like cheating or settling, which IMO is unfortunate since when people arrive at it for other reasons it seems to have a lot of other benefits!
There are probably more contexts I'm not familiar with- anyone have any good examples from domains they've worked in?
-
From Competitive Programming to APL
You might be interested in Aaron Hsu's work on co-dfns, which is a compiler that compiles a subset of Dyalog APL to the GPU.
-
A C compiler which can compile itself (in 2048 bytes)
It's funny to see the Perl comparison when APL-family languages normally have code that looks like that:
-
"Interlisp is a very large software system"
There's a guy who wrote a dyalog compiler for GPU stuff so you can just run your APL stuff on the GPU. He wrote the thing in dyalog, and the compiler is "just" a few files, no more than a page each.
Stats
Co-dfns/Co-dfns is an open source project licensed under GNU General Public License v3.0 or later which is an OSI approved license.
Popular Comparisons
Are you hiring? Post a new remote job listing for free.