Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming

Rowe, Reuben, 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. 6690. pp. 229-244. Springer ISBN 978-3-642-21690-9. (doi:10.1007/978-3-642-21691-6_19)

PDF - Author's Accepted Manuscript
 Preview
Official URL
https://doi.org/10.1007/978-3-642-21691-6_19

Abstract

We consider a semantics for a class-based object-oriented calculus based upon approximation; since in the context of LC such a semantics enjoys a strong correspondence with intersection type assignment systems, we also define such a system for our calculus and show that it is sound and complete. We establish the link with between type (we use the terminology predicate here) assignment and the approximation semantics by showing an approximation result, which leads to a sufficient condition for head-normalisation and termination. We show the expressivity of our predicate system by defining an encoding of Combinatory Logic (and so also LC) into our calculus. We show that this encoding preserves predicate-ability and also that our system characterises the normalising and strongly normalising terms for this encoding, demonstrating that the great analytic capabilities of these predicates can be applied to OO.

Item Type: Conference or workshop item (Proceeding) 10.1007/978-3-642-21691-6_19 Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,Q Science > QA Mathematics (inc Computing science) > QA 9 Formal systems, logics Faculties > Sciences > School of ComputingFaculties > Sciences > School of Computing > Programming Languages and Systems Group Reuben Rowe 17 Jan 2018 11:57 UTC 29 May 2019 20:11 UTC https://kar.kent.ac.uk/id/eprint/65744 (The current URI for this page, for reference purposes) https://orcid.org/0000-0002-4271-9078
• Depositors only (login required):