BEGIN:VCALENDAR PRODID;X-RICAL-TZSOURCE=TZINFO:-//Calagator//EN CALSCALE:GREGORIAN X-WR-CALNAME:Calagator METHOD:PUBLISH VERSION:2.0 BEGIN:VTIMEZONE TZID;X-RICAL-TZSOURCE=TZINFO:America/Los_Angeles BEGIN:STANDARD DTSTART:20081102T020000 RDATE:20081102T020000 TZOFFSETFROM:-0700 TZOFFSETTO:-0800 TZNAME:PST END:STANDARD END:VTIMEZONE BEGIN:VEVENT CREATED;VALUE=DATE-TIME:20090114T154613Z DTEND;TZID=America/Los_Angeles;VALUE=DATE-TIME:20090209T210000 DTSTART;TZID=America/Los_Angeles;VALUE=DATE-TIME:20090209T190000 DTSTAMP;VALUE=DATE-TIME:20090114T154613Z LAST-MODIFIED;VALUE=DATE-TIME:20090206T004219Z UID:http://calagator.org/events/1250456505 DESCRIPTION:A study/user group exploring the world of functional programm ing based in Portland\, Oregon. The group welcomes programmers intereste d in all functional languages\, including Haskell\, Erlang\, OCaml\, Sca la\, and others. The group meets regularly and provides presentations\, demos and discussions applicable to all skill levels\, from newbies and experts. The meetings are usually on the second Monday of the month.\nTh is month\, Wm Leler will talk about Constraint Satisfaction Systems and the Bertrand Programming Language. Wm is the creator of Bertrand and the author of the book "\;Constraint Programming Languages: Their Speci fication and Generation"\;.Constraint Satisfaction Systems were a ho t topic of research in the 80's -- famous constraint systems include Iva n Sutherland's Sketchpad\, Alan Borning's ThingLab (built on top of Smal ltalk)\, Guy Steele's constraint language\, and James Gosling's Magritte . These systems were used for computer graphics\, design\, and general n umeric problem solving\, but most of these solvers were domain specific and thus of limited usefulness.Bertrand is an equational programming sys tem whose purpose is to build constraint satisfaction systems using simp le equational rules. Bertrand has an purely declarative semantics and an absurdly simple syntax\, yet it is a powerful and expressive language\, capable of solving problems in a large number of domains including grap hics\, word problems\, electrical circuits\, or -- with the right rules -- virtually any mostly-linear domain.Since this is the Functional Progr amming Study Group\, this talk will cover the underlying equational prog ramming language of Bertrand and ways in which it could be extended to m ake it more powerful.\n\nTags: pdxfunc\, functional programming\, constr aints\n\nImported from: http://calagator.org/events/1250456505 URL:http://groups.google.com/group/pdxfunc SUMMARY:Portland Functional Programmers Study Group: Wm Leler's Bertrand constraint language LOCATION:CubeSpace [ *sniff* out of business 12 June 2009]: 622 SE Grand Ave.\, Portland Oregon 97214 USA SEQUENCE:0 END:VEVENT END:VCALENDAR