2026· International Conference on Interactive Theorem Proving· pp. 17:1-17:18· 0 citations· 12 references
Computer Science
TL;DR
This work creates an “over language” in which to express all the information the authors need to be able to output correct and idiomatic syntax for each of their targets, and details the design of the extensible system.
eBPF allows user-defined programs to safely extend Linux kernel functionality at runtime, but its final machine code comes from a compilation pipeline that differs from native targets, and how efficient that pipeline is has no clear reference point. Our work constructs one: using the standard LLVM x86 backend as an app...
Hoang Duong, Hao Sun, Zhen-Dong Su· Proceedings of the 4th Works...· 0 citations
The "rebound" library is used to demonstrate and reflect on the current capabilities of dependently-typed programming in Haskell, and supports working with well-scoped de Bruijn indices in abstract syntax trees.
Stephanie Weirich· Proceedings of the 19th ACM...· 0 citations
This work is building an executable formal semantics for eBPF in F* that explicitly distinguishes cross-platform and platform-specific behaviors and envision this semantics as a practical foundation for a uniform, trustworthy eBPF across platforms.
Yan-Ze Li, Reto Achermann, Ivan Beschastnikh et al.· Proceedings of the 4th Works...· 0 citations
CPL is presented, a compact C-like systems language that retains C's direct access to memory, layout, and machine interfaces while experimenting with a smaller grammar and selected conveniences from newer languages, and whether C-like are more convenient to use for compiler experiments than modern approaches and paradi...
This work is a continuation, and generalization, of Andrew Appel's landmark work on “Compiling with Continuations”, but instead of natural-deduction-based languages like the lambda calculus, it uses sequent-calculus-inspired languages throughout all intermediate stages.
Marius Müller, David Binder, Marco Tzschentke et al.· ACM Transactions on Programm...· 0 citations
A line of work that treats future-proofness as an abstraction-design problem is summarized, identifying boundaries across the data processing stack where concerns must evolve independently, and design interfaces that preserve enough structure across that boundary for optimization.
Jana Giceva· Proceedings of the VLDB Endo...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
