The First Workshop on Programming Language Pearls (PL-Pearls 2023)
The workshop on Programming Language Pearls (PL-Pearls) is part of the course "The Light of Science (Young Scholars) — Programming Language Pearls" (00399570) in Nanjing University. The goal of the workshop is to provide an informal forum for understanding interesting ideas, theories, and techniques about programming languages.
The workshop speakers are the students who enroll in the course (00399570) in the current year. Each speaker will submit an extended abstract, and give a short talk.
No formal proceedings will be published. The extended abstracts and the slides will be available online.
Important Dates
- Extended abstracts submission deadline: 12:00 noon, Friday 15 December, 2023
- Slides submission deadline: 12:00 noon, Friday 22 December, 2023
- Workshop: Saturday 23 December, 2023
Submissions should be sent to the course instructor Hongjin Liang by email.
Program
Saturday 23 December, 14:00 - 16:50, Gulou Campus, Xinjiao 104
Memory Management and Data Types
- 14:00. Ruoyun Tang. How to collect garbage when heap memory is running out.
[Paper] [Slides]
- 14:10. Yikun Su. Generational Garbage Collection in Python and Java.
[Paper] [Slides]
- 14:20. Zi Li. Decoding Python Memory Management: Navigating Dynamic Allocation and Cycle Garbage Collection.
[Paper] [Slides]
- 14:30. Yifei Guan. A Comparative Study of Pointers.
[Paper] [Slides]
- 14:40. Ziming Ren. Statically typing and dynamically typing.
[Paper] [Slides]
- 14:50. Break.
Language Features and Evolution
- 15:00. Ziming Xu. Decorators in Python.
[Paper] [Slides]
- 15:10. Wenqing Ge. Building Better Concurrency with Kotlin Coroutines.
[Paper] [Slides]
- 15:20. Zhihui Yin. Why Do We Need the Object-Oriented Programming.
[Paper] [Slides]
- 15:30. Yinhao Fang. The Evolution of C++: A Comparative Study with C and its Futuristic Development.
[Paper] [Slides]
- 15:40. Long Ling. The Programming Languages of Vim and Emacs: Advantages and Disadvantages.
[Paper] [Slides]
- 15:50. Tairan Li. Markdown: Probably the most Easy-to-Use Markup Language.
[Paper] [Slides]
- 16:00. Break.
Complexity and correctness
- 16:10. Zhidun Huang. Ending merge sort halfway can improve its efficiency.
[Paper] [Slides]
- 16:20. Huajun Lu. How to use Hoare Logic to verify program correctness.
[Paper] [Slides]
- 16:30. Junshu Xing. How to use Hoare Logic to prove program correctness.
[Paper] [Slides]
- 16:40. Haoran Ni. The Automatic Generation of Loop Invariants using SMT Solvers.
[Paper] [Slides]
Guidelines for Submitting Extended Abstracts
Each extended abstract should be submitted in PDF format, and have no more than 2 pages of text (excluding bibliography). It should use the SIGPLAN format (specifically, the acmart LaTeX class with sigplan option), which is a two-column page layout with 10pt font. The LaTeX template can be found at the SIGPLAN author information page.
The extended abstract must be in English, and not anonymous.
Guidelines for Talks
Each talk will be 10 minutes long (including questions).
Contact Information
For questions please contact the course instructor Hongjin Liang.