Light Logic and Resource Bounded Computation
No abstract available.
Related papers
- Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs ICFP 2024
- Higher-order probabilistic adversarial computations: categorical semantics and program logics ICFP 2021
- A PolyTime Functional Language from Light Linear Logic ESOP 2010
- Eager Haskell: resource-bounded execution yields efficient iteration Haskell 2002
- Optimal Schedules for Parallel Prefix Computation with Bounded Resources PPoPP 1991
- Liquid resource types ICFP 2020
- Light: replay via tightly bounded recording PLDI 2015
- A Program Logic for Under-approximating Worst-case Resource Usage ESOP 2026