Title: A relational approach to strictness analysis for higher-order polymorphic functions
Abstract: Article Free Access Share on A relational approach to strictness analysis for higher-order polymorphic functions Authors: Samson Abramsky Dept. of Computing, Imperial College, 180, Queen's Gate, London SW7 2BZ, U.K. Dept. of Computing, Imperial College, 180, Queen's Gate, London SW7 2BZ, U.K.View Profile , Thomas P. Jensen Dept. of Computing, Imperial College, 180, Queen's Gate, London SW7 2BZ, U.K. Dept. of Computing, Imperial College, 180, Queen's Gate, London SW7 2BZ, U.K.View Profile Authors Info & Claims POPL '91: Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languagesJanuary 1991 Pages 49–54https://doi.org/10.1145/99583.99593Online:03 January 1991Publication History 15citation237DownloadsMetricsTotal Citations15Total Downloads237Last 12 Months8Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF