Taype: A Policy-Agnostic Language for Oblivious Computation
Explore Taype, a novel language for secure multiparty computation that decouples security policies from program logic. Learn about oblivious algebraic data types and tape semantics for flexible, policy-agnostic development.
Associated Effects: Flexible Abstractions for Effectful Programming
Explore associated effects, a programming language feature enhancing type classes' flexibility in abstracting over function effects, improving expressive power in type and effect systems.
A HAT Trick: Automatically Verifying Representation Invariants Using Symbolic Finite Automata - PLDI 2024
Explore a novel approach using symbolic finite automata for verifying representation invariants in functional programs interacting with stateful libraries, enhancing data structure implementation efficiency.
Contextualized Programming Language Documentation - Enhancing Learning with Adaptive Explanations
Generate contextualized programming language documentation tailored to specific code, improving learning efficiency and understanding for developers working with new languages.
Semantic Encapsulation Using Linking Types
Explore semantic encapsulation with linking types to preserve language invariants when integrating foreign code, ensuring sound interoperability in multi-language systems.
A Type-Theoretic Account of Quantum Computation
Explore type-theoretic concepts for describing and proving properties of quantum computations, focusing on quantum circuits using Coq's dependent and polymorphic types.
Severing Ties: The Need for Non-Updateable Thunks
Explore non-updateable thunks in Haskell to prevent memory leaks and optimize garbage collection in streaming abstractions and control flow scenarios.
Embedding by Unembedding - Extending HOAS for Complex Semantic Domains
Explore a novel language development technique that extends HOAS, addressing limitations in semantic domains for open expressions, with applications in incremental computation and bidirectional languages.
Dependent Session Protocols in Separation Logic from First Principles - Functional Pearl
Explore dependent session protocols in concurrent separation logic, building from mutable references to channels. Simplify verification using basic mechanisms for one-shot protocols and extend to dependent session protocols.
Explicit Refinement Types - A Type Theory with Embedded Proofs
Explore λert, a type theory with explicit proof refinement types. Learn about its soundness, denotational semantics, and formalization in Lean 4.
Etna: An Evaluation Platform for Property-Based Testing - Experience Report
Explore Etna, a platform for evaluating property-based testing techniques. Compare popular frameworks in Coq and Haskell to understand best practices and tradeoffs in functional programming.
Higher-Order Property-Directed Reachability
Explore higher-order extension of PDR for automated verification of complex systems. Learn about HoPDR's formalization, implementation, and effectiveness in program safety verification.
Formal Specification and Testing for Reinforcement Learning
Explore formal specification and testing methods for reinforcement learning applications, focusing on temporal difference methods and property-based testing using functional programming techniques.
Efficient Loops in Arrowized Functional Reactive Programming - Haskell 2023
Explore efficient loop optimization in Arrowized Functional Reactive Programming, improving performance through novel program transformations while maintaining correctness in Haskell.
Effect Handlers for Programmable Inference - Haskell 2023
Explore effect handlers for modular inference programming in probabilistic algorithms, revealing high-level structures and enabling easy customization of Metropolis-Hastings and particle filtering methods.
Don't Go Down the Rabbit Hole: Reprioritizing Enumeration for Property-Based Testing
Explore an innovative approach to property-based testing, integrating LazySearch with NIST's ACTS for significantly faster and more effective testing in functional programming.
A Haskell Auto-Parallelizer for Distributed Computing
Explore a Haskell auto-parallelizer for distributed computing, leveraging function purity to create scalable and performant applications on large clusters.
An Exceptional Actor System in Haskell - Functional Pearl
Explore a hidden actor framework in GHC's runtime system, demonstrating its power through distributed systems examples and discussing implications for feature constraints.
Flambda 2 Types: An Abstract Domain for Static Analysis of Functional Programs
Explore Flambda 2 Types, an abstract domain for static analysis of OCaml programs, focusing on its role in optimizing functional code.
Exploring Perceus for OCaml - ML'23
Explore Perceus algorithm implementation in OCaml, comparing its performance with standard garbage collection. Learn about precise reference counting and its potential benefits.
Parallel Sequences in Multicore OCaml
Explore parallel sequences in Multicore OCaml 5.0.0, enabling efficient parallelization of large tasks without low-level implementation complexities.