基本信息
浏览量:135
职业迁徙
个人简介
My research is in programming language theory, and I'm also interested in logic and category theory. I've recently been especially interested in two kinds of programming language:
Probabilistic programming languages: This is broadly to do with specifying and understanding statistical models using programming languages. I was recently awarded an ERC Consolidator grant in this area, and we recently won a Facebook research award too. My paper in ESOP 2017 introduced the idea of using s-finite kernels as a simple compositional formalism allowing both sampling and observations. In LICS 2017 we introduced quasi-Borel spaces: a new setting for higher order probability theory; this is then used to validate some inference algorithms in POPL 2018 and extended to recursion in POPL 2019. Our PPS 2017 abstract is about the relationship between exchangeability and program modules; we followed this up with an analysis of the Beta-Bernoulli process in ICALP 2018.
Quantum computing and programming languages: Most recently, Mathieu Huot and I found a neat universal property for quantum theory (LICS 2019, QPL 2018) based on my theory of quantum programs (POPL 2015). I've also been working on contextuality and non-locality with Sander Uijlen (see our ICALP 2015 paper), and on quantum programming languages with Mathys Rennela (see our MFPS 2017/LMCS and 2015 papers and our QPL 2016 paper). My research in this area has been supported by my grant 'Quantum Computation as a Programming Language' (EP/N007387/1).
Probabilistic programming languages: This is broadly to do with specifying and understanding statistical models using programming languages. I was recently awarded an ERC Consolidator grant in this area, and we recently won a Facebook research award too. My paper in ESOP 2017 introduced the idea of using s-finite kernels as a simple compositional formalism allowing both sampling and observations. In LICS 2017 we introduced quasi-Borel spaces: a new setting for higher order probability theory; this is then used to validate some inference algorithms in POPL 2018 and extended to recursion in POPL 2019. Our PPS 2017 abstract is about the relationship between exchangeability and program modules; we followed this up with an analysis of the Beta-Bernoulli process in ICALP 2018.
Quantum computing and programming languages: Most recently, Mathieu Huot and I found a neat universal property for quantum theory (LICS 2019, QPL 2018) based on my theory of quantum programs (POPL 2015). I've also been working on contextuality and non-locality with Sander Uijlen (see our ICALP 2015 paper), and on quantum programming languages with Mathys Rennela (see our MFPS 2017/LMCS and 2015 papers and our QPL 2016 paper). My research in this area has been supported by my grant 'Quantum Computation as a Programming Language' (EP/N007387/1).
研究兴趣
论文共 67 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
CoRR (2024)
引用0浏览0EI引用
0
0
Journal of the ACMno. 1 (2023): 2:1-2:53
CoRR (2023)
引用0浏览0EI引用
0
0
arXiv (Cornell University) (2023)
引用0浏览0引用
0
0
Nathanael L. Ackerman,Cameron E. Freer, Younesse Kaddar,Jacek Karwowski, Sean K. Moss,Daniel M. Roy,Sam Staton,Hongseok Yang
Proceedings of the ACM on Programming Languagesno. POPL (2023): 1819-1849
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE (2023): 400-414
Proc. ACM Program. Lang.no. POPL (2023): 121-153
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn