Locally nameless sigma calculus
Full text is not in this repository.
We present a Theory of Objects based on the original functional sigma-calculus by Abadi and Cardelli but with an additional parameter to methods. We prove confluence of the operational semantics following the outline of Nipkow's proof of confluence for the lambda-calculus reusing his theory Commutation, a generic diamond lemma reduction. We furthermore formalize a simple type system for our sigma-calculus including a proof of type safety. The entire development uses the concept of Locally Nameless representation for binders. We reuse an earlier proof of confluence for a simpler sigma-calculus based on de Bruijn indices and lists to represent objects.
|Research Areas:||A. > School of Science and Technology > Computer Science > Foundations of Computing group
A. > School of Science and Technology > Computer Science > Artificial Intelligence group
|Depositing User:||Dr Florian Kammueller|
|Date Deposited:||25 May 2012 14:08|
|Last Modified:||13 Oct 2016 14:24|
Actions (login required)