| Melham, T., A mechanized theory of the pi-calculus in HOL, Nordic Journal of Computing 1 (1995), pp. 50--76. 13 |
....a natural coding of the semantics relation, and avoid to have to consider ff conversion in proofs, that is to allow the manipulation of terms that will represent their whole ff equivalence class. A direct coding of names by a set with decidable equality, a solution used by T. Melham using HOL [6], implies a diOEcult denition of the substitution operation, even just for substituting names for names. x)Pfy=zg is simply dened for x = z and for x 6= z, y 6= x, but implies a renaming for x 6= z, y = x. In D. Hirschkooe [3] the coding uses de Bruijn indices, that is, replace bound names by ....
T.F. Melham. A mechanized theory of the pi-calculus in hol. Technical Report 244, University of Cambridge Computer Laboratory, 1992.
No context found.
Melham, T., A mechanized theory of the pi-calculus in HOL, Nordic Journal of Computing 1 (1995), pp. 50--76. 13
No context found.
Tom Melham. A mechanized theory of the picalculus in HOL. Nordic Journal of Computing, 1(1):50--76, 1995.
No context found.
Melham, T., A mechanized theory of the pi-calculus in HOL, Nordic Journal of Computing 1 (1995), pp. 50--76. 13
No context found.
T. F. Melham. A mechanized theory of the pi-calculus in HOL. Technical report, Departement d'informatique `a l' universit'e de Glasgow, Ecosse, 1992.
No context found.
T.F. Melham. A mechanized theory of the pi-calculus in HOL. Nordic Journal of Computing, 1(1):50-76, 1994.
No context found.
Tom Melham. A mechanized theory of the pi-calculus in HOL. Nordic Journal of Computing, 1(1):50--76, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC