- 6.2.1. Unicode syntax
- 6.2.2. The magic hash
- 6.2.3. The recursive do-notation
- 6.2.4. Applicative do-notation
- 6.2.5. Qualified do-notation
- 6.2.6. Parallel List Comprehensions
- 6.2.7. Generalised (SQL-like) List Comprehensions
- 6.2.8. Monad comprehensions
- 6.2.9. Overloaded lists
- 6.2.10. Rebindable syntax and the implicit Prelude import
- 6.2.11. Postfix operators
- 6.2.12. Tuple sections
- 6.2.13. Lambda-case
- 6.2.14. Empty case alternatives
- 6.2.15. Multi-way if-expressions
- 6.2.16. Do And If Then Else
- 6.2.17. Local Fixity Declarations
- 6.2.18. More liberal syntax for function arguments
- 6.2.19. Typed Holes
- 6.2.20. Arrow notation
- 6.2.21. Lexical negation
6.2. Syntax
© 2002–2007 The University Court of the University of Glasgow. All rights reserved.
Licensed under the Glasgow Haskell Compiler License.
https://downloads.haskell.org/~ghc/9.14.1/docs/users_guide/exts/syntax.html
