Abstract
AbstractWe re-express Hudak and Young's higher-order strictness analysis for the untyped λ-calculus in a conceptually simpler and more semantically-based manner. We show our analysis to be a sound abstraction of Hudak and Young's which is also complete in a sense we make precise.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have