Pages that link to "Item:Q2819782"
From MaRDI portal
The following pages link to Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Q2819782):
Displayed 49 items.
- Functors are Type Refinement Systems (Q2819783) (← links)
- Integrating Linear and Dependent Types (Q2819785) (← links)
- Higher Inductive Types as Homotopy-Initial Algebras (Q2819787) (← links)
- Runtime Enforcement of Security Policies on Black Box Reactive Programs (Q2819788) (← links)
- Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy (Q2819789) (← links)
- Summary-Based Context-Sensitive Data-Dependence Analysis in Presence of Callbacks (Q2819792) (← links)
- Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth (Q2819794) (← links)
- Predicting Program Properties from "Big Code" (Q2819795) (← links)
- DReX (Q2819796) (← links)
- Data-Parallel String-Manipulating Programs (Q2819798) (← links)
- Safe & Efficient Gradual Typing for TypeScript (Q2819802) (← links)
- Space-Efficient Manifest Contracts (Q2819803) (← links)
- Manifest Contracts for Datatypes (Q2819804) (← links)
- Common Compiler Optimisations are Invalid in the C11 Memory Model and what we can do about it (Q2819807) (← links)
- From Communicating Machines to Graphical Choreographies (Q2819808) (← links)
- A Scalable, Correct Time-Stamped Stack (Q2819810) (← links)
- Analyzing Program Analyses (Q2819811) (← links)
- Compositional CompCert (Q2819813) (← links)
- Polymorphic Functions with Set-Theoretic Types (Q2819814) (← links)
- Principal Type Schemes for Gradual Programs (Q2819815) (← links)
- Dependent Information Flow Types (Q2819817) (← links)
- Abstract Symbolic Automata (Q2819818) (← links)
- A Coalgebraic Decision Procedure for NetKAT (Q2819821) (← links)
- Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests (Q2819822) (← links)
- Programming up to Congruence (Q2819823) (← links)
- A Meta Lambda Calculus with Cross-Level Computation (Q2819825) (← links)
- Algebraic Effects, Linearity, and Quantum Programming Languages (Q2819826) (← links)
- Proof Spaces for Unbounded Parallelism (Q2819827) (← links)
- Equations, Contractions, and Unique Solutions (Q2819828) (← links)
- Succinct Representation of Concurrent Trace Sets (Q2819829) (← links)
- K-Java (Q2819831) (← links)
- Towards the Essence of Hygiene (Q2819832) (← links)
- Self-Representation in Girard's System U (Q2819833) (← links)
- Probabilistic Termination (Q2819834) (← links)
- Leveraging Weighted Automata in Compositional Reasoning about Concurrent Probabilistic Systems (Q2819835) (← links)
- Full Abstraction for Signal Flow Graphs (Q2819836) (← links)
- Conjugate Hylomorphisms -- Or (Q2819837) (← links)
- Quantitative Interprocedural Analysis (Q2819838) (← links)
- Specification Inference Using Context-Free Language Reachability (Q2819840) (← links)
- On Characterizing the Data Access Complexity of Programs (Q2819842) (← links)
- Sound Modular Verification of C Code Executing in an Unverified Context (Q2819844) (← links)
- Deep Specifications and Certified Abstraction Layers (Q2819848) (← links)
- A Calculus for Relaxed Memory (Q2819850) (← links)
- Iris (Q2819854) (← links)
- Tractable Refinement Checking for Concurrent Objects (Q2819855) (← links)
- Decentralizing SDN Policies (Q2819856) (← links)
- Program Boosting (Q2819858) (← links)
- Fiat (Q2819861) (← links)
- Differential Privacy (Q5890874) (← links)