Dr Noam Zeilberger

School of Computer Science
Birmingham Fellow

Contact details

Address
School of Computer Science
University of Birmingham
Edgbaston
Birmingham
B15 2TT
UK

Noam Zeilberger is a Birmingham Fellow in the School of Computer Science. He is interested broadly in connections between logic, language, computation. More specifically, in his research he strives to identify and understand the basic mathematical structures underlying the design, implementation, and analysis of programming languages, using tools such as category theory and proof theory. More generally, he is interested in how all this fits within the broader world of mathematics and computer science.

For more information, please see Noam's Computer Science profile.

Qualifications

  • PhD in Computer Science, Carnegie Mellon University, 2009

Teaching

  • Advanced Topics in Functional Programming

Publications

Recent publications

Article

Zeilberger, N 2019, 'A sequent calculus for a semi-associative law', Logical Methods in Computer Science.

Uustalu, T, Veltri, N & Zeilberger, N 2018, 'The sequent calculus of skew monoidal categories', Electronic Notes in Theoretical Computer Science, vol. 341, pp. 345-370. https://doi.org/10.1016/j.entcs.2018.11.017

Melliès , P-A & Zeilberger, N 2018, 'An Isbell Duality Theorem for Type Refinement Systems', Mathematical Structures in Computer Science, vol. 28, no. 6, pp. 736-774. https://doi.org/10.1017/S0960129517000068

Zeilberger, N 2016, 'Linear lambda terms as invariants of rooted trivalent maps', Journal of Functional Programming, vol. 26, e21. https://doi.org/10.1017/S095679681600023X

Zeilberger, N & Giorgetti, A 2015, 'A correspondence between rooted planar maps and normal planar lambda terms', Logical Methods in Computer Science, vol. 11, no. 3, pp. 1-39. https://doi.org/10.2168/LMCS-11(3:22)2015

Melliès, P-A & Zeilberger, N 2015, 'Functors are Type Refinement Systems', ACM SIGPLAN Notices, vol. 50, no. 1, pp. 3-16. https://doi.org/10.1145/2775051.2676970

Conference contribution

Zeilberger, N 2018, A theory of linear typings as flows on 3-valent graphs. in LICS '18 Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. Association for Computing Machinery (ACM), New York, NY, USA, pp. 919-928, Thirty-Third Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Oxford, United Kingdom, 9/07/18. https://doi.org/10.1145/3209108.3209121

Zeilberger, N 2017, A sequent calculus for a semi-associative law. in D Miller (ed.), Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017). vol. 84, 33, Leibniz International Proceedings in Informatics (LIPIcs), vol. 84, Schloss Dagstuhl, pp. 33:1-33:16. https://doi.org/10.4230/LIPIcs.FSCD.2017.33

Melliès, P-A & Zeilberger, N 2016, A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine. in Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS '16). Association for Computing Machinery (ACM), New York, NY, pp. 555-564. https://doi.org/10.1145/2933575.2934525

View all publications in research portal