Publicação
The call-by-value $\lambda$-calculus, the SECD machine, and the $\pi$-calculus
| dc.contributor.author | Vasconcelos, Vasco T. | por |
| dc.date.accessioned | 2009-02-10T13:11:55Z | por |
| dc.date.accessioned | 2014-11-14T16:23:48Z | |
| dc.date.available | 2009-02-10T13:11:55Z | por |
| dc.date.available | 2014-11-14T16:23:48Z | |
| dc.date.issued | 2000-05 | por |
| dc.description.abstract | We present an encoding of the call-by-value $\lambda$-calculus into the $\pi$-calculus, alternative to the well-known Milner's encodings. We show that our encoding is barbed congruent (under typed contexts) to Milner's "light" encoding, and that it takes two $\pi$-steps to mimic a beta-reduction for normalizing terms. We describe a translation of Plotkin's SECD machine into the $\pi$-calculus, and show that there is an operational correspondence between a SECD machine and its encoding. Equipped with a notion of a state-based machine and two kinds of correspondences between them, we compare the encodings of the call-by-value $\lambda$-calculus and the SECD machine into the $\pi$-calculus | por |
| dc.identifier.uri | http://hdl.handle.net/10451/14097 | por |
| dc.identifier.uri | http://repositorio.ul.pt/handle/10455/2995 | por |
| dc.language.iso | por | por |
| dc.publisher | Department of Informatics, University of Lisbon | por |
| dc.relation.ispartofseries | di-fcul-tr-00-3 | por |
| dc.title | The call-by-value $\lambda$-calculus, the SECD machine, and the $\pi$-calculus | por |
| dc.type | report | |
| dspace.entity.type | Publication | |
| rcaap.rights | openAccess | por |
| rcaap.type | report | por |
Ficheiros
Principais
1 - 1 de 1