School of Computing

Publications by Dr Reuben Rowe

Also view these in the Kent Academic Repository

Rowe, R. and van Bakel, S. (2014). Semantic Types and Approximation for Featherweight Java. Theoretical Computer Science [Online] 517:34-74. Available at:
Conference or workshop item
Cheung, S. et al. (2018). A functional perspective on machine learning via programmable induction and abduction. in: Fourteenth International Symposium on Functional and Logic Programming (FLOPS 2018). Switzerland: Springer. Available at:
Cohen, L. and Rowe, R. (2018). Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent. in: 27th EACSL Annual Conference on Computer Science Logic, CSL 2018. LIPICS. Available at:
Rowe, R. and Brotherston, J. (2017). Realizability in Cyclic Proof: Extracting Ordering Information for Infinite Descent. in: TABLEAUX 2017: International Conference on Automated Reasoning with Analytic Tableaux and Related Methods. Springer, pp. 295-310. Available at:
Rowe, R. and Brotherston, J. (2017). Automatic cyclic termination proofs for recursive procedures in separation logic. in: 6th ACM SIGPLAN Conference on Certified Programs and Proofs. ACM, pp. 53-65. Available at:
Brotherston, J. et al. (2016). Model checking for symbolic-heap separation logic with inductive predicates. in: 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. POPL '16. New York, NY, USA: ACM, pp. 84-96. Available at:
Rowe, R. (2015). Encoding the Factorisation Calculus. in: EXPRESS/SOS 2015. pp. 76-90. Available at:
Rowe, R. and Van Bakel, S. (2011). Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming. in: 10th International Conerence on Typed Lambda Calculi and Applications. Springer, pp. 229-244. Available at:
Cohen, L. and Rowe, R. (2018). Infinitary and Cyclic Proof Systems for Transitive Closure Logic. University of Kent.
Total publications in KAR: 9 [See all in KAR]

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2019