Browse by Person (creator, editor, contributor, etc.)
 | Up a level |
Jump to: Article | Conference or workshop item
Number of items: 9.
Article
| Cohen, Liron and Rowe, Reuben and Zohar, Yoni (2019) Towards Automated Reasoning in Herbrand Structures. Journal of Logic and Computation, . ISSN 0955-792X. (In press) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided) |
![[img]](https://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)
|
Conference or workshop item
| Rowe, Reuben and Férée, Hugo and Thompson, Simon and Owens, Scott (2019) Characterising Renaming within OCaml’s Module System: Theory and Implementation. In: PLDI '19: ACM SIGPLAN Conference on Programming Language Design and Implementation Proceedings. (In press) (doi:https://doi.org/10.1145/3314221.3314600) (Full text available) |
|
| Cheung, Steven and Darvariu, Victor and Ghica, Dan R. and Muroya, Koko and Rowe, Reuben (2018) A functional perspective on machine learning via programmable induction and abduction. In: Lecture Notes in Artificial Intelligence. Proceedings of the Fourteenth International Symposium on Functional and Logic Programming (FLOPS 2018) 9-11 May, 2018, Nagoya, Japan. Lecture Notes in Computer Science. Springer, Switzerland ISBN 978-3-319-90686-7. (doi:https://doi.org/10.1007/978-3-319-90686-7_6) (Full text available) |
|
| Cohen, Liron and Rowe, Reuben (2018) Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent. In: Leibniz International Proceedings in Informatics. Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, CSL 2018. LIPICS (doi:https://doi.org/10.4230/LIPIcs.CSL.2018.16) (Full text available) |
|
| Rowe, Reuben and Brotherston, James (2017) Realizability in Cyclic Proof: Extracting Ordering Information for Infinite Descent. In: Lecture Notes in Computer Science. Automated Reasoning with Analytic Tableaux and Related Methods: 26th International Conference, TABLEAUX 2017. Lecture Notes in Computer Science, 10501. Springer pp. 295-310. ISBN 978-3-319-66901-4. E-ISBN 978-3-319-66902-1. (doi:https://doi.org/10.1007/978-3-319-66902-1_18) (Full text available) |
|
| Rowe, Reuben and Brotherston, James (2017) Automatic cyclic termination proofs for recursive procedures in separation logic. In: Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs. ACM pp. 53-65. ISBN 978-1-4503-4705-1. (doi:https://doi.org/10.1145/3018610.3018623) (Full text available) |
|
| Brotherston, James and Gorogiannis, Nikos and Kanovich, Max and Rowe, Reuben (2016) Model checking for symbolic-heap separation logic with inductive predicates. In: ACM. POPL '16 Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, NY, USA pp. 84-96. ISBN 978-1-4503-3549-2. (doi:https://doi.org/10.1145/2914770.2837621) (Full text available) |
|
| Rowe, Reuben (2015) Encoding the Factorisation Calculus. In: Electronic Proceedings in Theoretical Computer Science. Proceedings of the Combined 22th International Workshop on Expressiveness in Concurrency and 12th Workshop on Structural Operational Semantics. pp. 76-90. (doi:https://doi.org/10.4204/EPTCS.190.6) (Full text available) |
|
| Rowe, Reuben and Van Bakel, Steffen (2011) Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming. In: Lecture Notes in Computer Science. Typed Lambda Calculi and Applications. Springer pp. 229-244. ISBN 978-3-642-21690-9. (doi:https://doi.org/10.1007/978-3-642-21691-6_19) (Full text available) |
|
