Locally nameless sigma calculus
Full text is not in this repository.
Official URL: http://afp.sourceforge.net/entries/Locally-Nameles...
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:||Middlesex University Schools and Centres > School of Science and Technology > Computer Science|
Middlesex University Schools and Centres > School of Science and Technology > Computer Science > Foundations of Computing group
Middlesex University Schools and Centres > School of Science and Technology > Computer Science > Artificial Intelligence group
|Deposited On:||25 May 2012 14:08|
|Last Modified:||28 Oct 2014 17:58|
Repository staff only: item control page
Full text downloads (NB count will be zero if no full text documents are attached to the record)
Downloads per month over the past year