What We Learned from C++ Atomics and Memory Model Standardization
Explore insights from C++ atomics and memory model standardization, covering usage patterns, performance implications, implementation challenges, and lessons learned in language design.
Reasoning via Semantic Transformations
Explore semantic transformations in reasoning processes, examining their role and impact on logical analysis and problem-solving techniques.
Efficient Matching of Regular Expressions with Lookaround Assertions
Explore efficient matching of regular expressions with lookaround assertions, including formal semantics, simplification properties, and a new O(m·n) algorithm using oracle-NFAs for improved performance.
Polymorphic Type Inference for Dynamic Languages
Explore a novel type system combining polymorphism, intersection types, and subtyping for dynamic languages. Learn about type reconstruction algorithms and their applications in advanced programming.
When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism
Explore a novel type inference approach for first-class polymorphism using multi-bounded polymorphism, advancing the state of the art in type inference for programming languages.
Monotonicity and the Precision of Program Analysis
Explore the connection between program monotonicity and analysis precision. Learn how monotone behavior enables complete abstract interpretation for numeric invariant inference.
Capturing Types: A Calculus for Tracking Free Variables in Type Systems
Explore a calculus representing captured variables in types for enhanced safety, enabling effect implementation via scoped capabilities and guiding practical capture checking in programming languages.
Modular Denotational Semantics for Effects with Guarded Interaction Trees
Explore guarded interaction trees for representing higher-order computations with effects in Coq. Learn about modular reasoning and cross-language interactions in higher-order languages.
Coarser Equivalences for Causal Concurrency
Explore relaxations of trace equivalence in concurrent programs, focusing on grain equivalence for efficient causal concurrency analysis while maintaining algorithmic advantages.
Implementation and Synthesis of Math Library Functions
Explore MegaLibm, a domain-specific language for implementing, testing, and tuning math library functions. Learn how it enhances safety, modularity, and tunability in mathematical software development.
Automatic Parallelism Management - POPL 2024
Explore techniques for automatic parallelism management in high-level languages, combining static and runtime approaches to optimize performance without manual tuning.
Binding Syntax for Dependently-Typed Programs - WITS'24
Explore innovative binding syntax for dependently-typed programs, enhancing ergonomics while maintaining fixed grammar for improved error messaging.
Efficient Evaluation with Controlled Definition Unfolding - WITS'24
Explore efficient evaluation techniques in polymorphic and dependently typed languages, focusing on controlled definition unfolding for improved user interaction and unification processes.
Productivity Verification for Functional Programs by Reduction to Termination Verification
Explore a novel method for verifying productivity in functional programs, transforming co-inductive data structures into functions and reducing productivity verification to termination verification.
Incremental Computation: What Is the Essence? - Lecture 24
Explore incremental computation's essence through incrementalization, a systematic method for efficient algorithm and program design. Gain insights into high-level abstractions for developing optimized solutions.
Incremental Verification of Neural Networks
Explore a novel framework for efficient, incremental, and complete verification of updated deep neural networks, improving scalability and speed in determining trustworthy properties.
Architecture-Preserving Provable Repair of Deep Neural Networks
Explore architecture-preserving V-polytope provable repair of deep neural networks. Learn about a novel approach that guarantees specification satisfaction while preserving DNN architecture, supporting various layers and activation functions.
Conflict-Driven Synthesis for Layout Engines
Explore Medea, a framework for automatically generating efficient and correct incremental layout engines, addressing challenges in web browser development and improving performance.
Probabilistic Programming with Stochastic Probabilities
Explore a novel approach to probabilistic programming languages using stochastic probability estimation, enabling unrestricted stochastic control flow and programmable inference with custom proposals.
Proving and Disproving Equivalence of Functional Programming Assignments
Explore an automated approach for verifying programming assignments using equivalence checking, functional induction, and clustering algorithms. Learn how to prove correctness and provide counterexamples efficiently.
Parameterized Algebraic Protocols
Explore parameterized algebraic protocols for defining protocol templates and session types, enhancing expressiveness and modularity while enabling efficient type checking in linear time.