Tag
Programming Language Foundations in Agda (PLFA) 是一本使用证明助手 Agda 讲解编程语言理论的开源教材，涵盖逻辑基础、操作语义与指称语义，并列出了多门采用该书授课的高校课程。
Lambda MicroEgg is a tool implementing an e-graph with support for well-scoped alpha-aware binders and higher-order Miller patterns for program synthesis and rewriting.
This article provides an overview of intuitionistic type theory, a logical framework based on dependent types and lambda calculus, originating from Brouwer's intuitionism and Russell's type theory, with applications in proof assistants and constructive mathematics.
A blog post arguing that Principia Mathematica anticipated modern programming language concepts such as lambda calculus, types, and referential transparency.
An academic exploration of various encodings for ordinal numbers within lambda calculus, comparing Linear, Affine, and Non-Linear systems including Mackie and Parigot encodings.
This article presents a minimalist 7-line interpreter for a Turing-equivalent functional language based on lambda calculus, demonstrating the eval/apply design pattern.
The article presents an algorithmic reconstruction of normalisation by evaluation (NbE) for untyped lambda calculus, showing step-by-step optimizations that yield an asymptotically faster normaliser than standard NbE implementations.
Researchers release λ-RLM, an open-source typed λ-calculus runtime that replaces self-written recursive control code with pre-verified combinators, boosting long-context reasoning accuracy by up to 21.9% and winning 29/36 trials.