Tiark Rompf
Computer Science · Purdue University West Lafayette
Publications
147
Citations
3,309
Est. group size
~4
Recurring co-author estimate
Active years
18
Publishing since 2009
Tiark Rompf works in programming languages and compilers, focusing on how to design type systems that let programmers safely and efficiently manage memory and resources without garbage collection. Much of the recent work centers on 'reachability types,' a way of tracking which parts of a program can access or affect which pieces of memory, and on building efficient compilers and query languages for data processing and program analysis. This research is aimed at making programs both safer (fewer bugs related to memory and aliasing) and faster (through better compiler optimizations).
Publication output was higher in 2017-2019, dropped in the early 2020s, and has since stabilized at a steady but lower rate of roughly 5 papers per year.
Generated by claude-sonnet-5 from public bibliographic data · Jul 20, 2026
- Escape with Your Self: Sound and Expressive Bidirectional Typing with Avoidance for Reachability Types
Proceedings of the ACM on Programming Languages · 2026
- Typestate via Revocable Capabilities
Proceedings of the ACM on Programming Languages · 2026
- Let Functions Speak: Lightweight Parametric Polymorphism via Domain and Range Types
arXiv (Cornell University) · 2026
- Let Functions Speak: Lightweight Parametric Polymorphism via Domain and Range Types
arXiv (Cornell University) · 2026
- When Lifetimes Liberate: A Type System for Arenas with Higher-Order Reachability Tracking
Proceedings of the ACM on Programming Languages · 2026
- Complete the Cycle: Reachability Types with Expressive Cyclic References
Proceedings of the ACM on Programming Languages · 2025
- Modeling Reachability Types with Logical Relations: Semantic Type Soundness, Termination, Effect Safety, and Equational Theory
Proceedings of the ACM on Programming Languages · 2025
- Proceedings of the 19th International Symposium on Database Programming Languages
2025
- Type, Ability, and Effect Systems: Perspectives on Purity, Semantics, and Expressiveness
arXiv (Cornell University) · 2025
- Free to Move: Reachability Types with Flow-Sensitive Effects for Safe Deallocation and Ownership Transfer
arXiv (Cornell University) · 2025
- Polymorphic Reachability Types: Tracking Freshness, Aliasing, and Separation in Higher-Order Generic Programs
Proceedings of the ACM on Programming Languages · 2024
- Flan: An Expressive and Efficient Datalog Compiler for Program Analysis
Proceedings of the ACM on Programming Languages · 2024
- Rhyme: A Data-Centric Multi-paradigm Query Language Based on Functional Logic Metaprogramming
Lecture notes in computer science · 2024
- Program Generators for Exascale and Beyond (Final Technical Report)
2024
- Graph IRs for Impure Higher-Order Languages: Making Aggressive Optimizations Affordable with Precise Effect Dependencies
Proceedings of the ACM on Programming Languages · 2023
- arXiv (Cornell University)×17
- Proceedings of the ACM on Programming Languages×16
- ACM SIGPLAN Notices×6
- Lecture notes in computer science×5
- DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)×2
- Artem Pelenitsyn
Computer Science · Purdue University West Lafayette
- Chaitanya Koparkar
Computer Science · Indiana University
- Ryan Newton
Computer Science · Purdue University West Lafayette
- Atanas Rountev
Computer Science · The Ohio State University
- Aamir Shafi
Computer Science · The Ohio State University
This profile was generated automatically from public scholarly data (OpenAlex). Group size and activity levels are estimates derived from co-authorship patterns.
Last updated Jul 20, 2026.
Claim or correct this profile