In informal mathematical usage we often reason using languages with binding. We usually find ourselves placing capture-avoidance constraints on where variables can and cannot occur free. We describe a logical derivation system which allows a direct formalisation of such assertions, along with a direct formalisation of their constraints. We base our logic on equality, probably the simplest available judgement form. In spite of this, we can axiomatise systems of logic and computation such as first-order logic or the lambda-calculus in a very direct and natural way. We investigate the theory of derivations, prove a suitable semantics sound and complete, and discuss existing and future research.
|Name||Lecture Notes in Computer Science|
|Conference||conference; WoLLIC 2007, Rio de Janeiro, Brasil; 2007-07-02; 2007-07-05|
|Period||2/07/07 → 5/07/07|
|Other||WoLLIC 2007, Rio de Janeiro, Brasil|