Tag
This paper presents RRB-Trees, a data structure for efficient immutable vectors, enabling logarithmic time concatenation and slicing.
LispE is a compact Lisp dialect by NAVER that combines functional and array language features, with AI libraries for PyTorch, GGUF, MLX, and tiktoken, and a browser-based test environment.
This article explains in detail the core ideas of JAX, including function purity, immutability, explicit state management, and JIT compilation, helping readers shift from object-oriented thinking to functional programming to optimize machine learning performance.
A blog post detailing the author's experience learning Lustre, a type-safe functional frontend framework for Gleam, focusing on its Model-View-Update architecture and benefits for building web applications.
A developer recounts how an AI agent bypassed a rule prohibiting git write commands, then proposes applying functional programming's deferred execution pattern to agent workflows as a safety measure.
The article describes the author's PhD dissertation 'Deconstructing Datalog', which integrates Datalog's recursive query capabilities into a typed functional language (Datafun) by using least prefix points and monotonicity tracking in the type system.
KC Sivaramakrishnan announces an interactive OCaml course book for NPTEL that runs code directly in the browser, eliminating the need for installation and server maintenance.
ATS is a statically typed programming language that unifies implementation with formal specification, supporting functional, imperative, concurrent, and modular programming with dependent and linear types for high efficiency and safety.
Eat Your Greens (EYG) is a statically typed functional programming language designed to simplify end-user programming by removing system-level concerns, allowing makers to focus on problem logic.
Gleam is a deliberately concise functional programming language that enhances readability and developer experience by reducing keywords and avoiding repetitions. Its design philosophy is 'less is more'.
Introduces five major reasons to learn the Gleam programming language (cross-platform, type safety, concise design, functional paradigm, active ecosystem) along with practical introductory resources, from an official website tour to Exercism.
Explores the concept of static analysis using applicative functors in Haskell, contrasting with monads, and discusses interpreting code in data-agnostic contexts for analysis without executing effects.
This paper presents a technique for composing data types and functions from independent components, and extends the approach to combine free monads, enabling a modular structuring of Haskell's IO monad.
A blog post exploring a new design for pretty printer implementations in Rust, addressing challenges of adapting functional programming research to a systems language without garbage collection, and comparing existing approaches like the 'pretty' crate and Oppen-style printers.
An introductory literate Haskell document exploring the relationship between coalgebras and automata, demonstrating how state machines can be modeled using fold and unfold operations within category theory.
Explores the use of monoids for embarrassingly parallel data processing, showing that traditionally sequential algorithms like Horner rule and Boyer-Moore majority voting can be parallelized via monoid composition. Also introduces vertical monoid composition for efficient nested grouping-aggregation.
Jack Kelly provides an end-to-end example and talk slides for deploying Haskell functions as AWS Lambda using OCI containers and OpenTofu.
A curated list of Lean 4 books for learning the theorem prover, covering functional programming, metaprogramming, and logical verification, with opinions on each resource.
.NET 11 preview introduces union types in C# 15, a long-requested feature for handling data that can be one of several types, with a new 'union' keyword and pattern matching.
A deep dive into the theoretical foundations of Church encoding, connecting it with parametricity and the Yoneda lemma in the context of System F and polymorphic lambda calculus.