Organizing the Proposals
This page groups the various proposals for Haskell' into four distinct categories. For each category we provide a brief descriptions and two lists: the first contains the proposals from the definitely in table, while the second one contains the proposals from the probably in table.
These proposals primarily addresses issues of lexing and parsing. Of particular importance are questions of ambiguity and understandability.
- #53 Non-decreasing indentation
- #39 Lexical syntax of qualified identifiers
- #72 Make _ caseless
- #30 Remove operator fixity from the context-free grammar
These proposals provide a more convenient way to do something that we can already do (but perhaps in a "clunky" way). Of particular interest are questions about usability and readability.
- #70 Type synonym instances
- #51 New pragmas
- #76 Bang patterns
- #52 Generalized deriving for newtype
- #21 Improve defaulting rules
- #84 Kind annotations
- #103 Monomorphic pattern bindings
- #67, #68 Scoped typed variables
These proposals are related to the type system and how the type checker works. They affect the static semantics of programs in fairly deep ways.
- #60 Higher-rank polymorphism (RankNTypes,Rank2Types,PolymorphicComponents
- #26 Existential quantification in datatypes
- #49 Multi-parameter type classes (see also MultiParamTypeClassesDilemma)
These proposals provide sets of constants with specified operational behavior. They affect the dynamic semantics of programs in fairly deep ways.