Proceedings of the ACM on Programming Languages 2019: all accepted papers
- Generating a fluent API with syntax checking from an LR grammar ↗Tetsuro Yamazaki, Tomoki Nakamaru, Kazuhiro Ichikawa et al.12 citations
- Reliable and fast DWARF-based stack unwinding ↗Théophile Bastian, Stephen Kell, Francesco Zappa Nardelli12 citations
- What is decidable about gradual types? ↗Zeina Migeed, Jens Palsberg12 citations
- Complete monitors for gradual types ↗Ben Greenman, Matthias Felleisen, Christos Dimoulas11 citations
- Deciding memory safety for single-pass heap-manipulating programs ↗Umang Mathur, Adithya Murali, Paul Krogmeier et al.11 citations
- DeepSEA: a language for certified system software ↗Vilhelm Sjöberg, Yuyang Sang, Shu-Chun Weng et al.11 citations
- Relational cost analysis for functional-imperative programs ↗Weihao Qu, Marco Gaboardi, Deepak Garg11 citations
- Coherence of type class resolution ↗Gert-Jan Bottu, Ningning Xie, Koar Marntirosian et al.10 citations
- From high-level inference algorithms to efficient code ↗Rajan Walia, Praveen Narayanan, Jacques Carette et al.10 citations
- Deterministic parallel fixpoint computation ↗Sung Kook Kim, Arnaud Venet, Aditya V. Thakur9 citations
- Fully abstract module compilation ↗Karl Crary9 citations
- Modalities, cohesion, and information flow ↗G. A. Kavvos9 citations
- On the design, implementation, and use of laziness in R ↗Aviral Goel, Jan Vitek9 citations
- Undecidability of d <: and its decidable fragments ↗Jason Z. S. Hu, Ondřej Lhoták9 citations
- Verifying safety and accuracy of approximate parallel programs via canonical sequentialization ↗Vimuth Fernando, Keyur Joshi, Saša Misailovíc9 citations
- A calculus for Esterel: if can, can. if no can, no can. ↗Spencer P. Florence, Shu-Hung You, Jesse A. Tov et al.8 citations
- Dependent type systems as macros ↗Stephen Chang, Michael Ballantyne, Milo Turner et al.8 citations
- Derivative grammars: a symbolic approach to parsing with derivatives ↗Ian Henriksen, Gianfranco Bilardi, Keshav K. Pingali8 citations
- Program synthesis with algebraic library specifications ↗Benjamin Mariano, Josh Reese, Siyuan Xu et al.8 citations
- Augmented example-based synthesis using relational perturbation properties ↗Shengwei An, Rishabh Kumar Singh, Saša Misailovíc et al.7 citations
- Dependently typed Haskell in industry (experience report) ↗David Thrane Christiansen, Iavor S. Diatchki, Robert Dockins et al.7 citations
- Does blame shifting work? ↗Lukas Lazarek, Alexis King, Samanvitha Sundar et al.7 citations
- Generating precise error specifications for C: a zero shot learning approach ↗Bai-Jun Wu, John Peter Campora, Yi He et al.7 citations
- Higher-order type-level programming in Haskell ↗Csongor Kiss, Tony Field, Susan Eisenbach et al.7 citations
- Intersection types and runtime errors in the pi-calculus ↗Ugo Dal Lago, Marc de Visme, Damiano Mazza et al.7 citations
- Modular verification of heap reachability properties in separation logic ↗Arshavir Ter-Gabrielyan, Alexander J. Summers, Péter Müller7 citations
- Pointer life cycle types for lock-free data structures with memory reclamation ↗Roland Meyer, Sebastian Wolff7 citations
- Rebuilding racket on chez scheme (experience report) ↗Matthew Flatt, Caner Derici, R. Kent Dybvig et al.7 citations
- Precise reasoning with structured time, structured heaps, and collective operations ↗Grégory M. Essertel, Guannan Wei, Tiark Rompf6 citations
- Asphalion: trustworthy shielding against Byzantine faults ↗Ivana Vukotic, Vincent Rahli, Paulo Verı́ssimo5 citations
- Fairness in responsive parallelism ↗Stefan K. Muller, Sam Westrick, Umut A. Acar5 citations
- Familial monads and structural operational semantics ↗Tom Hirschowitz5 citations
- Inferring frame conditions with static correlation analysis ↗Oana Fabiana Andreescu, Thomas Wiben Jensen, Stéphane Lescuyer et al.5 citations
- Language-integrated privacy-aware distributed queries ↗Guido Salvaneschi, Mirko Köhler, Daniel Sokolowski et al.5 citations
- Polymorphic symmetric multiple dispatch with variance ↗Gyunghee Park, Jaemin Hong, Guy Lewis Steele et al.5 citations
- Scala implicits are everywhere: a large-scale study of the use of Scala implicits in the wild ↗Filip Křikava, Heather Miller, Jan Vítek5 citations
- Synthesis of coordination programs from linear temporal specifications ↗Suguman Bansal, Kedar S. Namjoshi, Yaniv Saʼar5 citations
- An efficient algorithm for type-safe structural diffing ↗Victor Cacciari Miraldo, Wouter Swierstra4 citations
- DProf: distributed profiler with strong guarantees ↗Zachary Benavides, Keval Vora, Rajiv Gupta4 citations
- Design, implementation, and application of GPU-based Java bytecode interpreters ↗Ahmet Çelik, Pengyu Nie, Christopher J. Rossbach et al.4 citations
- IVT: an efficient method for sharing subtype polymorphic objects ↗Yu-Ping Wang, Xu-Qiang Hu, Zi–Xin Zou et al.4 citations
- Refinement kinds: type-safe programming with practical type-level computation ↗Luı́s Caires, Bernardo Toninho4 citations
- Ryū revisited: printf floating point conversion ↗Ulf Adams4 citations
- Gradual parametricity, revisited ↗Matías Toro, Elizabeth Labrada, Éric Tanter3 citations
- Lambda calculus with algebraic simplification for reduction parallelization by equational reasoning ↗Akimasa Morihata3 citations
- Optimal approximate sampling from discrete probability distributions ↗Feras A. Saad, Cameron E. Freer, Martin Rinard et al.3 citations
- Optimization of swift protocols ↗Rajkishore Barik, Manu Sridharan, Murali Krishna Ramanathan et al.3 citations
- PlanAlyzer: assessing threats to the validity of online experiments ↗Emma Tosch, Eytan Bakshy, Emery D. Berger et al.3 citations
- Decomposition diversity with symmetric data and codata ↗David A. Binder, Julian Jabs, Ingo Skupin et al.2 citations
- Kind inference for datatypes ↗Ningning Xie, Richard A. Eisenberg, Bruno C. d. S. Oliveira2 citations
- PλωNK: functional probabilistic NetKAT ↗Alexander Vandenbroucke, Tom Schrijvers2 citations
- Reduction monads and their signatures ↗Benedikt Ahrens, André Hirschowitz, Ambroise Lafont et al.2 citations
- Par means parallel: multiplicative linear logic proofs as concurrent functional programs ↗Federico Aschieri, Francesco A. Genco1 citation
- Partial type constructors: or, making ad hoc datatypes less ad hoc ↗Mark P. Jones, J. Garrett Morris, Richard A. Eisenberg1 citation
- Specification and inference of trace refinement relations ↗Timos Antonopoulos, Eric Koskinen, Ton Chanh Le1 citation
- Coq Coqの正しい!CoqにおけるCoqのための型検査と消去の検証【JST・京大機械翻訳】 ↗Matthieu Sozeau, Boulier Simon, Yannick Forster et al.
- Frangel:制御構造を用いたコンポーネントベース合成【JST・京大機械翻訳】 ↗Shi Kensen, Jacob Steinhardt, Percy Liang
- Lambda: the ultimate sublanguage (experience report) ↗Jeremy Yallop, Leo White
- Principality and approximation under dimensional bound ↗Andrej Dudenhefner, Jakob Rehof
- Quantitative separation logic: a logic for reasoning about probabilistic pointer programs ↗Kevin Batz, Benjamin Lucien Kaminski, Katoen, Joost-Pieter et al.
- ニューラルネットワークを証明するための抽象領域【JST・京大機械翻訳】 ↗Gagandeep Singh, Timon Gehr, Pueschel Markus et al.
- 単一パスHEAP操作プログラムのためのメモリ安全性の決定【JST・京大機械翻訳】 ↗Umang Mathur, Adithya Murali, Krogmeier Paul et al.
- 型安全構造拡散のための効率的アルゴリズム【JST・京大機械翻訳】 ↗Victor Cacciari Miraldo, Wouter Swierstra
- 文脈ベースのコード表現学習と注意ベースのニューラルネットワークによるバグ検出の改善【JST・京大機械翻訳】 ↗Li Yi, Wang Shaohua, N Nguyen Tien et al.
- 未解釈プログラムの決定可能な検証【JST・京大機械翻訳】 ↗Umang Mathur, P. Madhusudan, Viswanathan Mahesh
This page in Markdown → https://md.research.elamur.ai/free/en/venues/proceedings-of-the-acm-on-programming-languages/2019/papers/page/3/