POPL
2016
ACM
8 years 1 months ago
2016
ACM
Traditional control-flow analysis (CFA) for higher-order languages introduces spurious connections between callers and callees, and different invocations of a function may pollut...
POPL
2016
ACM
8 years 1 months ago
2016
ACM
Effect and session type systems are two expressive behavioural type systems. The former is usually developed in the context of the λcalculus and its variants, the latter for the ...
POPL
2016
ACM
8 years 1 months ago
2016
ACM
Fault-tolerant distributed algorithms play an important role in many critical/high-availability applications. These algorithms are notoriously difficult to implement correctly, d...
POPL
2016
ACM
8 years 1 months ago
2016
ACM
Input-output examples have emerged as a practical and user-friendly specification mechanism for program synthesis in many environments. While example-driven tools have demonstrat...
POPL
2016
ACM
8 years 1 months ago
2016
ACM
According to conventional wisdom, a self-interpreter for a strongly normalizing λ-calculus is impossible. We call this the normalization barrier. The normalization barrier stems ...
POPL
2016
ACM
8 years 1 months ago
2016
ACM
We present an internal formalisation of dependent type theory in type theory using a special case of higher inductive types from Homotopy Type Theory which we call quotient induct...
POPL
2016
ACM
8 years 1 months ago
2016
ACM
Our new macro expander for Racket builds on a novel approach to hygiene. Instead of basing macro expansion on variable renamings that are mediated by expansion history, our new ex...