POPL 2027
Proceedings of the ACM on Programming Languages, Volume 11, Number POPL
Powered by
Conference Publishing Consulting

Proceedings of the ACM on Programming Languages, Volume 11, Number POPL

POPL – Journal Issue

Contents - Abstracts - Authors

Frontmatter

Title Page
Article: popl27foreword-fm000-p (type: Frontmatter) doi:
Editorial Message
Article: popl27foreword-fm001-p (type: Frontmatter) doi:
Sponsors
Article: popl27foreword-fm003-p (type: Frontmatter) doi:

Papers

Let Functions Speak: Lightweight Parametric Polymorphism via Domain and Range Types
Siyuan He, Songlin Jia, and Tiark Rompf
(Purdue University, USA)
Article Search Article: popl27main-p3-p (type: Full Paper) doi:
WasmPi: An Efficient Certified Interpreter for WebAssembly 3.0 with Verified Mutually Iso-recursive Subtyping
Xiaojia Rao
(Independent, UK)
Article Search Article: popl27main-p20-p (type: Full Paper) doi:
Left on Read: Well-Behaved Semantics for No-Return Atomics
Matan Kalp and Ori Lahav
(Tel Aviv University, Israel)
Article Search Article: popl27main-p51-p (type: Full Paper) doi:
Exact Sampling from Floating-Point Probability Distributions
Feras A. Saad, Thomas Draper, and Wonyeol Lee
(Carnegie Mellon University, USA; POSTECH, Republic of Korea)
Article Search Article: popl27main-p67-p (type: Full Paper) doi:
A SymPL Program Logic for Geometric Numerical Integrators
Vaibhav Mehta, Idhant Gode, and Justin Hsu
(Cornell University, USA)
Article Search Article: popl27main-p75-p (type: Full Paper) doi:
On the Decidability of Verification under Release/Acquire
Giovanna Kobus Conrado and Andreas Pavlogiannis
(Aarhus University, Denmark)
Article Search Article: popl27main-p86-p (type: Full Paper) doi:
An End-to-End Theory for Compositional Symbolic Execution: From Expressive Specifications to SMT
Shivanandan Tamil Kumaran, Andreas Lööw, and Philippa Gardner
(Imperial College London, UK; Royal Holloway, University of London, UK)
Article Search Article: popl27main-p99-p (type: Full Paper) doi:
Yarrow: Reconciling Effect Handlers and Region-Based Memory Management
Anders Alnor Mathiasen, Amin Timany, and Lars Birkedal
(Aarhus University, Denmark)
Article Search Article: popl27main-p105-p (type: Full Paper) doi:
Context Types: Bunched Modalities for Unifying Safety and Reachability
Zhe Zhou, Benjamin Delaware, and Suresh Jagannathan
(Purdue University, USA)
Article Search Article: popl27main-p106-p (type: Full Paper) doi:
CIRT: Calculus of Inductive Refinement Types
Alessio Ferrarini, Niki Vazou, and G. A. Kavvos
(IMDEA Software Institute, Spain; University of Bristol, UK)
Article Search Article: popl27main-p107-p (type: Full Paper) doi:
Cambria: Resource Abstraction for Parametrized Algebraic Effects and Handlers
Jack Liell-Cock and Sam Staton
(University of Oxford, UK)
Article Search Article: popl27main-p128-p (type: Full Paper) doi:
Real Ideals: Symbolic Verification of Simulation-Based Security
Kirby Linvill and Gowtham Kaki
(University of Colorado Boulder, USA)
Article Search Article: popl27main-p132-p (type: Full Paper) doi:
Multi-language Program Logics
Alexander Loitzl, Niklas Mück, and Michael Sammler
(Institute of Science and Technology Austria, Austria; MPI-SWS, Germany)
Article Search Article: popl27main-p141-p (type: Full Paper) doi:
How to Do Something Relevant for a Change
April Gonçalves and Conor Titania McBride
(University of Strathclyde, UK)
Article Search Article: popl27main-p143-p (type: Full Paper) doi:
Robust Type Applications for Higher-Rank Polymorphism
Shengyi Jiang, Chen Cui, Xuejing Huang, and Bruno C. d. S. Oliveira
(University of Hong Kong, China; Standard Chartered Bank, UK)
Article Search Article: popl27main-p146-p (type: Full Paper) doi:
A Fast Quantitative Analyzer for NetKAT
Thomas Lu, Qiancheng Fu, Kevin Batz, Oliver Bøving, Tiago Ferreira, Mark Moeller, Nate Foster, and Alexandra Silva
(Cornell University, USA; University of Münster, Germany; Technical University of Denmark, Denmark; Radboud University, Netherlands; College of the Holy Cross, USA; EPFL, Switzerland; Jane Street, USA)
Article Search Article: popl27main-p148-p (type: Full Paper) doi:
Solving the Reachability Problem for Branching Vector Addition Systems via Semilinear Inductive Invariants
Clotilde Bizière, Jérôme Leroux, and Grégoire Sutre
(LaBRI, France; University of Bordeaux, France; CNRS, France; Bordeaux INP, France; University of Warsaw, Poland)
Article Search Article: popl27main-p155-p (type: Full Paper) doi:
From Dependent Type Theory to Dependently Typed Higher Order Logic
Luca Maio, Alexander Bentkamp, Jasmin Blanchette, and Sophie Tourret
(LMU Munich, Germany; Cryspen, France; Inria, France; MPI-INF, Germany)
Article Search Article: popl27main-p160-p (type: Full Paper) doi:
An Algebraic Perspective on Operational Semantics
Eric Bond and Max S. New
(University of Michigan, USA)
Article Search Article: popl27main-p162-p (type: Full Paper) doi:
The Program Logic of Abstract Interpretation
Paolo Baldan, Roberto Bruni, Francesco Ranzato, and Diletta Rigo
(University of Padova, Italy; University of Pisa, Italy)
Article Search Article: popl27main-p170-p (type: Full Paper) doi:
Flow Typing: A New Lens on Linearity
Sky Wilshaw and Graham Hutton
(University of Nottingham, UK)
Article Search Article: popl27main-p187-p (type: Full Paper) doi:
Proof Repair and (Co)algebra Equivalences
E.G. Plante III, Eric Paul, Cosmo Viola, G. A. Kavvos, and Talia Ringer
(University of Illinois at Urbana-Champaign, USA; University of Bristol, UK)
Article Search Article: popl27main-p193-p (type: Full Paper) doi:
Reasoning about Relaxed Memory with Strict Snapshots
Sunho Park, Jaewoo Kim, Jeho Yeon, and Jeehoon Kang
(Seoul National University, Republic of Korea; KAIST, Republic of Korea; FuriosaAI, Republic of Korea)
Article Search Article: popl27main-p196-p (type: Full Paper) doi:
Building Extensible Program Logics through Effect Handlers
Zichen Zhang, Simon Oddershede Gregersen, and Joseph Tassarotti
(New York University, USA; CISPA Helmholtz Center for Information Security, Germany)
Article Search Article: popl27main-p201-p (type: Full Paper) doi:
Sheaf Semantics of Probabilistic Programs
Shing Hin Ho, Nicolas Wu, and Azalea Raad
(Imperial College London, UK)
Article Search Article: popl27main-p210-p (type: Full Paper) doi:
Mathematical Foundations for Symmetric Programming and Reasoning: Eliminating Symmetric Cases with Group Actions
Ohad Kammar and Matija Pretnar
(University of Edinburgh, UK; University of Ljubljana, Slovenia)
Article Search Article: popl27main-p216-p (type: Full Paper) doi:
Validating Concurrent Correctness Witnesses with Ghosts by Thread-Modular Abstract Interpretation
Michael Schwarz, Zhendong Ang, and Umang Mathur
(National University of Singapore, Singapore)
Article Search Article: popl27main-p226-p (type: Full Paper) doi:
TopoLS: Lattice Surgery Compilation via Topological Program Transformations
Junyu Zhou, Yuhao Liu, Ethan Decker, Justin Kalloor, Mathias Weiden, Kean Chen, Costin Iancu, and Gushu Li
(University of Pennsylvania, USA; Lawrence Berkeley National Laboratory, USA; University of California at Berkeley, USA)
Article Search Article: popl27main-p232-p (type: Full Paper) doi:
Dependent Multiplicities in Dependent Linear Type Theory
Maximilian Doré
(University of Oxford, UK)
Article Search Article: popl27main-p235-p (type: Full Paper) doi:
Rewinding the Fold: Making Stateful Computations Retractable
Ziteng Wang, Linus Zheng, Dixin Tang, and Isil Dillig
(University of Texas at Austin, USA)
Article Search Article: popl27main-p237-p (type: Full Paper) doi:
Logical Relations on Display
Steven Schaefer, Johnson He, and Max S. New
(University of Michigan, USA)
Article Search Article: popl27main-p255-p (type: Full Paper) doi:
A Fistful of Abstract Values: Synthesizing the Transformers Compilers Actually Need
Dominic Kennedy, Xuanyu Peng, Yuyou Fan, John Regehr, Loris D'Antoni, and Ben Greenman
(University of Utah, USA; University of California at San Diego, USA)
Article Search Article: popl27main-p268-p (type: Full Paper) doi:
Normalized Probabilistic Semantics Is Not Associative
Elena Di Lavore, Mario Román, and Márk Széles
(Tallinn University of Technology, Estonia; Radboud University Nijmegen, Netherlands)
Article Search Article: popl27main-p272-p (type: Full Paper) doi:
Efficient Proof Engines with Lambda-DAGs
Jon Rosario, Dustin Jamner, Adam Chlipala, and Andres Erbsen
(Massachusetts Institute of Technology, USA; Google, USA)
Article Search Article: popl27main-p285-p (type: Full Paper) doi:
Compass: Synthesis of Term Rewriting Systems with Bounded Completeness
Marcel Ullrich, Titouan Lozac'h, Albert Greaca, and Sebastian Hack
(Saarland University, Germany; Université Paris-Saclay, France; ENS Paris-Saclay, France)
Article Search Article: popl27main-p295-p (type: Full Paper) doi:
Lackadaisical Contracts for Higher-Order Functions
Cameron Moy, Anfisa Bogdanenko, and Matthias Felleisen
(Northeastern University, USA)
Article Search Article: popl27main-p311-p (type: Full Paper) doi:
Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams
Daniel Basgoeze, Kevin Batz, Sebastian Junges, and Joost-Pieter Katoen
(RWTH Aachen University, Germany; University of Münster, Germany; Radboud University Nijmegen, Netherlands)
Article Search Article: popl27main-p319-p (type: Full Paper) doi:
Amaryllis: Integrating Dynamic Allocation and Iris-Style Resources into a Distributional Probabilistic Logic
Janine Lohse, Tim Rohde, Jimmy Xin, Niklas Mück, Iona Kuhn, Derek Dreyer, Deepak Garg, and Emanuele D'Osualdo
(MPI-SWS, Germany; CISPA Helmholtz Center for Information Security, Germany; University of Konstanz, Germany)
Article Search Article: popl27main-p321-p (type: Full Paper) doi:
Fast Mixed-Precision Real Evaluation
Artem Yadrov, Aditya Kumar, and Pavel Panchekha
(University of Utah, USA; University of Washington, USA)
Article Search Article: popl27main-p326-p (type: Full Paper) doi:
A Complete Calculus for Hamiltonian Quantum Programming
Jacques Carette, Chris Heunen, Robin Kaarsgaard, Neil J. Ross, and Amr Sabry
(McMaster University, Canada; University of Edinburgh, UK; University of Southern Denmark, Denmark; Dalhousie University, Canada; Indiana University, USA)
Article Search Article: popl27main-p340-p (type: Full Paper) doi:
McPTS: A Framework for Mechanizing Pure Type Systems
Antoine Gaulin, Rafael Girardello, Junyoung Jang, and Brigitte Pientka
(McGill University, Canada)
Article Search Article: popl27main-p342-p (type: Full Paper) doi:
Compositional Symbolic Execution à la Carte
Sacha-Élie Ayoun, Andreas Lööw, Seung Hoon Park, Opale Sjöstedt, Petar Maksimović, and Philippa Gardner
(Imperial College London, UK; Royal Holloway, University of London, UK; Mathematical Institute of the Serbian Academy of Sciences and Arts, Serbia)
Article Search Article: popl27main-p345-p (type: Full Paper) doi:
Mosaic: From Language Fragments to Program Logics
Max Vistrup, Klaus Kraßnitzer, Michael Sammler, and Ralf Jung
(ETH Zurich, Switzerland; Institute of Science and Technology Austria, Austria)
Article Search Article: popl27main-p351-p (type: Full Paper) doi:
Efficient Meta-synthesis for Finite-Aspect Checkable Languages
Chentian Wu and Xiaokang Qiu
(University of Wisconsin-Madison, USA; Purdue University, USA)
Article Search Article: popl27main-p353-p (type: Full Paper) doi:
Parametric Recognizability over the Integers
Jakub Kaszycki, Alessio Mansutti, and Mikhail Starchak
(IMDEA Software Institute, Spain; University of Warsaw, Poland; Max Planck Institute for Software Systems, Germany)
Article Search Article: popl27main-p360-p (type: Full Paper) doi:
Sequential Algorithms as a Dialectica Interpretation
Valentin Blot
(LS2N, France; Inria, France; Nantes Université, France)
Article Search Article: popl27main-p402-p (type: Full Paper) doi:
Violet: A Logical Framework for Information Security via Possibilistic Conditional Independence
Flavio Ascari, Emanuele D'Osualdo, Deepak Garg, and Ana Oliveira da Costa
(University of Konstanz, Germany; MPI-SWS, Germany; IST Austria, Austria)
Article Search Article: popl27main-p415-p (type: Full Paper) doi:
Bidirectional Type Slicing
Max Carroll, Anil Madhavapeddy, and Cyrus Omar
(University of Cambridge, UK; University of Michigan, USA)
Article Search Article: popl27main-p422-p (type: Full Paper) doi:
Decreasing Diagrams Are Complete for Confluence
Jörg Endrullis, Ievgen Ivanov, and Femke van Raamsdonk
(Vrije Universiteit Amsterdam, Netherlands; Taras Shevchenko National University of Kyiv, Ukraine)
Article Search Article: popl27main-p440-p (type: Full Paper) doi:
Fractional Permission Session Types
Selene Wu and Ankush Das
(New York University, USA; Boston University, USA)
Article Search Article: popl27main-p441-p (type: Full Paper) doi:
Solving Partially Observable Safety Games via Symbolic Memory Abstractions
Jia Pan, Ziteng Wang, Venkat Arun, Kenneth L. McMillan, and Isil Dillig
(University of Texas at Austin, USA)
Article Search Article: popl27main-p452-p (type: Full Paper) doi:
Adequate Losses via Quantitative Linear Logic
Matteo Capucci, Ekaterina Komendantskaya, Charles Grellois, Robert Atkey, and Matthew L. Daggitt
(University of Strathclyde, UK; University of Southampton, UK; Heriot-Watt University, UK; University of Sheffield, UK; University of Western Australia, Australia)
Article Search Article: popl27main-p459-p (type: Full Paper) doi:
LR Parsing Is an Abstract Interpretation of LL Parsing
Brian Sze Kai Cheong, Yong Qi Foo, and Michael D. Adams
(National University of Singapore, Singapore)
Article Search Article: popl27main-p463-p (type: Full Paper) doi:
E-Stitch: Top-Down Library Learning with E-Graphs
Kavi Gupta, Maddy Bowers, and Armando Solar-Lezama
(Massachusetts Institute of Technology, USA)
Article Search Article: popl27main-p472-p (type: Full Paper) doi:
Model Checking Probabilistic Multiparty Session Types
Aleksander Junge, Leo Seojun Lee, Joe Paulus, Nobuko Yoshida, and David Parker
(University of Oxford, UK)
Article Search Article: popl27main-p484-p (type: Full Paper) doi:
A Type System for Communication-Safe Hardware Design
Aditya Ranjan Jha, Jason Zhijingcheng Yu, Umang Mathur, and Prateek Saxena
(National University of Singapore, Singapore)
Article Search Article: popl27main-p491-p (type: Full Paper) doi:
Trees, Walks, and Words: A Logic for File System Interactions
Eric C. Zhao, Zekai Li, Lukas Lazarek, Feiyang Wang, Konstantinos Kallas, Robert Y. Lewis, and Nikos Vasilakis
(Brown University, USA; University of California at Los Angeles, USA)
Article Search Article: popl27main-p505-p (type: Full Paper) doi:
What Is a Good Projection? Correctness and Separation Results of End-Point Projections
Jake Masters and Nobuko Yoshida
(University of Oxford, UK)
Article Search Article: popl27main-p524-p (type: Full Paper) doi:
Exact Inference for Nested Discrete Probabilistic Programs
Francesco Pontiggia, Francesca Randone, Ezio Bartocci, and Michele Chiari
(TU Wien, Austria; AIT Austrian Institute of Technology, Austria)
Article Search Article: popl27main-p528-p (type: Full Paper) doi:
TriCycle: Proving Temporal Hyperproperties, Coinductively
Arthur Correnson, N. Ege Saraç, Mishel Carelli, and Bernd Finkbeiner
(CISPA Helmholtz Center for Information Security, Germany)
Article Search Article: popl27main-p535-p (type: Full Paper) doi:
Taming Scope Extrusion in Gradual Imperative Metaprogramming
Tianyu Chen, Darshal Shetty, Jeremy G. Siek, Chao-Hong Chen, Weixi Ma, Arnaud Venet, and Rocky Liu
(Indiana University, USA; Meta, USA)
Article Search Article: popl27main-p541-p (type: Full Paper) doi:
Approximate Counting for Symbolic Automata
Alexis de Colnet, Umang Mathur, and Kuldeep S. Meel
(Leiden University, Netherlands; National University of Singapore, Singapore; University of Toronto, Canada)
Article Search Article: popl27main-p542-p (type: Full Paper) doi:
Unfolding Continuous Time: Interval-Based Tableaux for Signal Temporal Logic over Finite Signals
Geunyeol Yu, Jia Lee, and Kyungmin Bae
(POSTECH, Republic of Korea)
Article Search Article: popl27main-p552-p (type: Full Paper) doi:
Compositional Verification of Flow-Directed Transformations
Benjamin Quiring and Lingxiao Zheng
(University of Maryland at College Park, USA; Northeastern University, USA)
Article Search Article: popl27main-p595-p (type: Full Paper) doi:
You Only Get One Shot: A Separation Logic for One-Shot Undelimited Continuations
Paulo Emílio de Vilhena and Xavier Leroy
(University of Surrey, UK; Collège de France, France; PSL University, France)
Article Search Article: popl27main-p618-p (type: Full Paper) doi:
Choreographing Effects
Jonghyun Jung, Cong Ma, and Yizhou Zhang
(University of Waterloo, Canada)
Article Search Article: popl27main-p621-p (type: Full Paper) doi:
Consolidating Equality in a Proof Irrelevant Universe
Thiago Felicissimo, Rafael Bocquet, Kenji Maillard, Nicolas Tabareau, Éric Tanter, and Théo Winterhalter
(Inria Rennes, France; University of Chile, Chile; Inria Saclay, France)
Article Search Article: popl27main-p624-p (type: Full Paper) doi:
From Structural Causal Models to Higher Order Causal Probabilistic Programming: Contextual Equivalences, Graded Monads and Functor Categories
Theo Wang, Dario Stein, Michael Lee, Eli Bingham, John Feser, Ohad Kammar, Sam Staton, and Jeremy Yallop
(University of Oxford, UK; Heriot-Watt University, UK; University of Cambridge, UK; Basis, USA; University of Edinburgh, UK)
Article Search Article: popl27main-p647-p (type: Full Paper) doi:
Solving First-Order Fixed-Point Logics via a Least-to-Greatest Transformation Based on Game Semantics
Satoshi Kura and Hiroshi Unno
(Waseda University, Japan; Tohoku University, Japan)
Article Search Article: popl27main-p679-p (type: Full Paper) doi:
Tensorizing Probabilistic Programs for Accelerated Exact Inference
Jianlin Li, Nick Guo, Zekun Wang, Eric Wang, and Yizhou Zhang
(University of Waterloo, Canada)
Article Search Article: popl27main-p689-p (type: Full Paper) doi:
Verified E-Graphs for Automating Compiler Verification
Dustin Jamner, Tilek Askerbekov, and Adam Chlipala
(Massachusetts Institute of Technology, USA)
Article Search Article: popl27main-p692-p (type: Full Paper) doi:
On the Expressive Power of Hook-Indexed State
Toby Ueno, Ezra Cooper, Simon Fowler, and Sam Lindley
(University of Edinburgh, UK; University of Glasgow, UK)
Article Search Article: popl27main-p693-p (type: Full Paper) doi:
Symmetric Proofs of Parameterized Programs
Ruotong Cheng and Azadeh Farzan
(University of Toronto, Canada)
Article Search Article: popl27main-p694-p (type: Full Paper) doi:
Directed Proof-Relevant Logical Relations in Simplicial HoTT
Runming Li, Harrison Grodin, and Robert Harper
(Carnegie Mellon University, USA)
Article Search Article: popl27main-p702-p (type: Full Paper) doi:
Exorcis: Decoupling Angels from Demons in a High-Level Logic for Effect-Dependent Program Transformations
Eugène Flesselle, Benjamin Peters, and Derek Dreyer
(MPI-SWS, Germany; EPFL, Switzerland)
Article Search Article: popl27main-p719-p (type: Full Paper) doi:
Quantitative Security for Session Types, Denotationally
Pedro H. Azevedo de Amorim and Farzaneh Derakhshan
(University of Bath, UK; Illinois Institute of Technology, USA)
Article Search Article: popl27main-p725-p (type: Full Paper) doi:
Quantitative Verification of Infinite-State Networks
Dhruv Nevatia and David Basin
(ETH Zurich, Switzerland)
Article Search Article: popl27main-p737-p (type: Full Paper) doi:
Two-Sided Amortized Resource Analysis: Verifying Resource Lower Bounds via Ill-Typing
Zimu Chen and Di Wang
(Peking University, China)
Article Search Article: popl27main-p741-p (type: Full Paper) doi:
Decoupling Liveness Obligations from Threads in the Lantana Concurrent Separation Logic
Dongjae Lee, M. Frans Kaashoek, Nickolai Zeldovich, and Joseph Tassarotti
(Massachusetts Institute of Technology, USA; New York University, USA)
Article Search Article: popl27main-p749-p (type: Full Paper) doi:
Fuss-Free Cumulative Universes: Theory and Practice
Raphaël Sterbac and Jon Sterling
(ENS Paris-Saclay, France; Université Paris-Saclay, France; University of Cambridge, UK)
Article Search Article: popl27main-p752-p (type: Full Paper) doi:
Thin Concurrent Games in Logical Form
Victor Blanchi, Pierre Clairambault, Raphaëlle Crubillé, and Simon Forest
(LIS, France; Aix-Marseille Université, France; Loria, France; Université de Lorraine, France)
Article Search Article: popl27main-p755-p (type: Full Paper) doi:
SIFting through Concurrency
Anita Buckley, Pavel Chuprikov, and Patrick Eugster
(USI Lugano, Switzerland; LTCI, France; Télécom Paris, France; Institut Polytechnique de Paris, France)
Article Search Article: popl27main-p768-p (type: Full Paper) doi:
Named Commutative Blocks for Parallelization
Parisa Fathololumi, Adam Chen, Maurice Herlihy, and Eric Koskinen
(Stevens Institute of Technology, USA; Brown University, USA)
Article Search Article: popl27main-p781-p (type: Full Paper) doi:
Intersection and Union Types Meet Quantitative Semantics, Classically
Delia Kesner, Federico Olimpieri, Gabriele Vanoni, and Daniel Ventura
(Université Paris Cité, France; Université Aix-Marseille, France; Federal University of Goiás, Brazil)
Article Search Article: popl27main-p819-p (type: Full Paper) doi:
Definitional Inversion, without Normalisation
Mario Carneiro, Thierry Coquand, Adrien Frabetti Mathieu, Meven Lennon-Bertrand, Paul-André Melliès, and Stephanie Weirich
(Chalmers University of Technology, Sweden; University of Gothenburg, Sweden; École Normale Supérieure PSL, France; IRIF, France; Inria, France; Université Paris Cité, France; CNRS, France; University of Pennsylvania, USA)
Article Search Article: popl27main-p826-p (type: Full Paper) doi:
Type-Directed Specification of ABIs for WebAssembly
Brianna Marshall, Ryan Doenges, Mathias Pedersen, Elan Semenova, Owen Duckham, Lars Birkedal, and Amal Ahmed
(Northeastern University, USA; Boston College, USA; Aarhus University, Denmark)
Article Search Article: popl27main-p841-p (type: Full Paper) doi:
An Interpretation of Bunched Logic for Reasoning about Heap-Manipulating Quantum Programs
Bonan Su, Li Zhou, Yuan Feng, and Mingsheng Ying
(Tsinghua University, China; Institute of Software at Chinese Academy of Sciences, China; University of Technology Sydney, Australia)
Article Search Article: popl27main-p845-p (type: Full Paper) doi:
GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes
Junyu Zhou, Ali Javadi-Abhari, and Gushu Li
(University of Pennsylvania, USA; IBM, USA)
Article Search Article: popl27main-p877-p (type: Full Paper) doi:
Normal Forms and Complete Relations for Circuits in Agda
Xiaoning Bian and Yuan Feng
(Tsinghua University, China)
Article Search Article: popl27main-p911-p (type: Full Paper) doi:
Adaptive Strategies for GR(1) Games
Krishna Shankaranarayanan, Kaushik Mallik, and Abhilasha Sharma Suman
(IIT Bombay, India; IMDEA Software Institute, Spain)
Article Search Article: popl27main-p916-p (type: Full Paper) doi:
Abstract Interpretation with Error Bounds
Yuanfeng Shi, Ziyue Jin, and Xin Zhang
(Peking University, China)
Article Search Article: popl27main-p934-p (type: Full Paper) doi:
Hashing Modulo $\alpha$-Equivalence: Faster and Deterministic
Paweł Gawrychowski and Wojciech Janczewski
(University of Wrocław, Poland)
Article Search Article: popl27main-p956-p (type: Full Paper) doi:
Secure Information Flow in Quantum Programs
Zhicheng Zhang, Mingsheng Ying, and Lirong Xia
(Griffith University, Australia; University of Technology Sydney, Australia; Rutgers University, USA; DIMACS, USA)
Article Search Article: popl27main-p958-p (type: Full Paper) doi:
Fully Dependent Abstract Machines
Yulong Huang and Jeremy Yallop
(University of Cambridge, UK)
Article Search Article: popl27main-p1041-p (type: Full Paper) doi:
Bidirectional Typing with Freezing, Skeletons, and Ghosts
Wenhao Tang, Shengyi Jiang, Aghilas Y. Boussaa, Sam Lindley, and Bruno C. d. S. Oliveira
(University of Edinburgh, UK; University of Hong Kong, China; École normale supérieure - PSL, France)
Article Search Article: popl27main-p1060-p (type: Full Paper) doi:
When to Analyze: Attribute-Guided Semantic Filtering for Constrained Decoding
Junseong Park, Jinsang Kim, and Woosuk Lee
(Hanyang University, Republic of Korea)
Article Search Article: popl27main-p1077-p (type: Full Paper) doi:
Analyzing Unbounded Probabilistic Loops using Characteristic Function Recurrences
Francesca Randone and Ezio Bartocci
(TU Wien, Austria)
Article Search Article: popl27main-p1129-p (type: Full Paper) doi:
Above the Cut: Sequent Calculus as a High-Level Programming Language
Paul Downen
(University of Massachusetts at Lowell, USA)
Article Search Article: popl27main-p1131-p (type: Full Paper) doi:
Linear-Time T-Gate Optimization via Random Abstraction
Aws Albarghouthi
(University of Wisconsin-Madison, USA)
Article Search Article: popl27main-p1147-p (type: Full Paper) doi:
Context-Free Session Types with Borrowing
Janek Spaderna, Onur Şahin, Peter Thiemann, and Marius Weidner
(University of Freiburg, Germany)
Article Search Article: popl27main-p1159-p (type: Full Paper) doi:
The Equational Theory of Rational String-to-String Functions
Mikołaj Bojańczyk, Kacper Lewandowski, and Katzper Michno
(University of Warsaw, Poland)
Article Search Article: popl27main-p1167-p (type: Full Paper) doi:
Composing Updates in Time and Space
Devora Chait-Roth, Kedar S. Namjoshi, and Thomas Wies
(New York University, USA; Nokia Bell Labs, USA)
Article Search Article: popl27main-p1188-p (type: Full Paper) doi:
Vectorizing Recurrences over Semirings
Yihong Zhang, Bala Vinaithirthan, Karima Ma, Zachary Tatlock, Maaz Bin Safeer Ahmad, and Andrew Adams
(University of Washington, USA; Stanford University, USA; Adobe, USA)
Article Search Article: popl27main-p1234-p (type: Full Paper) doi:
Coinduction for Stochastic Processes in Higher-Order Lazy Probabilistic Programming: Semantics via the Ionescu--Tulcea Extension Theorem in $\boldsymbol{\omega}\textbf{Qbs}$
Seo Jin Park and Sam Staton
(University of Oxford, UK)
Article Search Article: popl27main-p1360-p (type: Full Paper) doi:
Closed Convex Hulls for Linear Integer-Real Arithmetic
Nicolas Koh and Zachary Kincaid
(Princeton University, USA)
Article Search Article: popl27main-p1417-p (type: Full Paper) doi:
A Logical Interpretation of Two-Sided Type Systems
Celia Mengyue Li and Steven Ramsay
(University of Bristol, UK)
Article Search Article: popl27main-p1424-p (type: Full Paper) doi:
Hybrid Pluck: Exact Inference for Discrete-Continuous Probabilistic Programs via Mixed Knowledge Compilation
Theodore Long and Alex Lew
(Yale University, USA)
Article Search Article: popl27main-p1496-p (type: Full Paper) doi:
Nominal Automata with Name Deallocation
Simon Prucker, Lutz Schröder, and Stefan Milius
(Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany)
Article Search Article: popl27main-p1575-p (type: Full Paper) doi:

proc time: 0.24