Mutually Iso-Recursive Subtyping - OOPSLA 2023
Explore mutually iso-recursive subtyping, addressing challenges in type recursion for programming languages. Gain insights into efficient type checking and subtyping for intermediate code representations.
Type-Safe Dynamic Placement with First-Class Placed Values
Explore type-safe dynamic placement in distributed systems using first-class placed values. Learn about Dyno, a language enabling static reasoning with dynamic placement flexibility.
Validating IoT Devices with Rate-Based Session Types
Explore a novel framework for implementing and validating rate-based message passing systems in IoT domains using session types, ensuring rate error freedom and type preservation.
Resource-Aware Soundness for Big-Step Semantics
Explore resource-aware extensions to lambda calculus semantics and type systems, ensuring well-typed programs avoid resource exhaustion through coinductive reasoning and big-step formalization.
Combining Dependency, Grades, and Adjoint Logic in Type Systems
Explore new dependent type systems combining graded/linear types with modal operators and Adjoint Logic. Delve into meta-theoretic properties and graded substitution in advanced type theory.
A Dependently Typed Language with Dynamic Equality
Explore a novel dependently typed language with dynamic equality, addressing usability issues in type systems and providing clearer error messages through runtime equality checking.
Introducing BRAT: A Functional Programming Language for Quantum-Classical Hybrid Programs
Explore BRAT, a functional language for quantum-classical hybrid programming, featuring unique syntax and type-level parameters for enhanced safety and composition.
Circuit Width Estimation via Effect Typing and Linear Dependency
Explore circuit width estimation in quantum programming using effect typing and linear dependency. Gain insights into Proto-Quipper-R's type system for resource analysis of quantum algorithms.
Internalizing Indistinguishability with Dependent Types
Explore a novel type system combining dependency tracking and dependent types, internalizing indistinguishability for enhanced information flow control and program equivalence reasoning.
Mechanizing Refinement Types
Explore the mechanization of refinement types, combining semantic subtyping and parametric polymorphism. Learn about λRF calculus, data propositions, and metatheory proofs in LiquidHaskell and Coq.
Pipelines and Beyond: Graph Types for ADTs with Futures
Explore a novel graph type system enabling arbitrary combinations of futures and recursive data types in parallel programming, enhancing pipelining and performance optimization techniques.
Vehicle - A Specification Language for Neural Network Properties
Explore Vehicle, a functional DSL for specifying neural network properties. Learn to express, compile, and verify specifications across platforms, enhancing safety in ML-enhanced systems.
Homotopy Type Theory for Sewn Quilts
Explore PieceWork, an innovative programming language for quilt design inspired by Homotopy Type Theory. Learn how computational methods can enhance diversity in sewn designs and bridge programming theory with quilting craft.
Weighted Refinement Types for Counterpoint Composition
Explore weighted refinement types for music composition, blending programming concepts with music theory to create flexible counterpoint systems.
Generating Well-Typed Terms That Are Not "Useless"
Explore a novel algorithm for generating well-typed lambda terms that use their arguments effectively, improving random testing of functional language compilers.
Polymorphic Reachability Types: Tracking Freshness, Aliasing, and Separation in Higher-Order Generic Programs
Explore polymorphic reachability types for tracking freshness, aliasing, and separation in higher-order generic programs. Gain insights into advanced type systems and their applications in programming languages.
Polyregular Functions on Unordered Trees of Bounded Height
Explore polyregular functions on unordered trees with bounded height, examining first-order interpretations, decidability of equivalence problems, and applications to graph classes with bounded tree-depth.
Type-Based Gradual Typing Performance Optimization
Explore discriminative typing for optimizing gradual typing performance. Learn about its implementation in Reticulated Python and Grift, and discover significant speedups across various programs.
On the Generality and Convenience of Etypes
Explores Etypes in the Ethos OS, discussing its generality through grammar conversion and convenience for programmers, with a focus on distributed mandatory type systems and robust program development.
Verifying and Synthesizing Constant-Resource Implementations with Types
Explores a type system for verifying constant-resource implementations, enhancing security against side-channel attacks while allowing natural programming models. Introduces resource-aware noninterference and automated repair techniques.
Type-Checking CRDT Convergence
Explore Propel, a language with a type system for verifying algebraic properties in CRDT implementations. Learn about its case analysis and induction approach for ensuring correctness.