• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 2,079 matches

• 2024
• 
  Supun Abeysinghe, Anxhelo Xhebraj, Tiark Rompf:
  Flan: An Expressive and Efficient Datalog Compiler for Program Analysis. Proc. ACM Program. Lang. 8(POPL): 2577-2609 (2024)
• 
  Nathanael L. Ackerman, Cameron E. Freer, Younesse Kaddar, Jacek Karwowski, Sean K. Moss, Daniel M. Roy, Sam Staton, Hongseok Yang:
  Probabilistic Programming Interfaces for Random Graphs: Markov Categories, Graphons, and Nominal Sets. Proc. ACM Program. Lang. 8(POPL): 1819-1849 (2024)
• 
  Thorsten Altenkirch, Yorgo Chamoun, Ambrus Kaposi, Michael Shulman:
  Internal Parametricity, without an Interval. Proc. ACM Program. Lang. 8(POPL): 2340-2369 (2024)
• 
  Cezar-Constantin Andrici, Stefan Ciobaca, Catalin Hritcu, Guido Martínez, Exequiel Rivas, Éric Tanter, Théo Winterhalter:
  Securing Verified IO Programs Against Unverified Code in F. Proc. ACM Program. Lang. 8(POPL): 2226-2259 (2024)
• 
  Zhendong Ang, Umang Mathur:
  Predictive Monitoring against Pattern Regular Languages. Proc. ACM Program. Lang. 8(POPL): 2191-2225 (2024)
• 
  Jatin Arora, Stefan K. Muller, Umut A. Acar:
  Disentanglement with Futures, State, and Interaction. Proc. ACM Program. Lang. 8(POPL): 1569-1599 (2024)
• 
  Robert Atkey:
  Polynomial Time and Dependent Types. Proc. ACM Program. Lang. 8(POPL): 2288-2317 (2024)
• 
  Lyes Attouche, Mohamed-Amine Baazizi, Dario Colazzo, Giorgio Ghelli, Carlo Sartiani, Stefanie Scherzinger:
  Validation of Modern JSON Schema: Formalization and Complexity. Proc. ACM Program. Lang. 8(POPL): 1451-1481 (2024)
• 
  A. R. Balasubramanian, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
  Reachability in Continuous Pushdown VASS. Proc. ACM Program. Lang. 8(POPL): 90-114 (2024)
• 
  Kevin Batz, Tom Jannik Biskup, Joost-Pieter Katoen, Tobias Winkler:
  Programmatic Strategy Synthesis: Resolving Nondeterminism in Probabilistic Programs. Proc. ACM Program. Lang. 8(POPL): 2792-2820 (2024)
• 
  Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche:
  Ramsey Quantifiers in Linear Arithmetics. Proc. ACM Program. Lang. 8(POPL): 1-32 (2024)
• 
  Mikolaj Bojanczyk, Bartek Klin:
  Polyregular Functions on Unordered Trees of Bounded Height. Proc. ACM Program. Lang. 8(POPL): 1326-1351 (2024)
• 
  Michael Borkowski, Niki Vazou, Ranjit Jhala:
  Mechanizing Refinement Types. Proc. ACM Program. Lang. 8(POPL): 2099-2128 (2024)
• 
  Ian Briggs, Yash Lad, Pavel Panchekha:
  Implementation and Synthesis of Math Library Functions. Proc. ACM Program. Lang. 8(POPL): 942-969 (2024)
• 
  Alex Buna-Marginean, Vincent Cheval, Mahsa Shirmohammadi, James Worrell:
  On Learning Polynomial Recursive Programs. Proc. ACM Program. Lang. 8(POPL): 1001-1027 (2024)
• 
  Marco Campion, Mila Dalla Preda, Roberto Giacobazzi, Caterina Urban:
  Monotonicity and the Precision of Program Analysis. Proc. ACM Program. Lang. 8(POPL): 1629-1662 (2024)
• 
  John Peter Campora III, Mohammad Wahiduzzaman Khan, Sheng Chen:
  Type-Based Gradual Typing Performance Optimization. Proc. ACM Program. Lang. 8(POPL): 2667-2699 (2024)
• 
  Jacques Carette, Chris Heunen, Robin Kaarsgaard, Amr Sabry:
  With a Few Square Roots, Quantum Computing Is as Easy as Pi. Proc. ACM Program. Lang. 8(POPL): 546-574 (2024)
• 
  Giuseppe Castagna, Mickaël Laurent, Kim Nguyen:
  Polymorphic Type Inference for Dynamic Languages. Proc. ACM Program. Lang. 8(POPL): 1179-1210 (2024)
• 
  Lorenzo Ceragioli, Fabio Gadducci, Giuseppe Lomurno, Gabriele Tedeschi:
  Quantum Bisimilarity via Barbs and Contexts: Curbing the Power of Non-deterministic Observers. Proc. ACM Program. Lang. 8(POPL): 1269-1297 (2024)
• 
  Soham Chakraborty, Shankara Narayanan Krishna, Umang Mathur, Andreas Pavlogiannis:
  How Hard Is Weak-Memory Testing? Proc. ACM Program. Lang. 8(POPL): 1978-2009 (2024)
• 
  Nicolas Chataing, Stephen Dolan, Gabriel Scherer, Jeremy Yallop:
  Unboxed Data Constructors: Or, How cpp Decides a Halting Problem. Proc. ACM Program. Lang. 8(POPL): 1509-1539 (2024)
• 
  Joshua M. Cohen, Philip Johnson-Freyd:
  A Formalization of Core Why3 in Coq. Proc. ACM Program. Lang. 8(POPL): 1789-1818 (2024)
• 
  Liron Cohen, Adham Jabarin, Andrei Popescu, Reuben N. S. Rowe:
  The Complex(ity) Landscape of Checking Infinite Descent. Proc. ACM Program. Lang. 8(POPL): 1352-1384 (2024)
• 
  Patrick Cousot:
  Calculational Design of [In]Correctness Transformational Program Logics by Abstract Interpretation. Proc. ACM Program. Lang. 8(POPL): 175-208 (2024)
• 
  Will Crichton, Shriram Krishnamurthi:
  A Core Calculus for Documents: Or, Lambda: The Ultimate Document. Proc. ACM Program. Lang. 8(POPL): 667-694 (2024)
• 
  John Cyphert, Zachary Kincaid:
  Solvable Polynomial Ideals: The Ideal Reflection for Program Analysis. Proc. ACM Program. Lang. 8(POPL): 724-752 (2024)
• 
  Henry DeYoung, Andreia Mordido, Frank Pfenning, Ankush Das:
  Parametric Subtyping for Structural Parametric Polymorphism. Proc. ACM Program. Lang. 8(POPL): 2700-2730 (2024)
• 
  Haowei Deng, Runzhou Tao, Yuxiang Peng, Xiaodi Wu:
  A Case for Synthesis of Recursive Quantum Unitary Programs. Proc. ACM Program. Lang. 8(POPL): 1759-1788 (2024)
• 
  Yuantian Ding, Xiaokang Qiu:
  Enhanced Enumeration Techniques for Syntax-Guided Synthesis of Bit-Vector Manipulations. Proc. ACM Program. Lang. 8(POPL): 2129-2159 (2024)

skipping 2,049 more matches