Granite: Compositional Functional Logic Programming
Explore Granite, a new programming language enhancing functional programming with parallelism, expressiveness, and compositionality through first-class semilattice structures.
Operational Game Semantics for Generative Algebraic Effects and Handlers
Explore operational game semantics for generative algebraic effects and handlers in a typed call-by-value λ-calculus with dynamic allocation of effect instances.
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.
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.
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.
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.
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.
Stretching the Glasgow Haskell Compiler: Nourishing GHC with Domain-Driven Design
Explore Domain-Driven Design principles for enhancing Glasgow Haskell Compiler's architecture, addressing immutability, modularity, and composability in large-scale functional systems.
Typed Design Patterns for the Functional Era - FUNARCH'23
Explore functional design patterns in modern programming, focusing on architectural concepts and their implementation in Rust's type system.
A Type System for Elixir
Explore progress in adding static and gradual typing to Elixir, including set-theoretic types, bug detection, and mixing typed/untyped code. Learn about potential benefits and future challenges.