Shape-Constrained Array Programming with Size-Dependent Types
Explore a dependent type system for array-size consistency in functional programming, enabling compile-time shape enforcement and nontrivial transformations without added complexity.
Fast Deep Learning with Categories
Explore GPU-accelerated deep learning using Haskell, ConCat, and Accelerate for high-performance industrial applications.
The Best Multicore-Parallelization Refactoring You've Never Heard Of
Discover a powerful, lesser-known refactoring technique for optimizing multicore parallelization in software development.
A History of Subtyping
Explore the evolution and significance of subtyping in programming languages with Benjamin C. Pierce's comprehensive historical overview.
How to Thrive as a PhD Student in Programming Languages
Discover strategies for success and personal growth during your PL PhD journey, focusing on research, collaboration, and professional development.
FP² - Fully in-Place Functional Programming
Explore a novel approach to functional programming that enables efficient in-place updates without sacrificing purity. Learn about the FIP calculus and its implementation in the Koka language.
MacoCaml - Staging Composable and Compilable Macros
Explore MacoCaml, a novel approach to compile-time code generation in OCaml, combining macros with phase separation and quotation-based staging. Learn about its theoretical foundation and implementation.
Trustworthy Runtime Verification via Bisimulation - Experience Report
Explore trustworthy runtime verification using bisimulation in the Copilot framework. Learn how CopilotVerifier generates correctness proofs for compiled monitors, enhancing safety-critical system assurance.
LURK: Lambda, the Ultimate Recursive Knowledge - A LISP-Based Language for zk-SNARKs
Explore Lurk, a LISP-based language for zk-SNARKs, enabling Turing-complete zero-knowledge proofs. Learn about its design, theory, and innovative content addressing approach for efficient programming.
The Verse Calculus: A Core Calculus for Deterministic Functional Logic Programming
Explore the Verse calculus, a new core calculus for deterministic functional logic programming, featuring a small-step rewrite semantics for reasoning about programs similar to lambda calculus.
Dependently-Typed Programming with Logical Equality Reflection
Explore System DE, a calculus for dependently-typed programming with equality reflection. Learn about termination tracking, inductive proofs, and performance-safety trade-offs in functional languages.
Student Research Contest Talks - ICFP 2023
Explore cutting-edge research in functional programming through student presentations at ICFP'23, featuring innovative ideas and emerging talent in the field.
Graded Modal Dependent Type Theory with Universe and Erasure - Formalized
Explore a graded modal type theory with dependent types, erasure, and formalized meta-theoretic properties. Delve into its universe, extraction function, and soundness proofs for open programs.
More Fixpoints - Solving Recursive Problems in Haskell
Explore innovative solutions for recursive Haskell programming, overcoming limitations and enabling elegant, productive code using pure data structures with enhanced fixpoint capabilities.
Bit-Stealing Made Legal: Compilation for Custom Memory Representations of Algebraic Data Types
Explore a novel approach for specifying data layouts of rich data types, enabling better control over memory representation while maintaining high-level abstractions in programming languages.
Haskell for Choice-Based Learning in Machine Learning Programming
Explore language design for machine learning, focusing on choice-based learning. Combine algebraic effects, handlers, and selection monad to create powerful frameworks for decision-making models and optimization techniques.
Lightning Talks on Haskell Programming - Session II
Explore diverse Haskell topics through rapid-fire presentations, gaining insights into cutting-edge developments and innovative applications in functional programming.
Lightning Talks on Haskell Programming - Session I
Explore diverse Haskell topics through rapid-fire presentations at the Haskell Symposium, covering cutting-edge research and innovative applications in functional programming.
Layout Polymorphism: Using Static Computation for Efficient Polymorphism Over Variable Representations
Explore layout polymorphism in OCaml, enabling efficient unboxed types while preserving parametric polymorphism. Learn about type-system design and implementation challenges in managing specializations.
Resource Polymorphism: Integrating First-Class Resources into ML
Explore resource polymorphism in ML, integrating destructors and resource types for enhanced memory management and functional programming in systems and parallel contexts.
Immutable Arrays Help Mutating Arrays More Efficiently - ML'23 Lecture
Explore how immutable arrays enable compiler optimizations for efficient implementations, challenging intuitions about low-level control in array computations.