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}
}
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
10 Citations
Open Call-by-Value (Extended Version)
  • 2
  • Highly Influenced
  • PDF
Open Call-by-Value
  • 29
  • PDF
Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus
  • 15
  • PDF
Call-by-Value Solvability, Revisited
  • 33
  • PDF
Programming Languages and Systems
  • 2
  • Highly Influenced
  • PDF
An Operational Characterization of Strong Normalization
  • 6
  • PDF
Strong normalization from an unusual point of view
  • 4
  • PDF
Calculi, types and applications

References

SHOWING 1-10 OF 18 REFERENCES
Call-by-Name, Call-by-Value and the lambda-Calculus
  • G. Plotkin
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1975
  • 1,061
  • Highly Influential
  • PDF
Intersection Type Assignment Systems
  • S. V. Bakel
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1995
  • 127
  • PDF
Parametric parameter passing Lambda-calculus
  • 18
  • PDF
Introduction to functional programming
  • R. Bird, P. Wadler
  • Computer Science
  • Prentice Hall International series in computer science
  • 1988
  • 988
Call-by-value Solvability
  • 48
  • PDF
The lambda calculus - its syntax and semantics
  • H. Barendregt
  • Mathematics, Computer Science
  • Studies in logic and the foundations of mathematics
  • 1985
  • 3,691
Constructing Induction Rules for Deductive Synthesis Proofs
  • 2,812
  • PDF
The Parametric λ-calculus: a meta-model for computation”, Computer Science-Monograph, Springer Verlag, to appear. L
  • Paolini et al. / Electronic Notes in Theoretical Computer Science
  • 2005
...
1
2
...