In this paper, we generalise the notion of explicit substitution from the-calculus to higher order rewriting, realised by combinatory reduction systems (CRSs). For every connuent CRS, R, we constructâ€¦ (More)

Reduction and Topology, p. 28. Non Interleaving Process Algebra, p. 17. Design and AnaJysis of Dynamic Leader Election Protocols in Broadcast Networks, p. 73. A generaJ conservative extension theoremâ€¦ (More)

Typed d-calculus uses two abstraction symbols (A and IT) which are usually treated in different ways: &*.x has as type the abstraction l7, * .*, yet IT, *. * has type 0 rather than an abstraction;â€¦ (More)

We investigate the formulation of a formal semantics for the industrial software architecture Splice. In this paper, we prese nt a set of basic Splice interaction primitives that is both powerful aâ€¦ (More)

This paper recounts the origins of the Î»x family of calculi of explicit substitution with proper variable names, including the original result of preservation of strong Î²-normalization based on theâ€¦ (More)

Typed-calculus uses two abstraction symbols (and) which are usually treated in diierent ways: x: :x has as type the abstraction x: : yet x: : has type 2 rather than an abstraction; moreover, (x:Aâ€¦ (More)

In this paper, we propose to extend the Barendregt Cube by generalising -reduction and by adding de nition mechanisms. Generalised reduction allows contracting more visible redexes than usual, and deâ€¦ (More)

In this paper, a notation influenced by de Bruijnâ€™s syntax of the Î»-calculus is used to describe canonical forms of terms and an equivalence relation which divides terms into classes according toâ€¦ (More)