Pages that link to "Item:Q2828237"
From MaRDI portal
The following pages link to Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Q2828237):
Displaying 50 items.
- Breaking through the normalization barrier: a self-interpreter for f-omega (Q2828238) (← links)
- Type theory in type theory using quotient inductive types (Q2828239) (← links)
- System f-omega with equirecursive types for datatype-generic programming (Q2828241) (← links)
- A theory of effects and resources: adjunction models and polarised calculi (Q2828243) (← links)
- Temporal verification of higher-order functional programs (Q2828245) (← links)
- Scaling network verification using symmetry and surgery (Q2828246) (← links)
- Model checking for symbolic-heap separation logic with inductive predicates (Q2828247) (← links)
- Reducing crash recoverability to reachability (Q2828248) (← links)
- Query-guided maximum satisfiability (Q2828249) (← links)
- String solving with word equations and transducers: towards a logic for analysing mutation XSS (Q2828250) (← links)
- Unboundedness and downward closures of higher-order pushdown automata (Q2828251) (← links)
- Fully-abstract compilation by approximate back-translation (Q2828252) (← links)
- Lightweight verification of separate compilation (Q2828254) (← links)
- From MinX to MinC: semantics-driven decompilation of recursive datatypes (Q2828255) (← links)
- Sound type-dependent syntactic language extension (Q2828257) (← links)
- Decidability of inferring inductive invariants (Q2828258) (← links)
- The hardness of data packing (Q2828259) (← links)
- The complexity of interaction (Q2828261) (← links)
- Dependent types and multi-monadic effects in F* (Q2828265) (← links)
- Fabular: regression formulas as probabilistic programming (Q2828269) (← links)
- Kleenex: compiling nondeterministic transducers to deterministic streaming transducers (Q2828274) (← links)
- Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Q2828275) (← links)
- Transforming spreadsheet data types using examples (Q2828277) (← links)
- Chapar: certified causally consistent distributed key-value stores (Q2828279) (← links)
- 'Cause I'm strong enough: Reasoning about consistency choices in distributed systems (Q2828282) (← links)
- A program logic for concurrent objects under fair scheduling (Q2828283) (← links)
- PSync: a partially synchronous language for fault-tolerant distributed algorithms (Q2828285) (← links)
- Principal type inference for GADTs (Q2828286) (← links)
- Abstracting gradual typing (Q2828288) (← links)
- The gradualizer: a methodology and algorithm for generating gradual type systems (Q2828289) (← links)
- Abstraction refinement guided by a learnt probabilistic model (Q2828290) (← links)
- Symbolic abstract data type inference (Q2828291) (← links)
- SMO: an integrated approach to intra-array and inter-array storage optimization (Q2828294) (← links)
- PolyCheck: dynamic verification of iteration space transformations on affine programs (Q2828296) (← links)
- Effects as sessions, sessions as effects (Q2828297) (← links)
- Monitors and blame assignment for higher-order session types (Q2828298) (← links)
- Environmental bisimulations for probabilistic higher-order languages (Q2828300) (← links)
- A concurrency semantics for relaxed atomics that permits optimisation and avoids thin-air executions (Q2828301) (← links)
- Overhauling SC atomics in C11 and OpenCL (Q2828302) (← links)
- Taming release-acquire consistency (Q2828304) (← links)
- Newtonian program analysis via tensor product (Q2828307) (← links)
- Casper: an efficient approach to call trace collection (Q2828311) (← links)
- Pushdown control-flow analysis for free (Q2828314) (← links)
- Lattice-theoretic progress measures and coalgebraic model checking (Q2828316) (← links)
- Algorithms for algebraic path properties in concurrent systems of constant treewidth components (Q2828317) (← links)
- Memoryful geometry of Interaction II: recursion and adequacy (Q2828318) (← links)
- Learning programs from noisy data (Q2828319) (← links)
- Optimizing synthesis with metasketches (Q2828321) (← links)
- Maximal specification synthesis (Q2828322) (← links)
- Example-directed synthesis: a type-theoretic interpretation (Q2828323) (← links)
