Co-dfns VS tigerbeetle

Compare Co-dfns vs tigerbeetle and see what are their differences.

Co-dfns

High-performance, Reliable, and Parallel APL (by Co-dfns)

tigerbeetle

The distributed financial transactions database designed for mission critical safety and performance. (by tigerbeetle)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
Co-dfns tigerbeetle
19 44
639 6,534
2.2% 45.5%
9.6 9.9
about 13 hours ago 6 days ago
APL Zig
GNU Affero General Public License v3.0 Apache License 2.0
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

Co-dfns

Posts with mentions or reviews of Co-dfns. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2024-02-24.
  • Tacit Programming
    3 projects | news.ycombinator.com | 24 Feb 2024
    And if anyone wants an absolute masterclass in tacit programming, have a look at Aaron's Co-dfns compiler. The README has extensive reference material. https://github.com/Co-dfns/Co-dfns/
  • YAML Parser for Dyalog APL
    4 projects | news.ycombinator.com | 8 Jan 2024
    I don't put a lot of stock in the "write-only" accusation. I think it's mostly used by those who don't know APL because, first, it's clever, and second, they can't read the code. However, if I remember I implemented something in J 10 years ago, I will definitely dig out the code because that's the fastest way by far for me to remember how it works.

    This project specifically looks to be done in a flat array style similar to Co-dfns[0]. It's not a very common way to use APL. However, I've maintained an array-based compiler [1] for several years, and don't find that reading is a particular difficulty. Debugging is significantly easier than a scalar compiler, because the computation works on arrays drawn from the entire source code, and it's easy to inspect these and figure out what doesn't match expectations. I wrote most of [2] using a more traditional compiler architecture and it's easier to write and extend but feels about the same for reading and small tweaks. See also my review [3] of the denser compiler and precursor Co-dfns.

    As for being read by others, short snippets are definitely fine. Taking some from the last week or so in the APL Farm, {⍵÷⍨+/|-/¯9 ¯11+.○?2⍵2⍴0} and {(⍸⍣¯1+\⎕IO,⍺)⊂[⎕IO]⍵} seemed to be easily understood. Forum links at [4]; the APL Orchard is viewable without signup and tends to have a lot of code discussion. There are APL codebases with many programmers, but they tend to be very verbose with long names. Something like the YAML parser here with no comments and single-letter names would be hard to get into. I can recognize, say, that c⌿¨⍨←(∨⍀∧∨⍀U⊖)∘(~⊢∊LF⍪WS⍨)¨c trims leading and trailing whitespace from each string in a few seconds, but in other places there are a lot of magic numbers so I get the "what" but not the "why". Eh, as I look over it things are starting to make sense, could probably get through this in an hour or so. But a lot of APLers don't have experience with the patterns used here.

    [0] https://github.com/Co-dfns/Co-dfns

    [1] https://github.com/mlochbaum/BQN/blob/master/src/c.bqn

    [2] https://github.com/mlochbaum/Singeli/blob/master/singeli.bqn

    [3] https://mlochbaum.github.io/BQN/implementation/codfns.html

    [4] https://aplwiki.com/wiki/Chat_rooms_and_forums

  • HVM updates: simplifications, finally runs on GPUs, 80x speedup on RTX 4090
    2 projects | news.ycombinator.com | 7 Oct 2023
    This always seemed like a very interesting project; we need to get to the point where, if things can run in parallel, they must run in parallel to make software more efficient on modern cpu/gpu.

    It won't attract funds, I guess, but it would be far more trivial to make this work with an APL or a Lisp/Scheme. There already is great research for APL[0] and looking at the syntax of HVM-core it seems it is rather easy to knock up a CL DSL. If only there were more hours in a day.

    [0] https://github.com/Co-dfns/Co-dfns

  • APL: An Array Oriented Programming Language (2018)
    10 projects | news.ycombinator.com | 30 Mar 2023
    There are many styles of APL, not just due to its long history, but also because APL is somewhat agnostic to architecture paradigms. You can see heavily imperative code with explicit branching all over the place, strongly functional-style with lots of small functions, even object-oriented style.

    However, given the aesthetic that you express, I think you might like https://github.com/Co-dfns/Co-dfns/. This is hands-down my favorite kind of APL, in which the data flow literally follows the linear code flow.

  • Franz Inc. has moved the whole Allegro CL IDE to a browser-based user interface. Incl. all their Lisp development tools. One can check that out with their Allegro CL Express Edition.
    2 projects | /r/Common_Lisp | 27 Mar 2023
    Which is, as far as I know, unused. (Similarly the gpu compiler.)
  • What would make you try a new language?
    8 projects | /r/ProgrammingLanguages | 29 Jan 2023
    You might be familiar with iKe (grahics), SpecialK (GLSL) and Co-dfns. Also, I am working on bastardized APL for GPU – Fluent. Fluent 1 had backend implemented through Apple Metal Performance Shaders Graph and Fluent 2 has TensorFlowJS backend for now. I care more about having auto differentiation in the lang than running on GPU and do graphics, to be honest.
  • Who is researching array languages these days?
    5 projects | /r/Compilers | 15 Oct 2022
    Aaron hsu did his dissertation on this topic (compiler, thesis), at indiana university in the us.
  • Researchers Develop Transistor-Free Compute-in-Memory Architecture
    2 projects | news.ycombinator.com | 14 Oct 2022
  • Why APL is a language worth knowing
    3 projects | news.ycombinator.com | 31 Mar 2022
    Stories please! What did the closures do to you?

    Hopefully this won't be seen as too combative, but I feel like there are a few people in the array community giving me some pretty strong conclusions that they don't really have the experience to back up (Aaron wrote[0] 17 lines of array compiler, and says the low-abstraction approach he used is the only way to develop sustainably. Cool. I wrote[1] 350 lines of array compiler following his style, and I disagree[2]). At the same time, my experience only goes so far (there's no way I would have invented the array style compiler!), and clearly you arrived at these conclusions somehow. So is there a chance you'd share the observations that led you that way?

    On my end, I was actually introduced to a little object-oriented programming in J when Henry suggested using it for a simulation project. I used it, but I don't think I really got it—just a weird way to organize data. And then in college I had to learn objects-only Java. Not good. But later I worked some with Node.js, and its module system was pretty nice: no name conflicts, easy to share code! Some way into BQN development, I figured out (with some help from a Common Lisp programmer) a way to add modules with an APL-y syntax, and something magic happened. I got objects[3] too! I think I've done about as much OOP in BQN as anywhere else, and I feel like I understand it a lot better now.

    So, this is my experience with Lisp-family features and APL. Fits like a glove, programming is easier and more fun. I mix and match array, functional, and object-oriented styles however I want. Did I lose coherence? When I translate my old J code it comes out shorter and cleaner and without exec (".) everywhere. But I still don't get why I should want the language I use to not support mutability rather than just default to immutability. Did I fail to understand something in J when I had the chance?

    [0] https://github.com/Co-dfns/Co-dfns

    [1] https://github.com/mlochbaum/BQN/blob/master/src/c.bqn

    [2] https://mlochbaum.github.io/BQN/implementation/codfns.html

    [3] https://mlochbaum.github.io/BQN/doc/oop.html

  • Barriers to APL Adoption
    4 projects | /r/apljk | 21 Jan 2022
    Co-dfns feels like an academic project that I won't be able to figure out how to use.

tigerbeetle

Posts with mentions or reviews of tigerbeetle. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2023-11-10.

What are some alternatives?

When comparing Co-dfns and tigerbeetle you can also consider the following projects:

BQN - An APL-like programming language. Self-hosted!

chibicc - A small C compiler

tigerbeetle - A distributed financial accounting database designed for mission critical safety and performance. [Moved to: https://github.com/tigerbeetledb/tigerbeetle]

ngn-apl - An APL interpreter written in JavaScript. Runs in a browser or NodeJS.

uemacs - Random version of microemacs with my private modificatons

april - The APL programming language (a subset thereof) compiling to Common Lisp.

medley - The main repo for the Medley Interlisp project. Wiki, Issues are here. Other repositories include maiko (the VM implementation) and Interlisp.github.io (web site sources)

maiko - Medley Interlisp virtual machine

zig - General-purpose programming language and toolchain for maintaining robust, optimal, and reusable software.

dex-lang - Research language for array processing in the Haskell/ML family

LevelDB - LevelDB is a fast key-value storage library written at Google that provides an ordered mapping from string keys to string values.

reshade - A generic post-processing injector for games and video software.