{5} Assigned, Active Tickets by Owner (Full Description) (7 matches)

List tickets assigned, group by ticket owner. This report demonstrates the use of full-row display.

benl (2 matches)

Ticket Summary Component Milestone Type Created
Description
#2 Check class instances against their definitions. Type Inferencer 0.1.3 defect 05/12/09

We don't currently check whether a type class instance is valid wrt its definition. Unsafe program sometimes make it through the core type checker and sometimes not.

T2-CheckInstance contains an area function that has a larger closure than the definition, but it is silently accepted. I've seen other programs like this be caught by the core type checker.


#155 PANIC "mergeClasses: classes have differing kinds" in my Hashtable first cut Core Type Checker 0.1.3 defect 02/01/10
[1 of 1] Compiling Hashtable
ddc: PANIC in Type.Squid.Class
        mergeClasses: classes have differing kinds
            cids = [720, 721]
            ks   = [*, * -> *]
        
        Please report this bug to the maintainers at:
            http://trac.haskell.org/ddc
            or by emailing disciple-cafe@googlegroups.com

erikd (4 matches)

Ticket Summary Component Milestone Type Created
Description
#7 Merge projection dictionaries from different modules. Source Desugarer 0.1.3 defect 05/12/09

Projection dictionaries are open, so we should be able to give instance functions in multiple modules.


#172 Lexer generates incorrect token sequence Source Parser 0.1.3 defect 03/05/10

For the function:

trick2 xs = [ (x, y)
		| x <- xs
		, let y = x `mod` 3 ]

the lexer generates a token sequence (ignoring other tokens) of "[ { ] }" where the brackets don't match up properly. Changing the code to:

trick2 xs = [ (x, y)
		| x <- xs
		, let y = x `mod` 3
		]

generates the correct sqeuence of "[ { } ]".


#173 Faliure to parse type annotations within list defintion Source Parser 0.1.3 defect 03/06/10

The following parses correctly under GHC bug fails with DDC

main = println $ show [ (1::Int) .. 10 ]

#161 Implement let qualifiers for list comprehensions Source Parser 0.1.3 enhancement 02/21/10

Eg for a solution to the 4th Euler problem.

solution1
 = maximum 	
	[ x 	| y <- [100..999]
		, z <- [y..999]
		, let x = y * z
		, let s = show x
		, s == reverse s ]

steggles (1 match)

Ticket Summary Component Milestone Type Created
Description
#107 Definition order should not be important in where block Source Semantics _|_ enhancement 08/18/09

Two almost identical functions below. The first parses successfully, the second fails.

compileSuccess :: Int -> Int
compileSuccess x =
	x + y
  where
    -- This works becuase 'z' is defined before it is used.
    z = 4
    y = 3 + z

compileFail :: Int -> Int
compileFail x =
	x + y
  where
    -- Using 'z' before it is defined fails.
    y = 3 + z
    z = 4

Note: See TracReports for help on using and creating reports.