Kavon’s Publications

Papers

In cronological order (most recent first):

• Kavon Farvardin. A Compiler-based Online Adaptive Optimizer. Doctoral Dissertation, 2020.
  • 🔗 DOI; GitHub
• Kavon Farvardin, John Reppy. From folklore to fact: Comparing implementations of stacks and continuations. In Programming Language Design and Implementation (PLDI), 2020.
  • ⭐️ awarded Distinguished Paper
  • 🔗 DOI
  • 📸 Talk
• Kavon Farvardin, John Reppy. Compiling with Continuations and LLVM. In Electronic Proceedings in Theoretical Computer Science (EPTCS), 2018.
  • Post-proceedings of 2016 ACM SIGPLAN ML Family Workshop
  • 🔗 DOI; arXiv
• Kavon Farvardin. Weighing Continuations for Concurrency. Master’s Thesis, 2017.
  • 📸 Slides
• Kavon Farvardin, John Reppy. Spread-Spectrum Organization for Concurrent Pools. Unpublished, 2016.
  • ❌ rejected from SPAA’16

Talks

In cronological order (most recent first):

• Kavon Farvardin, Hal Finkel, Michael Kruse, John Reppy. atJIT: an online, feedback-directed optimizer for C++. LLVM Developers’ Meeting, 2018.
  • 🔗 Event; GitHub
• Kavon Farvardin, Simon Peyton Jones. Native Support for Explicit Stacks in LLVM. Haskell Implementors’ Workshop, 2017.
  • 🔗 Event
  • 📸 Slides
• Kavon Farvardin, John Reppy. Practical Conversion from CPS to Direct Style. Midwest PL Summit, 2016.
  • 🔗 Event
• Kavon Farvardin, John Reppy. Compiling with Continuations and LLVM. ML Workshop, 2016.
  • 🔗 Event
  • 📄 Abstract
  • 📸 Slides