Next Conference
POPL '25
- Sponsor:
- sigplan
Abstract
No abstract available.
Cited By
- Kobayashi T and Kiselyov O Complete Stream Fusion for Software-Defined Radio Proceedings of the 2024 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation, (57-69)
-
Kiselyov O (2024). MetaOCaml: Ten Years Later Functional and Logic Programming, 10.1007/978-981-97-2300-3_12, (219-236),
-
Xie N, White L, Nicole O and Yallop J (2023). MacoCaml: Staging Composable and Compilable Macros, Proceedings of the ACM on Programming Languages, 10.1145/3607851, 7:ICFP, (604-648), Online publication date: 30-Aug-2023.
-
Sieczkowski F, Pyzik M and Biernacki D (2023). A General Fine-Grained Reduction Theory for Effect Handlers, Proceedings of the ACM on Programming Languages, 10.1145/3607848, 7:ICFP, (511-540), Online publication date: 30-Aug-2023.
- Yallop J, Xie N and Krishnaswami N (2023). flap: A Deterministic Parser with Fused Lexing, Proceedings of the ACM on Programming Languages, 7:PLDI, (1194-1217), Online publication date: 6-Jun-2023.
- Bach Poulsen C and van der Rest C (2023). Hefty Algebras: Modular Elaboration of Higher-Order Algebraic Effects, Proceedings of the ACM on Programming Languages, 7:POPL, (1801-1831), Online publication date: 9-Jan-2023.
- Moon D, Blinn A and Omar C tylr: a tiny tile-based structure editor Proceedings of the 7th ACM SIGPLAN International Workshop on Type-Driven Development, (28-37)
- Dagnino F (2022). A Meta-theory for Big-step Semantics, ACM Transactions on Computational Logic, 23:3, (1-50), Online publication date: 31-Jul-2022.
- Matsushita Y, Denis X, Jourdan J and Dreyer D RustHornBelt: a semantic foundation for functional verification of Rust programs with unsafe code Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, (841-856)
- Fukihara Y and Katsumata S Generalized Bounded Linear Logic and its Categorical Semantics Foundations of Software Science and Computation Structures, (226-246)
- Ahn D, Baker A, Bentley M, Briggs I, Gopalakrishnan G, Hammerling D, Laguna I, Lee G, Milroy D and Vertenstein M (2021). Keeping science on keel when software moves, Communications of the ACM, 64:2, (66-74), Online publication date: 25-Jan-2021.
- Rosemann J, Moll S and Hack S (2021). An abstract interpretation for SPMD divergence on reducible control flow graphs, Proceedings of the ACM on Programming Languages, 5:POPL, (1-31), Online publication date: 4-Jan-2021.
- Hüttel H (2019). Using session types for reasoning about boundedness in the -calculus, Acta Informatica, 57:6, (801-827), Online publication date: 1-Dec-2020.
- Liu B, Dong W, Zhang Y, Wang D and Liu J Boosting component-based synthesis with control structure recommendation Proceedings of the 1st ACM SIGSOFT International Workshop on Representation Learning for Software Engineering and Program Languages, (19-28)
- Winkler S and Moser G Runtime Complexity Analysis of Logically Constrained Rewriting Logic-Based Program Synthesis and Transformation, (37-55)
- Dal Lago U, Guerrieri G and Heijltjes W Decomposing Probabilistic Lambda-Calculi Foundations of Software Science and Computation Structures, (136-156)
- Biernacki D, Piróg M, Polesiuk P and Sieczkowski F (2019). Binders by day, labels by night: effect instances via lexically scoped handlers, Proceedings of the ACM on Programming Languages, 4:POPL, (1-29), Online publication date: 1-Jan-2020.
-
Dagnino F, Bono V, Zucca E and Dezani-Ciancaglini M (2020). Soundness Conditions for Big-Step Semantics Programming Languages and Systems, 10.1007/978-3-030-44914-8_7, (169-196),
-
Matsushita Y, Tsukada T and Kobayashi N (2020). RustHorn: CHC-Based Verification for Rust Programs Programming Languages and Systems, 10.1007/978-3-030-44914-8_18, (484-514),
- Chatterjee K, Fu H and Goharshady A (2019). Non-polynomial Worst-Case Analysis of Recursive Programs, ACM Transactions on Programming Languages and Systems, 41:4, (1-52), Online publication date: 31-Dec-2020.
-
Zorzi M (2019). Quantum Calculi—From Theory to Language Design, Applied Sciences, 10.3390/app9245472, 9:24, (5472)
- Vukotic I, Rahli V and Esteves-Veríssimo P (2019). Asphalion: trustworthy shielding against Byzantine faults, Proceedings of the ACM on Programming Languages, 3:OOPSLA, (1-32), Online publication date: 10-Oct-2019.
-
Xiao Y and Tuosto E (2019). On Learning Nominal Automata with Binders, Electronic Proceedings in Theoretical Computer Science, 10.4204/EPTCS.304.9, 304, (137-155)
-
Cimini M (2019). Towards Gradually Typed Capabilities in the Pi-Calculus, Electronic Proceedings in Theoretical Computer Science, 10.4204/EPTCS.304.5, 304, (61-76)
-
de Muijnck-Hughes J, Brady E and Vanderbauwhede W (2019). Value-Dependent Session Design in a Dependently Typed Language, Electronic Proceedings in Theoretical Computer Science, 10.4204/EPTCS.291.5, 291, (47-59)
- Biernacki D, Piróg M, Polesiuk P and Sieczkowski F (2017). Handle with care: relational interpretation of algebraic effects and handlers, Proceedings of the ACM on Programming Languages, 2:POPL, (1-30), Online publication date: 1-Jan-2018.
- Ancona D, Dagnino F and Zucca E (2017). Reasoning on divergent computations with coaxioms, Proceedings of the ACM on Programming Languages, 1:OOPSLA, (1-26), Online publication date: 12-Oct-2017.
- Rapoport M, Kabir I, He P and Lhoták O (2017). A simple soundness proof for dependent object types, Proceedings of the ACM on Programming Languages, 1:OOPSLA, (1-27), Online publication date: 12-Oct-2017.
-
Hüttel H (2017). Using Session Types for Reasoning About Boundedness in the Pi-Calculus, Electronic Proceedings in Theoretical Computer Science, 10.4204/EPTCS.255.5, 255, (67-82)
-
Avanzini M and Schaper M (2017). GUBS Upper Bound Solver (Extended Abstract), Electronic Proceedings in Theoretical Computer Science, 10.4204/EPTCS.248.6, 248, (17-23)
Index Terms
- Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages
Recommendations
Acceptance Rates
Overall Acceptance Rate824of4,130submissions,20%
Year | Submitted | Accepted | Rate |
---|---|---|---|
POPL '15 | 227 | 52 | 23% |
POPL '14 | 220 | 51 | 23% |
POPL '04 | 176 | 29 | 16% |
POPL '03 | 126 | 24 | 19% |
POPL '02 | 128 | 28 | 22% |
POPL '01 | 126 | 24 | 19% |
POPL '00 | 151 | 30 | 20% |
POPL '99 | 136 | 24 | 18% |
POPL '98 | 175 | 32 | 18% |
POPL '97 | 225 | 36 | 16% |
POPL '96 | 148 | 34 | 23% |
POPL '94 | 173 | 39 | 23% |
POPL '93 | 199 | 39 | 20% |
POPL '92 | 204 | 30 | 15% |
POPL '91 | 152 | 31 | 20% |
POPL '89 | 191 | 30 | 16% |
POPL '88 | 177 | 28 | 16% |
POPL '87 | 108 | 29 | 27% |
POPL '83 | 170 | 28 | 16% |
POPL '82 | 121 | 38 | 31% |
POPL '81 | 121 | 24 | 20% |
POPL '79 | 146 | 27 | 18% |
POPL '78 | 135 | 27 | 20% |
POPL '77 | 105 | 25 | 24% |
POPL '76 | 90 | 20 | 22% |
POPL '75 | 100 | 23 | 23% |
POPL '73 | 100 | 22 | 22% |
Overall | 4,130 | 824 | 20% |