Realizing Persistent Signals in JavaScript
Explore persistent signals implementation in JavaScript, enabling time-travel functionality and broader application in web development through relay-server architecture and DSL library approach.
Actix-Telepathy: Distributed Actor Programming in Rust
Explore Actix-Telepathy, an extension for Rust's Actix library enabling remote messaging and clustering support for distributed applications using the actor programming model.
Does Rust SPARK Joy? Safe Bindings from Rust to SPARK, Applied to the BBQueue Library
Explore safety guarantees in Rust-SPARK language bindings, focusing on the BBQueue circular buffer library. Learn about maintaining compile-time safety across language boundaries in embedded systems.
Centering Humans in the Programming Languages Classroom: Building a Text for the Next Generation
Explore principles for designing inclusive programming language textbooks, focusing on human-centered approaches and interdisciplinary applications in computer science education.
Ansible Is Turing Complete
Explore Ansible's unexpected Turing completeness through core language features. Discover how this configuration management tool achieves computational universality without relying on external languages or plugins.
CLOVER: Closed-Loop Verifiable Code Generation - Dafny'24
Explore CLOVER, a paradigm for ensuring correctness in AI-generated code through consistency checking among code, docstrings, and formal annotations using verification tools and language models.
Working with Peter O'Hearn in Academia and Industry
Explore Mark Harman's experiences collaborating with Peter O'Hearn across academic and industrial settings, gaining insights into their influential work.
Lean Formalization of Extended Regular Expression Matching with Lookarounds
Explore a formalized matching algorithm for extended regular expressions using Lean 4, covering intersection, complement, and lookarounds in symbolic derivatives and locations.
On the Need for Available, Functional, and Reusable Memory Models
Explore challenges in memory model research through personal failure stories, highlighting shortcomings and future expectations for the field.
Why Languages Should Preserve Load-Store Order
Explore the complexities of memory models and load-store reordering in programming languages, examining their impact on code optimization and reasoning.
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.
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.
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.
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.
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.
Toward a Live, Rich, Composable, and Collaborative Planetary Compute Engine
Explore Planet Hazel, a visionary programming environment for collaborative planetary computing to address climate crisis challenges across diverse stakeholders.
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.