#5744: List layouts
---------------------------------+------------------------------------------
Reporter: nsch | Owner: nsch
Type: feature request | Status: new
Priority: normal | Milestone:
Component: Compiler | Version: 7.2.1
Keywords: | Os: Unknown/Multiple
Architecture: Unknown/Multiple | Failure: None/Unknown
Difficulty: Unknown | Testcase:
Blockedby: | Blocking:
Related: |
---------------------------------+------------------------------------------
Comment(by nsch):
Replying to [comment:4 simonpj]:
> I'm afraid I don't understand this feature. Could you write a Wiki page
that gives the specification?
I have added the ExtendedLayouts page. Please tell me if anything is
unclear or not understandable.
> Maybe I'm wrong, but it has the smell of being closely related to the
work of George and friends on monad comprehensions; see
[wiki:MonadComprehensions]. In paricular their as-yet-unimplemented
proposal to overload list literals; Section 5.2 of their paper
[[http://db.inf.uni-tuebingen.de/files/giorgidze/haskell2011.pdf "Bringing
back monad comprehensions"]] at the 2011 Haskell Symposium. I'm adding
George and Jeroen in cc.
It would be pretty much the exact opposit of said proposal. It would make
it possible to write lists (as a monoid) without the actual list notation
`[ , ]`. I hope the wiki page makes that clear.
Btw, I'm the guy who did most of the monad comprehension coding, so I'm
well familiar with that extension. :)
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/5744#comment:8>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler
_______________________________________________
Glasgow-haskell-bugs mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
