Results 1 
4 of
4
A FirstOrder Syntax for the piCalculus in Isabelle/HOL using Permutations
"... . A formalized theory of alphaconversion for the #calculus in ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. A formalized theory of alphaconversion for the #calculus in
Mechanizing the Theory of Contexts
"... Abstract. Higherorder abstract syntax is a natural way to formalize programming languages with binders, like the sscalculus, because ffconversion, instantiations and capture avoidance are delegated to the metalevel of the provers, making tedious substitutions superfluous. However, such formalizat ..."
Abstract
 Add to MetaCart
Abstract. Higherorder abstract syntax is a natural way to formalize programming languages with binders, like the sscalculus, because ffconversion, instantiations and capture avoidance are delegated to the metalevel of the provers, making tedious substitutions superfluous. However, such formalizations usually lack structural induction, which makes syntaxanalysis impossible. Moreover, when applied in logical frameworks with objectlogics, like Isabelle/HOL or standard extensions of Coq, exotic terms can be defined, for which important syntactic properties become invalid. The paper presents a formalization of the sscalculus in Isabelle/HOL, using wellformedness predicates which both eliminate exotic terms and yield structural induction. These inductionprinciples are then used to derive the Theory of Contexts fully within the mechanization. 1 Motivation The sscalculus was introduced to model and analyse mobile systems [18,17]. In it, communication channels and messages belong to the same sort, called names. This simplicity gives the sscalculus the power to encode the *calculus [16], as well as higherorder objectoriented and imperative languages [27,26]. Communications are synchronous, that is, a sender _ab:P transmits a message b to a recipient ax:Q, in a transition _ab:P j ax:Q o / \Gamma! P j Qfb=xg. Usually, a substitution is applied to describe that b replaces x in Q. This can be tedious for processes with binders, like Q = (*b)Q0, where a further substitution is necessary to avoid namecapture: Qfb=xg =ff (*b0)Q0fb0=b; b=xg. Higherorder abstract syntax builds upon a functional view, considering binders as abstractions with respect to an underlying *calculus to which the replacement of names and captureavoidance are delegated. The above transition could thus be rewritten as _ab:P j ax:fQ(x) o / \Gamma! P j fQ(b), where the function fQ(x) = (*b)fQ0(b; x) corresponds to the process Q, and the process fQ(b) represents Qfb=xg.
The First Twenty Five Years and Beyond
, 909
"... Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Notes Series publications. Copies may be obtained by contacting: BRICS ..."
Abstract
 Add to MetaCart
(Show Context)
Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Notes Series publications. Copies may be obtained by contacting: BRICS