Powered by
2019 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM 2019), January 14–15, 2019,
Cascais, Portugal
2019 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM 2019)
Frontmatter
Title Page
Article: poplws19pepmforeword-fm000-p doi:
Papers
A Simpler Lambda Calculus
Barry Jay
(University of Technology Sydney, Australia)
@InProceedings{PEPM19p1,
author = {Barry Jay},
title = {A Simpler Lambda Calculus},
booktitle = {Proc.\ PEPM},
publisher = {ACM},
pages = {1-0},
doi = {10.1145/3294032.3294085},
year = {2019},
}
Publisher's Version
Article: poplws19pepmmain-p64-p doi:10.1145/3294032.3294085
Method Name Suggestion with Hierarchical Attention Networks
Sihan Xu,
Sen Zhang,
Weijing Wang,
Xinya Cao,
Chenkai Guo, and
Jing Xu
(Nankai University, China)
@InProceedings{PEPM19p18,
author = {Sihan Xu and Sen Zhang and Weijing Wang and Xinya Cao and Chenkai Guo and Jing Xu},
title = {Method Name Suggestion with Hierarchical Attention Networks},
booktitle = {Proc.\ PEPM},
publisher = {ACM},
pages = {18-17},
doi = {10.1145/3294032.3294079},
year = {2019},
}
Publisher's Version
Article: poplws19pepmmain-p8-p doi:10.1145/3294032.3294079
Reduction from Branching-Time Property Verification of Higher-Order Programs to HFL Validity Checking
Keiichi Watanabe,
Takeshi Tsukada,
Hiroki Oshikawa, and
Naoki Kobayashi
(University of Tokyo, Japan)
@InProceedings{PEPM19p35,
author = {Keiichi Watanabe and Takeshi Tsukada and Hiroki Oshikawa and Naoki Kobayashi},
title = {Reduction from Branching-Time Property Verification of Higher-Order Programs to HFL Validity Checking},
booktitle = {Proc.\ PEPM},
publisher = {ACM},
pages = {35-34},
doi = {10.1145/3294032.3294077},
year = {2019},
}
Publisher's Version
Article: poplws19pepmmain-p2-p doi:10.1145/3294032.3294077
Typed Parsing and Unparsing for Untyped Regular Expression Engines
Gabriel Radanne
(University of Freiburg, Germany)
@InProceedings{PEPM19p52,
author = {Gabriel Radanne},
title = {Typed Parsing and Unparsing for Untyped Regular Expression Engines},
booktitle = {Proc.\ PEPM},
publisher = {ACM},
pages = {52-51},
doi = {10.1145/3294032.3294082},
year = {2019},
}
Publisher's Version
Article: poplws19pepmmain-p30-p doi:10.1145/3294032.3294082
Combining Higher-Order Model Checking with Refinement Type Inference
Ryosuke Sato,
Naoki Iwayama, and
Naoki Kobayashi
(Kyushu University, Japan; University of Tokyo, Japan)
@InProceedings{PEPM19p69,
author = {Ryosuke Sato and Naoki Iwayama and Naoki Kobayashi},
title = {Combining Higher-Order Model Checking with Refinement Type Inference},
booktitle = {Proc.\ PEPM},
publisher = {ACM},
pages = {69-68},
doi = {10.1145/3294032.3294081},
year = {2019},
}
Publisher's Version
Article: poplws19pepmmain-p13-p doi:10.1145/3294032.3294081
Futures and Promises in Haskell and Scala
Tamino Dauth and
Martin Sulzmann
(Karlsruhe University of Applied Sciences, Germany)
@InProceedings{PEPM19p99,
author = {Tamino Dauth and Martin Sulzmann},
title = {Futures and Promises in Haskell and Scala},
booktitle = {Proc.\ PEPM},
publisher = {ACM},
pages = {99-98},
doi = {10.1145/3294032.3294080},
year = {2019},
}
Publisher's Version
Article: poplws19pepmmain-p9-p doi:10.1145/3294032.3294080
Generating Mutually Recursive Definitions
Jeremy Yallop and
Oleg Kiselyov
(University of Cambridge, UK; Tohoku University, Japan)
@InProceedings{PEPM19p109,
author = {Jeremy Yallop and Oleg Kiselyov},
title = {Generating Mutually Recursive Definitions},
booktitle = {Proc.\ PEPM},
publisher = {ACM},
pages = {109-108},
doi = {10.1145/3294032.3294078},
year = {2019},
}
Publisher's Version
Article: poplws19pepmmain-p5-p doi:10.1145/3294032.3294078
proc time: 0.02