A Core Calculus for Static Latency Tracking with Placement Types
- Resource Type
- Working Paper
- Authors
- Reinhard, Tobias
- Source
- Subject
- Computer Science - Programming Languages
Computer Science - Logic in Computer Science
Computer Science - Software Engineering
D.3.1
F.3.1
C.4
B.4.4
- Language
Developing efficient geo-distributed applications is challenging as programmers can easily introduce computations that entail high latency communication. We propose a language design which makes latency explicit and extracts type-level bounds for a computation's runtime latency. We present our initial steps with a core calculus that enables extracting provably correct latency bounds and outline future work.
Comment: 3 pages, 0 figures, accepted at Student Research Competition @ POPL 2019