A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We define a new, output-based encoding of the λ-calculus into the asynchronous π-calculus -enriched with pairing -that has its origin in mathematical logic, and show that this encoding respects one-step spine-reduction up to substitution, and that normal substitution is respected up to similarity. We will also show that it fully encodes lazy reduction of closed terms, in that term-substitution as well as each reduction step are modelled up to similarity. We then define a notion of typedoi:10.1007/978-3-642-04081-8_7 fatcat:tav3tb74mzdvnaejf4uu5bs5gq