Glasgow Haskell Compiler
9.2.4
  • 1. Introduction
  • 2. Release notes
  • 3. Using GHCi
  • 4. Using runghc
  • 5. Using GHC
  • 6. Language extensions
    • 6.1. Introduction
    • 6.2. Syntax
      • 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. Local Fixity Declarations
      • 6.2.17. More liberal syntax for function arguments
      • 6.2.18. Typed Holes
      • 6.2.19. Arrow notation
      • 6.2.20. Lexical negation
    • 6.3. Import and export
    • 6.4. Types
    • 6.5. Records
    • 6.6. Deriving mechanism
    • 6.7. Patterns
    • 6.8. Class and instances declarations
    • 6.9. Literals
    • 6.10. Constraints
    • 6.11. Type signatures
    • 6.12. Bindings and generalisation
    • 6.13. Template Haskell
    • 6.14. Bang patterns and Strict Haskell
    • 6.15. Parallel and Concurrent
    • 6.16. Unboxed types and primitive operations
    • 6.17. Foreign function interface (FFI)
    • 6.18. Safe Haskell
    • 6.19. Miscellaneous
    • 6.20. Pragmas
  • 7. Extending and using GHC as a Library
  • 8. Profiling
  • 9. Debugging compiled programs
  • 10. What to do when something goes wrong
  • 11. Hints
  • 12. Other Haskell utility programs
  • 13. Running GHC on Win32 systems
  • 14. Known bugs and infelicities
  • 15. Eventlog encodings
  • 16. Care and feeding of your GHC User’s Guide
Glasgow Haskell Compiler
  • Docs »
  • 6. Language extensions »
  • 6.2. Syntax
  • View page source

6.2. SyntaxΒΆ

  • 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. Local Fixity Declarations
  • 6.2.17. More liberal syntax for function arguments
  • 6.2.18. Typed Holes
  • 6.2.19. Arrow notation
  • 6.2.20. Lexical negation
Next Previous

© Copyright 2020, GHC Team

Built with Sphinx using a theme provided by Read the Docs.