---
title: "Proceedings of the ACM on Programming Languages 2019 — all"
description: "All 265 papers of Proceedings of the ACM on Programming Languages 2019 · page 3 of 3, the most cited first; those with our summary link to it."
canonical: "https://research.elamur.ai/free/en/venues/proceedings-of-the-acm-on-programming-languages/2019/papers/page/3/"
---
[Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/venues/proceedings-of-the-acm-on-programming-languages/2019/papers/page/3/)

[home](https://md.research.elamur.ai/free/en/) / [venues](https://md.research.elamur.ai/free/en/venues/) / [Proceedings of the ACM on Programming…](https://md.research.elamur.ai/free/en/venues/proceedings-of-the-acm-on-programming-languages/) / [2019](https://md.research.elamur.ai/free/en/venues/proceedings-of-the-acm-on-programming-languages/2019/) / [papers](https://md.research.elamur.ai/free/en/venues/proceedings-of-the-acm-on-programming-languages/2019/papers/) / page 3

# Proceedings of the ACM on Programming Languages 2019: all accepted papers

265 papers · page 3 of 3 · the most cited first · [← Proceedings of the ACM on Programming Languages 2019](https://md.research.elamur.ai/free/en/venues/proceedings-of-the-acm-on-programming-languages/2019/)

[← prev](https://md.research.elamur.ai/free/en/venues/proceedings-of-the-acm-on-programming-languages/2019/papers/page/2/) [1](https://md.research.elamur.ai/free/en/venues/proceedings-of-the-acm-on-programming-languages/2019/papers/) [2](https://md.research.elamur.ai/free/en/venues/proceedings-of-the-acm-on-programming-languages/2019/papers/page/2/) **3**

201. **[Generating a fluent API with syntax checking from an LR grammar ↗](https://doi.org/10.1145/3360560)**Tetsuro Yamazaki, Tomoki Nakamaru, Kazuhiro Ichikawa et al.*12 citations*
202. **[Reliable and fast DWARF-based stack unwinding ↗](https://doi.org/10.1145/3360572)**Théophile Bastian, Stephen Kell, Francesco Zappa Nardelli*12 citations*
203. **[What is decidable about gradual types? ↗](https://doi.org/10.1145/3371097)**Zeina Migeed, Jens Palsberg*12 citations*
204. **[Complete monitors for gradual types ↗](https://doi.org/10.1145/3360548)**Ben Greenman, Matthias Felleisen, Christos Dimoulas*11 citations*
205. **[Deciding memory safety for single-pass heap-manipulating programs ↗](https://doi.org/10.1145/3371103)**Umang Mathur, Adithya Murali, Paul Krogmeier et al.*11 citations*
206. **[DeepSEA: a language for certified system software ↗](https://doi.org/10.1145/3360562)**Vilhelm Sjöberg, Yuyang Sang, Shu-Chun Weng et al.*11 citations*
207. **[Relational cost analysis for functional-imperative programs ↗](https://doi.org/10.1145/3341696)**Weihao Qu, Marco Gaboardi, Deepak Garg*11 citations*
208. **[Coherence of type class resolution ↗](https://doi.org/10.1145/3341695)**Gert-Jan Bottu, Ningning Xie, Koar Marntirosian et al.*10 citations*
209. **[From high-level inference algorithms to efficient code ↗](https://doi.org/10.1145/3341702)**Rajan Walia, Praveen Narayanan, Jacques Carette et al.*10 citations*
210. **[Deterministic parallel fixpoint computation ↗](https://doi.org/10.1145/3371082)**Sung Kook Kim, Arnaud Venet, Aditya V. Thakur*9 citations*
211. **[Fully abstract module compilation ↗](https://doi.org/10.1145/3290323)**Karl Crary*9 citations*
212. **[Modalities, cohesion, and information flow ↗](https://doi.org/10.1145/3290333)**G. A. Kavvos*9 citations*
213. **[On the design, implementation, and use of laziness in R ↗](https://doi.org/10.1145/3360579)**Aviral Goel, Jan Vitek*9 citations*
214. **[Undecidability of d \<: and its decidable fragments ↗](https://doi.org/10.1145/3371077)**Jason Z. S. Hu, Ondřej Lhoták*9 citations*
215. **[Verifying safety and accuracy of approximate parallel programs via canonical sequentialization ↗](https://doi.org/10.1145/3360545)**Vimuth Fernando, Keyur Joshi, Saša Misailovíc*9 citations*
216. **[A calculus for Esterel: if can, can. if no can, no can. ↗](https://doi.org/10.1145/3290374)**Spencer P. Florence, Shu-Hung You, Jesse A. Tov et al.*8 citations*
217. **[Dependent type systems as macros ↗](https://doi.org/10.1145/3371071)**Stephen Chang, Michael Ballantyne, Milo Turner et al.*8 citations*
218. **[Derivative grammars: a symbolic approach to parsing with derivatives ↗](https://doi.org/10.1145/3360553)**Ian Henriksen, Gianfranco Bilardi, Keshav K. Pingali*8 citations*
219. **[Program synthesis with algebraic library specifications ↗](https://doi.org/10.1145/3360558)**Benjamin Mariano, Josh Reese, Siyuan Xu et al.*8 citations*
220. **[Augmented example-based synthesis using relational perturbation properties ↗](https://doi.org/10.1145/3371124)**Shengwei An, Rishabh Kumar Singh, Saša Misailovíc et al.*7 citations*
221. **[Dependently typed Haskell in industry (experience report) ↗](https://doi.org/10.1145/3341704)**David Thrane Christiansen, Iavor S. Diatchki, Robert Dockins et al.*7 citations*
222. **[Does blame shifting work? ↗](https://doi.org/10.1145/3371133)**Lukas Lazarek, Alexis King, Samanvitha Sundar et al.*7 citations*
223. **[Generating precise error specifications for C: a zero shot learning approach ↗](https://doi.org/10.1145/3360586)**Bai-Jun Wu, John Peter Campora, Yi He et al.*7 citations*
224. **[Higher-order type-level programming in Haskell ↗](https://doi.org/10.1145/3341706)**Csongor Kiss, Tony Field, Susan Eisenbach et al.*7 citations*
225. **[Intersection types and runtime errors in the pi-calculus ↗](https://doi.org/10.1145/3290320)**Ugo Dal Lago, Marc de Visme, Damiano Mazza et al.*7 citations*
226. **[Modular verification of heap reachability properties in separation logic ↗](https://doi.org/10.1145/3360547)**Arshavir Ter-Gabrielyan, Alexander J. Summers, Péter Müller*7 citations*
227. **[Pointer life cycle types for lock-free data structures with memory reclamation ↗](https://doi.org/10.1145/3371136)**Roland Meyer, Sebastian Wolff*7 citations*
228. **[Rebuilding racket on chez scheme (experience report) ↗](https://doi.org/10.1145/3341642)**Matthew Flatt, Caner Derici, R. Kent Dybvig et al.*7 citations*
229. **[Precise reasoning with structured time, structured heaps, and collective operations ↗](https://doi.org/10.1145/3360583)**Grégory M. Essertel, Guannan Wei, Tiark Rompf*6 citations*
230. **[Asphalion: trustworthy shielding against Byzantine faults ↗](https://doi.org/10.1145/3360564)**Ivana Vukotic, Vincent Rahli, Paulo Verı́ssimo*5 citations*
231. **[Fairness in responsive parallelism ↗](https://doi.org/10.1145/3341685)**Stefan K. Muller, Sam Westrick, Umut A. Acar*5 citations*
232. **[Familial monads and structural operational semantics ↗](https://doi.org/10.1145/3290334)**Tom Hirschowitz*5 citations*
233. **[Inferring frame conditions with static correlation analysis ↗](https://doi.org/10.1145/3290360)**Oana Fabiana Andreescu, Thomas Wiben Jensen, Stéphane Lescuyer et al.*5 citations*
234. **[Language-integrated privacy-aware distributed queries ↗](https://doi.org/10.1145/3360593)**Guido Salvaneschi, Mirko Köhler, Daniel Sokolowski et al.*5 citations*
235. **[Polymorphic symmetric multiple dispatch with variance ↗](https://doi.org/10.1145/3290324)**Gyunghee Park, Jaemin Hong, Guy Lewis Steele et al.*5 citations*
236. **[Scala implicits are everywhere: a large-scale study of the use of Scala implicits in the wild ↗](https://doi.org/10.1145/3360589)**Filip Křikava, Heather Miller, Jan Vítek*5 citations*
237. **[Synthesis of coordination programs from linear temporal specifications ↗](https://doi.org/10.1145/3371122)**Suguman Bansal, Kedar S. Namjoshi, Yaniv Saʼar*5 citations*
238. **[An efficient algorithm for type-safe structural diffing ↗](https://doi.org/10.1145/3341717)**Victor Cacciari Miraldo, Wouter Swierstra*4 citations*
239. **[DProf: distributed profiler with strong guarantees ↗](https://doi.org/10.1145/3360582)**Zachary Benavides, Keval Vora, Rajiv Gupta*4 citations*
240. **[Design, implementation, and application of GPU-based Java bytecode interpreters ↗](https://doi.org/10.1145/3360603)**Ahmet Çelik, Pengyu Nie, Christopher J. Rossbach et al.*4 citations*
241. **[IVT: an efficient method for sharing subtype polymorphic objects ↗](https://doi.org/10.1145/3360556)**Yu-Ping Wang, Xu-Qiang Hu, Zi–Xin Zou et al.*4 citations*
242. **[Refinement kinds: type-safe programming with practical type-level computation ↗](https://doi.org/10.1145/3360557)**Luı́s Caires, Bernardo Toninho*4 citations*
243. **[Ryū revisited: printf floating point conversion ↗](https://doi.org/10.1145/3360595)**Ulf Adams*4 citations*
244. **[Gradual parametricity, revisited ↗](https://doi.org/10.1145/3290330)**Matías Toro, Elizabeth Labrada, Éric Tanter*3 citations*
245. **[Lambda calculus with algebraic simplification for reduction parallelization by equational reasoning ↗](https://doi.org/10.1145/3341644)**Akimasa Morihata*3 citations*
246. **[Optimal approximate sampling from discrete probability distributions ↗](https://doi.org/10.1145/3371104)**Feras A. Saad, Cameron E. Freer, Martin Rinard et al.*3 citations*
247. **[Optimization of swift protocols ↗](https://doi.org/10.1145/3360590)**Rajkishore Barik, Manu Sridharan, Murali Krishna Ramanathan et al.*3 citations*
248. **[PlanAlyzer: assessing threats to the validity of online experiments ↗](https://doi.org/10.1145/3360608)**Emma Tosch, Eytan Bakshy, Emery D. Berger et al.*3 citations*
249. **[Decomposition diversity with symmetric data and codata ↗](https://doi.org/10.1145/3371098)**David A. Binder, Julian Jabs, Ingo Skupin et al.*2 citations*
250. **[Kind inference for datatypes ↗](https://doi.org/10.1145/3371121)**Ningning Xie, Richard A. Eisenberg, Bruno C. d. S. Oliveira*2 citations*
251. **[PλωNK: functional probabilistic NetKAT ↗](https://doi.org/10.1145/3371107)**Alexander Vandenbroucke, Tom Schrijvers*2 citations*
252. **[Reduction monads and their signatures ↗](https://doi.org/10.1145/3371099)**Benedikt Ahrens, André Hirschowitz, Ambroise Lafont et al.*2 citations*
253. **[Par means parallel: multiplicative linear logic proofs as concurrent functional programs ↗](https://doi.org/10.1145/3371086)**Federico Aschieri, Francesco A. Genco*1 citation*
254. **[Partial type constructors: or, making ad hoc datatypes less ad hoc ↗](https://doi.org/10.1145/3371108)**Mark P. Jones, J. Garrett Morris, Richard A. Eisenberg*1 citation*
255. **[Specification and inference of trace refinement relations ↗](https://doi.org/10.1145/3360604)**Timos Antonopoulos, Eric Koskinen, Ton Chanh Le*1 citation*
256. **[Coq Coqの正しい!CoqにおけるCoqのための型検査と消去の検証【JST・京大機械翻訳】 ↗](https://jglobal.jst.go.jp/detail?JGLOBAL_ID=202002279315059118)**Matthieu Sozeau, Boulier Simon, Yannick Forster et al.
257. **[Frangel:制御構造を用いたコンポーネントベース合成【JST・京大機械翻訳】 ↗](https://jglobal.jst.go.jp/detail?JGLOBAL_ID=202002272061311386)**Shi Kensen, Jacob Steinhardt, Percy Liang
258. **[Lambda: the ultimate sublanguage (experience report) ↗](https://doi.org/10.1145/3342713)**Jeremy Yallop, Leo White
259. **[Principality and approximation under dimensional bound ↗](https://doi.org/10.1145/3290321)**Andrej Dudenhefner, Jakob Rehof
260. **[Quantitative separation logic: a logic for reasoning about probabilistic pointer programs ↗](https://doi.org/10.18154/rwth-2019-00833)**Kevin Batz, Benjamin Lucien Kaminski, Katoen, Joost-Pieter et al.
261. **[ニューラルネットワークを証明するための抽象領域【JST・京大機械翻訳】 ↗](https://jglobal.jst.go.jp/detail?JGLOBAL_ID=202002268379690970)**Gagandeep Singh, Timon Gehr, Pueschel Markus et al.
262. **[単一パスHEAP操作プログラムのためのメモリ安全性の決定【JST・京大機械翻訳】 ↗](https://jglobal.jst.go.jp/detail?JGLOBAL_ID=202002232179745078)**Umang Mathur, Adithya Murali, Krogmeier Paul et al.
263. **[型安全構造拡散のための効率的アルゴリズム【JST・京大機械翻訳】 ↗](https://jglobal.jst.go.jp/detail?JGLOBAL_ID=202002212446866248)**Victor Cacciari Miraldo, Wouter Swierstra
264. **[文脈ベースのコード表現学習と注意ベースのニューラルネットワークによるバグ検出の改善【JST・京大機械翻訳】 ↗](https://jglobal.jst.go.jp/detail?JGLOBAL_ID=202002289548535223)**Li Yi, Wang Shaohua, N Nguyen Tien et al.
265. **[未解釈プログラムの決定可能な検証【JST・京大機械翻訳】 ↗](https://jglobal.jst.go.jp/detail?JGLOBAL_ID=202002266529960396)**Umang Mathur, P. Madhusudan, Viswanathan Mahesh

[← prev](https://md.research.elamur.ai/free/en/venues/proceedings-of-the-acm-on-programming-languages/2019/papers/page/2/) [1](https://md.research.elamur.ai/free/en/venues/proceedings-of-the-acm-on-programming-languages/2019/papers/) [2](https://md.research.elamur.ai/free/en/venues/proceedings-of-the-acm-on-programming-languages/2019/papers/page/2/) **3**

- [← back to](https://md.research.elamur.ai/free/en/venues/proceedings-of-the-acm-on-programming-languages/2019/) — Proceedings of the ACM on Programming Languages 2019