
Explore typed translations between direct and continuation-passing styles, examining their preservation of types and semantics, and their behavior in trivial and non-trivial control flow scenarios.

Explore ByzzFuzz, a randomized testing method for detecting errors in Byzantine fault-tolerant algorithms. Learn how it uncovers protocol and implementation bugs in blockchain systems through innovative message mutations.

Explore a new proof rule for verifying lower bounds on quantities of probabilistic programs, applicable to possibly divergent programs and non-trivial cases like three-dimensional random walks.

Explore implementing fluent APIs in functional languages using parametric polymorphism and Hindley-Milner type inference. Learn to enforce API protocols and DSL syntax at compile time without relying on name overloading.

Explore strategies for guiding migratory typing using profiling tools, focusing on deep types to eliminate costly boundaries between typed and untyped components in code refactoring.

Explore a novel approach to verifying privacy-preserving protocols, balancing precision and accessibility. Learn about indistinguishability proofs and their application to TLS and PIR protocols.

Explore automated synthesis of parametric gas upper-bounds for smart contracts using novel geometric approaches, enhancing blockchain security and efficiency.

Explore Melocoton, a groundbreaking program logic for verifying interactions between OCaml and C components through OCaml's foreign function interface, featuring a formal semantics and Coq mechanization.

Explore a novel methodology for sampling datasets to train neural network-based program surrogates, focusing on complexity-guided sampling for improved accuracy in real-world applications.

Explore reference immutability in hybrid languages, focusing on interactions with higher-order functions, polymorphism, and subtyping in System F-sub. Gain insights into taming mutation in modern programming paradigms.

Explore a gradual probabilistic lambda calculus combining static and dynamic typing for probabilistic programming, enhancing flexibility in machine learning and differential privacy applications.

Explore perception contracts for ML-enabled systems safety, focusing on error handling in ground-truth estimations and symbolic learning algorithms for vision-based control systems.

Explore run-time prevention of ML API integration failures. Learn about SmartGear, a tool detecting and converting mismatching outputs to prevent software incompatibilities.

Explore a novel deductive verification infrastructure for probabilistic programs, featuring an intermediate verification language and real-valued logic for quantitative property verification.

Explore formal verification of compiler optimizations using block simulations. Learn about enhancing CompCert with efficient, verified validators for advanced optimizations like LCM and SR.

Explore semantic regexes for advanced data extraction, combining syntactic and semantic reasoning. Learn about a novel algorithm synthesizing these regexes from minimal examples.

Explore array operation scheduling for optimized execution across hardware. Learn about static scheduling, type theory, and parallelization for GPUs and distributed computing.

Explore automated testing and continuous integration in APL development using free tools, from basic function testing to GitHub Actions for automatic test runs on commits.

Explore the latest developments in Co-dfns, a high-performance compiler for parallel dfns, and its impact on the computing landscape. Learn about its benefits and future prospects.

Explore asynchronous programming in Dyalog APL, focusing on futures, ⎕AWAIT, and practical demonstrations for web downloads, GUI applications, and algorithm optimization.

Explore asynchronous programming in Dyalog, including green threads, .NET tasks, and futures. Learn about unifying I-beam functions and see demonstrations using N-queens and wait functions.