default search action
PEPM 2017: Paris, France
- Ulrik Pagh Schultz, Jeremy Yallop:
Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2017, Paris, France, January 18-20, 2017. ACM 2017, ISBN 978-1-4503-4721-1
Invited Paper
- Daniil Berezun, Neil D. Jones:
Compiling untyped lambda calculus to lower-level code by game semantics and partial evaluation (invited paper). 1-11
Programming Languages
- Tsubasa Matsushita, Isao Sasano:
Detecting code clones with gaps by function applications. 12-22 - Alejandro Serrano, Jurriaan Hage:
Lightweight soundness for towers of language extensions. 23-34 - Fritz Henglein, Ulrik Terp Rasmussen:
PEG parsing in less space using progressive tabling and dynamic analysis. 35-46
Transformation
- Krishna Narasimhan, Christoph Reichenbach, Julia Lawall:
Interactive data representation migration: exploiting program dependence to aid program transformation. 47-58 - Takashi Suwa, Takeshi Tsukada, Naoki Kobayashi, Atsushi Igarashi:
Verification of code generators via higher-order model checking. 59-70 - Kazutaka Matsuda, Kazuyuki Asada:
A functional reformulation of UnCAL graph-transformations: or, graph transformation as graph reduction. 71-82 - Tiark Rompf, Kevin J. Brown:
Functional parallels of sequential imperatives (short paper). 83-88
Types
- Levin Fritz, Jurriaan Hage:
Cost versus precision for approximate typing for Python. 89-98 - Markus Klinik, Jurriaan Hage, Jan Martin Jansen, Rinus Plasmeijer:
Predicting resource consumption of higher-order workflows. 99-110 - Ivo Gabe de Wolff, Jurriaan Hage:
Refining types using type guards in TypeScript. 111-122
Poster
- Tatsuya Katsushima, Oleg Kiselyov:
Language-integrated query with ordering, grouping and outer joins (poster paper). 123-124
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.