Difference between revisions of "Meetings in Autumn 2007"

From The Programming Languages and Systems Research Group
Jump to: navigation, search
Line 8: Line 8:
 
{{EListEntry|340|Thursday, 29 November|12:15 -- 13:15, CS202J|speaker|title|abstract}}
 
{{EListEntry|340|Thursday, 29 November|12:15 -- 13:15, CS202J|speaker|title|abstract}}
  
{{EListEntry|341|Thursday, 06 December|12:15 -- 13:15, CS202J|speaker|title|abstract}}
+
{{EListEntry|341|Thursday, 06 December|12:15 -- 13:15, CS202J|Neil Mitchell|Detecting Pattern-Match Failures in Haskell|This talk describes an automated analysis of Haskell 98 programs to check statically that, despite the possible use of partial (or non-exhaustive) pattern matching, no pattern-match failure can occur. For example, if head is applied to the empty list, then the program will fail.
 +
 
 +
The method used is an iterative backward analysis using a novel form of pattern-constraint to represent sets of data values. The analysis is defined for a core first-order language to which Haskell 98 programs are reduced. The resultant tool has been successfully applied to various Haskell programs, including XMonad and HsColour.}}
 +
 
 
{{EListEntry|342|Thursday, 13 December|12:15 -- 13:15, CS202J|speaker|title|abstract}}
 
{{EListEntry|342|Thursday, 13 December|12:15 -- 13:15, CS202J|speaker|title|abstract}}
  

Revision as of 20:11, 3 December 2007

Thursday, 18 October speaker: "title"
12:15 -- 13:15, CS202J Abstract: abstract

Thursday, 25 October speaker: "title"
12:15 -- 13:15, CS202J Abstract: abstract

Thursday, 01 November speaker: "title"
12:15 -- 13:15, CS202J Abstract: abstract

Thursday, 08 November speaker: "title"
12:15 -- 13:15, CS202J Abstract: abstract

Thursday, 15 November speaker: "title"
12:15 -- 13:15, CS202J Abstract: abstract

Thursday, 22 November tba: "Fun in the Afternoon"
12:00 -- 18:00 Abstract: tba

Thursday, 29 November speaker: "title"
12:15 -- 13:15, CS202J Abstract: abstract

Thursday, 06 December Neil Mitchell: "Detecting Pattern-Match Failures in Haskell"
12:15 -- 13:15, CS202J Abstract: This talk describes an automated analysis of Haskell 98 programs to check statically that, despite the possible use of partial (or non-exhaustive) pattern matching, no pattern-match failure can occur. For example, if head is applied to the empty list, then the program will fail.

The method used is an iterative backward analysis using a novel form of pattern-constraint to represent sets of data values. The analysis is defined for a core first-order language to which Haskell 98 programs are reduced. The resultant tool has been successfully applied to various Haskell programs, including XMonad and HsColour.


Thursday, 13 December speaker: "title"
12:15 -- 13:15, CS202J Abstract: abstract

Offers

  • 15 November: Neil
  • Malcolm