• DOI:10.1016/J.ENTCS.2005.06.013
Corpus ID: 2077910

Lazy Strong Normalization

@article{Paolini2005LazySN,
  title={Lazy Strong Normalization},
  author={Luca Paolini and E. Pimentel and S. Rocca},
  journal={Electron. Notes Theor. Comput. Sci.},
  year={2005},
  volume={136},
  pages={103-116}
}

• Luca Paolini, E. Pimentel, S. Rocca
• Published 2005
• Computer Science, Mathematics
• Electron. Notes Theor. Comput. Sci.

Among all the reduction strategies for the untyped @l-calculus, the so called lazy @b-evaluation is of particular interest due to its large applicability to functional programming languages (e.g. Haskell [Bird, R., ''Introduction to Functional Programming using Haskell,'' Series in Computer Science (2nd edition), Prentice Hall, (1998)]). This strategy reduces only redexes not inside a lambda abstraction. The lazy strongly @b- normalizing terms are the @l-terms that don't have infinite lazy @b… Expand

View via Publisher

doi.org

Save to Library

Create Alert

Cite

Launch Research Feed