POPL 2018 Co-Located Events
POPL 2018 Co-Located Events
Powered by
Conference Publishing Consulting

ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM 2018), January 8–9, 2018, Los Angeles, CA, USA

PEPM 2018 – Proceedings

Contents - Abstracts - Authors

ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM 2018)

Title Page
Article: poplws18pepmforeword-fm000-p doi:
Message from the Chairs
Article: poplws18pepmforeword-fm001-p doi:
Developments in Property-Based Testing (Invited Talk)
Jan Midtgaard
(University of Southern Denmark, Denmark)
Publisher's Version Article: poplws18pepmmain-inv1-p doi:10.1145/3168896
A Guess-and-Assume Approach to Loop Fusion for Program Verification
Akifumi Imanishi, Kohei Suenaga, and Atsushi Igarashi
(Kyoto University, Japan)
Publisher's Version Article: poplws18pepmmain-p13-p doi:10.1145/3162070
Gradually Typed Symbolic Expressions
David Broman and Jeremy G. Siek
(KTH, Sweden; Indiana University, USA)
Publisher's Version Article: poplws18pepmmain-p10-p doi:10.1145/3162068
On the Cost of Type-Tag Soundness
Ben Greenman and Zeina Migeed
(Northeastern University, USA)
Publisher's Version Article: poplws18pepmmain-p2-p doi:10.1145/3162066
Selective CPS Transformation for Shift and Reset
Kenichi Asai and Chihiro Uehara
(Ochanomizu University, Japan)
Publisher's Version Article: poplws18pepmmain-p11-p doi:10.1145/3162069
Checking Cryptographic API Usage with Composable Annotations (Short Paper)
Duncan Mitchell, L. Thomas van Binsbergen, Blake Loring, and Johannes Kinder
(Royal Holloway University of London, UK)
Publisher's Version Article: poplws18pepmmain-p16-p doi:10.1145/3162071
Program Generation for ML Modules (Short Paper)
Takahisa Watanabe and Yukiyoshi Kameyama
(University of Tsukuba, Japan)
Publisher's Version Article: poplws18pepmmain-p17-p doi:10.1145/3162072
Recursive Programs in Normal Form (Short Paper)
Barry Jay
(University of Technology Sydney, Australia)
Publisher's Version Article: poplws18pepmmain-p3-p doi:10.1145/3162067

proc time: 0.01