StrictYAML - HitchDev

Engineering High-Performance Parsers with Data-Oriented Design

Notes from building Yuku: the AST is flat arrays of u32 indices instead of a pointer tree, and memory layout, allocation, strings, unicode, and serialization all follow from that one decision.

Files As Metadata Format

File structures with simple contents can be used instead of YAML, TOML or JSON. More effectively!

Simply Typed Reverse-Mode Automatic Differentiation with Variants: Denotational Correctness via Idempotent Completion

Reverse-mode automatic differentiation can be derived denotationally as a structure-preserving interpretation of program syntax. In the usual simply typed model, each source type has one cotangent type. Variants break this representation because the valid cotangent space depends on the branch selected at run time; established correctness results therefore use primal-indexed families of cotangent spaces, whose direct internal language is dependent.

Tree Borrows | Proceedings of the ACM on Programming Languages

The Rust programming language is well known for its ownership-based type system, which offers strong guarantees like memory safety and data race freedom. However, Rust also provides unsafe escape hatches, for which safety is not guaranteed automatically ...

GitHub - tunjid/heron: A graceful multiplatform bluesky client

A graceful multiplatform bluesky client. Contribute to tunjid/heron development by creating an account on GitHub.

Warnings for pattern matching

We examine the ML pattern-matching anomalies of useless clauses and non-exhaustive matches. We state the definition of these anomalies, building upon pattern matching semantics, and propose a simple algorithm to detect them. We have integrated the algorithm in the Objective Caml compiler, but we show that the same algorithm is also usable in a non-strict language such as Haskell. Or-patterns are considered for both strict and non-strict languages.

Place Capability Graphs: A General-Purpose Model of Rust’s Ownership and Borrowing Guarantees

Rust’s novel type system has proved an attractive target for verification and program analysis tools, due to the rich guarantees it provides for controlling aliasing and mutability. However, fully understanding, extracting and exploiting these guarantees is subtle and challenging: existing models for Rust’s type checking either support a smaller idealised language disconnected from real-world Rust code, or come with severe limitations in terms of precise modelling of Rust borrows, composite types storing them, function signatures and loops.

EmDash

The Astro-native CMS. A modern successor to WordPress with type-safe content, plugin extensibility, and portable deployment.

Implementing a Hindley-Milner Type System (Part 1) | Blog

First part of a tutorial on implementing a Hindley-Milner type system for a simple, purely functional programming language in Haskell. We go over syntax representation, how the Hindley-Milner type system is defined, polymorphism vs. monomorphism, generalization, and instantiation.

fjall - Rust

Fjall is a log-structured embeddable key-value storage engine written in Rust. It features:

osprey/example_rules at atproto · haileyok/osprey

A high-performance safety rules engine for real-time event processing at scale - haileyok/osprey

Introduction - Tree-sitter

Tree-sitter is a parser generator tool and an incremental parsing library. It can build a concrete syntax tree for a source file and efficiently update the syntax tree as the source file is edited. Tree-sitter aims to be:

Harper | Privacy-First Offline Grammar Checker

Blazing-fast, open-source grammar & spell checking that never sends your words to the cloud.

Tree-sitter - a new parsing system for programming tools - Strange Loop

Strange Loop is a conference for software developers covering programming langs, databases, distributed systems, security, machine learning, creativity, and more!

Bab

Bab is a family of secure hash functions, heavily inspired by BLAKE3. Bab hashes allow for streaming verification of strings, similar to the BLAKE3-based Bao algorithm. We discuss several optimization techniques that go beyond the Bao specification. Further, unlike BLAKE3 and Bao, Bab digests allow for constant-sized length proofs of their strings.