GitHub - luc-tielen/eclair-lang: A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR

mthom/scryer-prolog

A modern Prolog implementation written mostly in Rust.

FlowLog - Efficient and Extensible Datalog | FlowLog

FlowLog: Efficient and Extensible Datalog via Incrementality

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.

bmillwood/bluesky-tools

Haskell library providing tools for working with the Bluesky social network / the AT protocol

The Topos of Programming | Yon

A topos-oriented programming language. Native via MLIR and LLVM, with a content-addressed heap on the Leech lattice.

Darcs | Proceedings of the 2005 ACM SIGPLAN workshop on Haskell

We at Binghamton intend, at least for ourselves (and I believe Alberta at least expressed this interest) to abstract whatever we have that we feel we would be proud enough to make available to other people in printed form. We would hope by somewhere in ...

Structured CoT: Shorter Reasoning with a Grammar File

Constrain only the think block with a tiny grammar. On Qwen3.6 coding evals, explicit reasoning gets 22x-43x shorter without losing pass@1 in these runs.

chad/whichlang

What programming language do LLMs default to when you don't tell them? A small benchmark.

Coeffects: a calculus of context-dependent computation

The notion of context in functional languages no longer refers just to variables in scope. Context can capture additional properties of variables (usage patterns in linear logics; caching requirements in dataflow languages) as well as additional resources or properties of the execution environment (rebindable resources; platform version in a cross-platform application). The recently introduced notion of coeffects captures the latter, whole-context properties, but it failed to capture fine-grained per-variable properties.We remedy this by developing a generalized coeffect system with annotations indexed by a coeffect shape. By instantiating a concrete shape, our system captures previously studied flat (whole-context) coeffects, but also structural (per-variable) coeffects, making coeffect analyses more useful. We show that the structural system enjoys desirable syntactic properties and we give a categorical semantics using extended notions of indexed comonad.The examples presented in this paper are based on analysis of established language features (liveness, linear logics, dataflow, dynamic scoping) and we argue that such context-aware properties will also be useful for future development of languages for increasingly heterogeneous and distributed platforms.

Datalog

Datalog is a declarative logic programming language. While it is syntactically a subset of Prolog, Datalog generally uses a bottom-up rather than top-down evaluation model. This difference yields significantly different behavior and properties from Prolog. It is often used as a query language for deductive databases. Datalog has been applied to problems in data integration, networking, program analysis, and more.

The mythical matched modules | Proceedings of the 24th ACM SIGPLAN conference companion on Object oriented programming systems languages and applications

Certified compilers are complex software systems. Like other large systems, they demand modular, extensible designs. While there has been progress in extensible metatheory mechanization, scaling extensibility and reuse to meet the demands of full ...

Integrating functional and imperative programming | Proceedings of the 1986 ACM conference on LISP and functional programming

We present a new model, based on monads, for performing input/output in a non-strict, purely functional language. It is composable, extensible, efficient, requires no extensions to the type system, and extends smoothly to incorporate mixed-language ...

I accidentally turned LLM memory into program analysis :: pwning.systems

Why I stopped trying to give LLM agents a better memory and instead built Lemmalog, a Datalog engine that maintains an agent's knowledge as analysis state, with provenance, retractions and incremental evaluation, plus what happened when I benchmarked it on LongMemEval and LoCoMo.