Technical reports
Untyped strictness analysis
Christine Ernoult, Alan Mycroft
October 1992, 13 pages
DOI: 10.48456/tr-267
Abstract
We 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 whichis also complete in a sense we make precise.
Full text
PDF (0.9 MB)
BibTeX record
@TechReport{UCAM-CL-TR-267, author = {Ernoult, Christine and Mycroft, Alan}, title = {{Untyped strictness analysis}}, year = 1992, month = oct, url = {https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-267.pdf}, institution = {University of Cambridge, Computer Laboratory}, doi = {10.48456/tr-267}, number = {UCAM-CL-TR-267} }