It appears that at least one compiler will have the option to produce a tags output from a set of Haskell files. Seeing as I'm 1/1 with questions at the moment, I thought I'd enlarge the request :- Is any work being done on a standard abstract syntax for Haskell? Something like DIANA for Ada or whatever they call the system used in Modula III. If compilers could output this tree, then tools such as pretty printers, tags generators ... etc. could be separated from the compiler. If there is no consensus on what the correct AST should be, then are there plans to include implementation dependent dumpable ASTs in the compilers currently being developed? Stephen J. Bevan [EMAIL PROTECTED]
