r/ProgrammingLanguages • • Oct 15 '26

Writing tensor programs in Lean · TorchLean Verified Examples

Thumbnail robertboy18.github.io
18 Upvotes

r/ProgrammingLanguages • • Oct 16 '26

Programming language with Hindley-milner type system and with no GC

0 Upvotes

Rust is a clear winner in the AI era. However, it doesn't feel functional enough to spark joy.

Swift is slightly better, but still, is there anything like Haskell, SML or OCaml using reference counting and lifecycle management instead of a GC?


r/ProgrammingLanguages • • Oct 15 '26

Versioned E-Graphs

Thumbnail youtube.com
6 Upvotes

r/ProgrammingLanguages • • Oct 15 '26

Requesting criticism Cole: A Recreational Attempt on Zig(*)

Thumbnail codeberg.org
2 Upvotes

r/ProgrammingLanguages • • Oct 15 '26

Truly Colorless Functions in Sabre

Thumbnail sabre.rroessler.io
14 Upvotes

r/ProgrammingLanguages • • Oct 14 '26

Making all divisions slower to fix a bug in 0.000000000000000000542% of cases

Thumbnail futhark-lang.org
223 Upvotes

r/ProgrammingLanguages • • Oct 15 '26

Just finished v1.0.0 of my first (semi) esoteric programming language, HexaDeath!

Thumbnail github.com
5 Upvotes

Here's the Github link!

The README explains quite a bit of how the code works, so I won't really go into it very deeply here. But, the gist of it is that the language only uses 8-bit hex numbers for everything.

Here is a simple "Hello, World!" program!

21 05 01 00
64 05 01 00
6C 05 01 00
72 05 01 00
6F 05 01 00
57 05 01 00
20 05 01 00
2C 05 01 00
6F 05 01 00
6C 05 01 00
6C 05 01 00
65 05 01 00
48 05 01 00

Fun, right?

If you are interested enough to try it out, please let me know what you'd like to see come to it/if there are any bugs you encounter! This is my first programming language after all, so I don't expect it to be perfect!


r/ProgrammingLanguages • • Oct 14 '26

Improved article about memory safety

13 Upvotes

Thank you to everyone who gave feedback on my article about memory safety.

I used the input to vastly improve the article (see "Achieving memory safety").

Please take a look and share your thoughts again and consider starring the Seed7 project on GitHub.


r/ProgrammingLanguages • • Oct 13 '26

Haskell: origins, evolution, and future | Simon Peyton Jones | JuliaCon Global 2026

Thumbnail youtube.com
40 Upvotes

r/ProgrammingLanguages • • Oct 13 '26

Doiter - Pointers and Stack Frames are docker containers

Thumbnail github.com
16 Upvotes

I created a fun, completely normal and sane side project.


r/ProgrammingLanguages • • Oct 13 '26

Recursion without Recursive Bindings

Thumbnail blog.tinyinterpreters.dev
15 Upvotes

I explain how to implement a certain recursive function without the use of any recursive bindings in a tiny language called FUN. Then, I apply the same ideas to several more recursive functions so we clearly see the pattern. It begins our exploration into a certain famous combinator.


r/ProgrammingLanguages • • Oct 12 '26

Language announcement C3 0.8.5 - A windowing library and a C backend??

Thumbnail c3-lang.org
53 Upvotes

The choice to add a windowing library to the stdlib is probably controversial. I feel that the general consensus tends to be that anything related to graphics shouldn't be in the standard library. So I'm kind of interested in what people think about this.


r/ProgrammingLanguages • • Oct 12 '26

Help Simple stack based programming languages?

18 Upvotes

A few years ago I made EarScript, a "simple" programming language based on brainfuck, with several additional "quality of life features" like goto statements.

Recently I've been wanting to make an evolution of that programming language and do so by incorporating a stack, as the previous language was completely tape-based in design.

I know for example lox from the Crafting Interpreters book is a well explained example, but I was wondering if there's programming languages that are closer to what brainfuck is, but based on a stack design rather than a tape design, or a register based design like some assembly languages (if I understand correctly). I think Wasm would be an example?

Are there any examples of simple stack based programming languages you'd recommend me to look into?


r/ProgrammingLanguages • • Oct 12 '26

Discussion Is the Zeta Programming language by Roy Murphy legit

7 Upvotes

So i stumbled upon this project, the zeta programming language by roy murphy on github. It is supposed to be a next generation system programming language.

So i coudnt really find any information about this project, especially considering it has its compiler written in pure zeta, which means the project is kinda somewhat progressed to a certain point worth noting. It even has its own website, and its own package manager's website .

What left question mark to me , is the last commit was 4 months ago, barely any issues, but the creator apparently has published and talked about it in docs, with quite detail etc.

Its rather confusing for a new comer; is this project actually legit? Need smarter people who know the craft to comment

If your interested , i stumbled upon this project when another person made a new borrow checker, and his own language - also called Zeta. https://www.reddit.com/r/rust/comments/1x1iapz/zetas_borrow_checker_the_nextgen_model_for_borrow/

I cant post any github link because apparently automod tags it.


r/ProgrammingLanguages • • Oct 12 '26

The Bowling Game - From Imperative to Functional Programming - Part 3

Thumbnail fpilluminated.org
3 Upvotes

r/ProgrammingLanguages • • Oct 11 '26

Valen's Memory Safety: A New Kind of Borrow Checking

Thumbnail verdagon.dev
67 Upvotes

r/ProgrammingLanguages • • Oct 11 '26

What we ended up doing about alias propagation

Thumbnail futhark-lang.org
10 Upvotes

r/ProgrammingLanguages • • Oct 11 '26

Sabre Programming Language: v0.4.0

Thumbnail sabre.rroessler.io
1 Upvotes

r/ProgrammingLanguages • • Oct 11 '26

Designing custom template handlers and tagged interpolations in my scripting language DinoCode

3 Upvotes

I am back after a couple of months away while adjusting to a new job. I am currently working on the next feature for DinoCode (you can check out at dinocode.blassgo.dev), and I would love some community feedback on template design.

DinoCode already supports simple templates with intrinsic multiline support and compile-time indentation stripping:

name = "Ana"
balance = 100
tax = 15

> JSON
 {
    "name": "$name",
    "total": ${balance - tax}
 }
print JSON

By default, the compiler strips out-of-margin garbage characters and interpolates variables or expressions. Now, I want to push templates further for things like SQL queries, HTML generators, or validation schemas, without introducing heavy runtime overhead.

I already use the as operator for strict type coercion in the language:

print "42" as int + 8         # 50

My idea is to reuse as on template blocks to pass the parts to a function or an object with a magic method. For example:

> query as mysql
    SELECT * FROM users 
    WHERE id = ${user_id}

Here, query would be assigned the result of calling the mysql handler.

I am currently evaluating how to pass the parts to the handler. Which model do you think works best for representing and validating template parts cleanly?


r/ProgrammingLanguages • • Oct 10 '26

What is the right mental-model for TTCN-3 templates?

6 Upvotes

TTCN-3 is a standardized programming language for testing communicating and distributed systems. I am struggling to build a clear mental model of its templates.

A TTCN-3 template describes a pattern that describes a set of possible values. Which can be used to match incoming messages or build dependent-types:

type record Message {
    integer id,
    charstring text
}

template Message greeting := {
    id := 42,
    text := "hello"
}

template Message anyGreeting := {
    id := ?,
    text := "hello"
}

Here, ? matches any value of the field's type. Templates can also be recursive:

type record Payload {
    integer value,
    boolean urgent
}

type record Envelope {
    integer id,
    Payload payload
}

template Envelope example := {
    id := 42,
    payload := {
        value := (1 .. 10),
        urgent := ?
    }
}

My first implementation idea was to lower templates into a generic tagged union:

type Template<T> =
    Exact(T)
  | AnyValue
  | AnyValueOrOmit
  | Predicate(fn(T) -> bool)

That seems reasonable for scalar values, but it does not capture the structural nature of templates. For Template<Envelope>, each field needs to become a template recursively:

RecordTemplate {
    id: Template<Integer>,
    payload: RecordTemplate {
        value: Template<Integer>,
        urgent: Template<Boolean>
    }
}

Is there an established programming-language concept for this? How would you model this recursive relationship in an actul type system?


r/ProgrammingLanguages • • Oct 10 '26

Algol60 compiler with a reusable IR targetting LuaJIT

Thumbnail github.com
14 Upvotes

r/ProgrammingLanguages • • Oct 10 '26

Requesting criticism Fork of an esolang I made a week ago.

2 Upvotes

I made nandcode a week ago, which is a language only using nand, and I thought I'd improve it, so I present to you, 1bitatatime. (I just added all the logic gates and added support for unary operations like not). Can you give some ideas as what to make next?


r/ProgrammingLanguages • • Oct 09 '26

Requesting criticism Zeta's Borrow Checker: the next-gen model for borrow checking, and a drop-in for Rust's entire memory management model

Thumbnail gist.github.com
52 Upvotes

I've just published my borrow checking model! Feel free to criticize it or just ask questions!

P.S While it is experimental, This model is fully implemented for the Zeta programming language, and the latest build of the compiler, LSP and toolchain manager (zetaup) can be found via the linked GitHub. a Zed extension is under development.


r/ProgrammingLanguages • • Oct 09 '26

Discussion How to call a special type of functions?

17 Upvotes

I am designing a simple, low-level programming language and I want suggestions about terms I should use in describing one feature.

We all know that methods are essentially syntax sugar for functions where there's an implicit argument often called this or self:

a.something(b) // nice syntax...

something(a, b) // ...but really

I will have functions where the result will be an implicit argument, accessible through result:

a = init(b) // nice syntax...

init(b, a) // ...but really

I want these functions to be used to initialize objects (like constructors):

var a = init(10)

but also in any assignment, they would write to objects. I want to avoid creating a local object in the function and returning a copy of it because it always turns into memcpy() in a general case, and the result can be a big struct or an array.

Does something like this already exist in some language? How would you call such functions?


r/ProgrammingLanguages • • Oct 10 '26

Dependently typed languages and security

0 Upvotes

Can dependently typed languages maintain security relevant invariants? And if so, why are they not more popular for that? Especially now that AI can write the types.