301
Crossing the impossible FFI boundary, and my gradual descent into madness
Anyone trying to make a new mainstream language is completely insane, unless they're backed by a large corporation. 0
Top posts
Every blog post that took off on Hacker News, ranked by the votes of its best submission. 327 posts.
302
Cursed Linear Types in Rust
Inspired by Jack Wrenn’s post on Undroppable Types in Rust, I set out to see if it’s possible to create types that must be used exactly once. From my understanding, those things are called linear types, but don’t quote me on that1. Unless you are quoting the title of this article which explicitly says linear types… I…
303
Array Languages for Clojurians (2020)
appliedscience.studio ships with Moz DA 25 and 70 referring domains — a rare descriptive .studio pickup. Listed at $100.
304
PHP in 2024
A blog about modern PHP, the web, and programming in general. Follow my newsletter and YouTube channel as well.
305
Stem, a stack-based language with metaprogramming and a C FLI
My own concatenative programming language
306
Elixir Gotchas
No, I’ve not gone to the click-baiters (“10 tips that will change your life today!!!”), but I chose to limit myself to just 10 so that I don’t pull what is considered a R…
307
Compiling History: A brief tour of C compilers
As the story of C’s birth goes hand in hand with the creation of Unix, the first C compiler can be traced back to the early 1970’s.
308
Emit
One of the interesting aspects of a concatenative language like Factor is that blocks of logic can be easily extracted and easily reused since they apply logic to objects on the stack .
309
Ruby might be faster than you think
I saw a project a couple weeks back which allows writing and running Crystal methods inline inside a Ruby file. It’s a neat project, and I don’t want to take away from it but something in the README example looked off to me. require 'crystalruby' require 'benchmark' module Fibonnaci crystalize [n:
310
The theory of concatenative combinators (2007)
This article attempts to outline, in informal terms, a new theory of combinators, related to the theory of Combinatory Logic pioneered by Moses Schonfinkel, Haskell Curry, and others in the 1930s. Although not essential, an understanding of the classical theory of combinators may be helpful (see the links at the…
311
Basic MetaProgramming in Zig
Getting started with Zig's meta programming capabilities by leveraging a few useful functions
312
Move semantics in Rust, C++, and Hylo
I just finished reading the paper Borrow checking Hylo . It outlines the basic design of Hylo . Hylo is an early-stage programming language, but unlike other contenders of C++, it provides memory safety like rust. Specifically it merges rust’s borrow checking ideas into the framework of moveable value semantics (MVS)…
313
Types are a basic tool of software design (2018)
Static or dynamic, a program's design is written in its types.
314
Enum class improvements for C++17, C++20 and C++23
The evolution of the C++ language continues to bring powerful features that enhance code safety, readability, and maintainability. Among these improvements, we got changes and additions to enum class functionalities across C++17, C++20, and C++23. In this blog post, we’ll explore these advancements, focusing on…
315
Why Python's integer division floors (2010)
I was asked (again) today to explain why integer division in Python returns the floor of the result instead of truncating towards zero like...
316
Make invalid states unrepresentable (2023)
"Type-driven development"
317
White space does matter in C23
Usually in C identifiers are not directly followed by strings. But when U prefixed literals were introduced in C. there still were some rare clashes with existing code. This happened were a macro U…
318
Bringing Faster Exceptions to Rust
Three months ago, I wrote about why you might want to use panics for error handling. Even though it’s a catchy title, panics are hardly suited for this goal, even if you try to hack around with macros and libraries. The real star is the unwinding mechanism, which powers panics. This post is the first in a series…
319
Build systems a la carte: theory and practice (2020)
Andrey Mokhov, Neil Mitchell, Simon Peyton Jones Published in Journal of Functional Programming, Vol 30(E11) View PDF Download BibTex
320
Why is F# code robust and reliable?
F# is not just for math and big data, it's a general purpose language that will greatly reduce the amount of bugs in your code.
321
Quote-unquote "macros"
You’ve probably seen this Python 101 thing before: @memoized def fib(n): if n <= 1: return n return fib(n - 1) + fib(n - 2) Leaving aside the absurdity of computing Fibonacci numbers recursively, it’s a common first introduction to Python decorators and higher-order functions. fib is just a function, and memoized…
322
Maybe Functions
A coding anti-pattern that spreads it's tentacles across the codebase
323
Swift – A great language strangled by governance?
A great language strangled by governance
324
ElixirNitpicks
You are seeing this because the administrator of this website has set up Anubis to protect the server against the scourge of AI companies aggressively scraping websites . This can and does cause downtime for the websites, which makes their resources inaccessible for everyone.
325
Štar: an iteration construct for Common Lisp
Štar is a concise and extensible iteration construct for Common Lisp which aims to be pleasant to use, easy to understand, fast if needed, general, and not to look like Fortran....
326
Fighting spam with Haskell at Meta (2015)
Visit the post for more.
327
Scooping the Loop Snooper (2000)
No general procedure for bug checks will do. Now, I won’t just assert that, I’ll prove it to you. I will prove that although you might work till you drop, you cannot tell if computation will stop. For imagine we have a procedure called P that for specified input permits you to see whether specified source code, with…