Download the complete article:

@inproceedings{paolini06fossacs,
  volume = {3921},
  issn = {0302-9743},
  author = {Paolini, Luca and Pimentel, Elaine and Ronchi Della Rocca, Simona},
  series = {Lecture Notes in Computer Science},
  booktitle = {Proceedings of 9th International Conference on Foundations of
               Software Science and Computation Structures -- FOSSACS 2006, Held
               as Part of the European Joint Conferences on Theory and Practice
               of Software 2006},
  editor = {Luca Aceto and Anna Ing{\'o}lfsd{\'o}ttir},
  exaddress = {Vienna, Austria},
  tag = {FOSSACS 2006},
  abstract = {The paper introduces the $\Phi$-calculus, a new call-by-value
              version of $\lambda$-calculus, following the spirit of Plotkin's
              $\lambda\beta_{v}$-calculus. Such a language satisfies some
              properties, in particular the set of solvable terms in it
              coincides with the set of $\beta$-strongly normalizing terms in
              the classical $\lambda$-calculus.},
  localfile = {http://www.di.unito.it/~paolini/papers/bsn.pdf},
  isbn = {3-540-33045-3},
  title = {An Operational Characterization of Strong Normalization},
  publisher = {Springer, Germany},
  pages = {367-381},
  year = 2006,
}

This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)