Re: [GHC] #11222: Teach strictness analysis about `catch`-like operations

#11222: Teach strictness analysis about `catch`-like operations -------------------------------------+------------------------------------- Reporter: bgamari | Owner: dfeuer Type: feature request | Status: new Priority: normal | Milestone: 8.6.1 Component: Compiler | Version: 7.10.3 Resolution: | Keywords: Exceptions Operating System: Unknown/Multiple | Architecture: Type of failure: Runtime | Unknown/Multiple performance bug | Test Case: Blocked By: | Blocking: Related Tickets: | Differential Rev(s): Wiki Page: | -------------------------------------+------------------------------------- Comment (by Ben Gamari ): In [changeset:"00b8ecb78624511a045120673b01fafe5794ecdc/ghc" 00b8ecb7/ghc]: {{{ #!CommitTicketReference repository="ghc" revision="00b8ecb78624511a045120673b01fafe5794ecdc" Declare `catchRetry#` lazy in its first argument As per the results on item 1 in T14998, declaring `catchRetry#` lazy in its first argument opens the possibility to remove `ExnStr` complexity from strictness demands at virtually no regressions in NoFib. This brings `catchRetry#` in line with other primops from the `catch*` family. Reviewers: bgamari, simonpj, nomeata Reviewed By: bgamari Subscribers: thomie, carter GHC Trac Issues: #14998, #11222 Differential Revision: https://phabricator.haskell.org/D4573 }}} -- Ticket URL: http://ghc.haskell.org/trac/ghc/ticket/11222#comment:10 GHC http://www.haskell.org/ghc/ The Glasgow Haskell Compiler