Skip to content

Commit eee9bd0

Browse files
committed
fix copy paste
1 parent 1d59267 commit eee9bd0

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

docs/papers.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@
33
3. Westrick, Sam, et al. “Entanglement Detection with Near-Zero Cost.” Proceedings of the ACM on Programming Languages, vol. 6, no. ICFP, Aug. 2022, pp. 679–710. Crossref, <a href='https://doi.org/10.1145/3547646' target='_blank'>https://doi.org/10.1145/3547646</a>. ![](https://img.shields.io/badge/Who%20Woulda%20Thunk%20It-FFFF00?style=flat-square)
44
4. Grodin, Harrison, et al. “Decalf: A Directed, Effectful Cost-Aware Logical Framework.” Proceedings of the ACM on Programming Languages, vol. 8, no. POPL, Jan. 2024, pp. 273–301. Crossref, <a href='https://doi.org/10.1145/3632852' target='_blank'>https://doi.org/10.1145/3632852</a>. ![](https://img.shields.io/badge/The%20%22That's%20cool!%20But%20why%20tho%3F%22-FFFF00?style=flat-square)
55
5. Wang, Jingbo, et al. “Synthesizing MILP Constraints for Efficient and Robust Optimization.” Proceedings of the ACM on Programming Languages, vol. 7, no. PLDI, June 2023, pp. 1896–919. Crossref, <a href='https://doi.org/10.1145/3591298' target='_blank'>https://doi.org/10.1145/3591298</a>.
6-
6. Heim, Philippe, and Rayna Dimitrova. “Solving Infinite-State Games via Acceleration.” Proceedings of the ACM on Programming Languages, vol. 8, no. POPL, Jan. 2024, pp. 1696–726. Crossref, <a href='https://doi.org/10.1145/3632899' target='_blank'>https://doi.org/10.1145/3632899</a>. ![](https://img.shields.io/badge/%F0%9F%9A%A7[UNDER%20CONSTRUCTION]%F0%9F%9A%A7-FFFF00?style=flat-square) ![](https://img.shields.io/badge/Chicken%20Scratch-FFFF00?style=flat-square)
6+
6. Heim, Philippe, and Rayna Dimitrova. “Solving Infinite-State Games via Acceleration.” Proceedings of the ACM on Programming Languages, vol. 8, no. POPL, Jan. 2024, pp. 1696–726. Crossref, <a href='https://doi.org/10.1145/3632899' target='_blank'>https://doi.org/10.1145/3632899</a>. ![](https://img.shields.io/badge/Chicken%20Scratch-FFFF00?style=flat-square)
77
7. Sun, Yican, et al. “Synthesizing Efficient Memoization Algorithms.” Proceedings of the ACM on Programming Languages, vol. 7, no. OOPSLA2, Oct. 2023, pp. 89–115. Crossref, <a href='https://doi.org/10.1145/3622800' target='_blank'>https://doi.org/10.1145/3622800</a>. ![](https://img.shields.io/badge/%F0%9F%9A%A7[UNDER%20CONSTRUCTION]%F0%9F%9A%A7-FFFF00?style=flat-square) ![](https://img.shields.io/badge/An%20Experience%20Like%20No%20Other-003359?style=flat-square)
88
8. Spiwack, Arnaud, et al. “Linearly Qualified Types: Generic Inference for Capabilities and Uniqueness.” Proceedings of the ACM on Programming Languages, vol. 6, no. ICFP, Aug. 2022, pp. 137–64. Crossref, <a href='https://doi.org/10.1145/3547626' target='_blank'>https://doi.org/10.1145/3547626</a>. ![](https://img.shields.io/badge/Homework%20Required-FFFF00?style=flat-square)
99
9. Barthe, Gilles, et al. “On Feller Continuity and Full Abstraction.” Proceedings of the ACM on Programming Languages, vol. 6, no. ICFP, Aug. 2022, pp. 826–54. Crossref, <a href='https://doi.org/10.1145/3547651' target='_blank'>https://doi.org/10.1145/3547651</a>.

0 commit comments

Comments
 (0)