BEGIN:VCALENDAR
PRODID;X-RICAL-TZSOURCE=TZINFO:-//com.denhaven2/NONSGML ri_cal gem//EN
CALSCALE:GREGORIAN
VERSION:2.0
BEGIN:VTIMEZONE
TZID;X-RICAL-TZSOURCE=TZINFO:America/Los_Angeles
BEGIN:STANDARD
DTSTART:20081102T010000
RDATE:20081102T010000
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP;TZID=America/Los_Angeles;VALUE=DATE-TIME:20090114T074613
CREATED;TZID=America/Los_Angeles;VALUE=DATE-TIME:20090114T074613
DTEND;TZID=America/Los_Angeles;VALUE=DATE-TIME:20090209T210000
LAST-MODIFIED;TZID=America/Los_Angeles;VALUE=DATE-TIME:20090205T164219
DTSTART;TZID=America/Los_Angeles;VALUE=DATE-TIME:20090209T190000
UID:http://calagator.org/events/1250456505
URL:http://groups.google.com/group/pdxfunc
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.\n\n
 This month\, Wm Leler will talk about Constraint Satisfaction Systems an
 d the Bertrand Programming Language. Wm is the creator of Bertrand and t
 he author of the book "Constraint Programming Languages: Their Specifica
 tion and Generation".\n\nConstraint Satisfaction Systems were a hot topi
 c of research in the 80's -- famous constraint systems include Ivan Suth
 erland's Sketchpad\, Alan Borning's ThingLab (built on top of Smalltalk)
 \, Guy Steele's constraint language\, and James Gosling's Magritte. Thes
 e systems were used for computer graphics\, design\, and general numeric
  problem solving\, but most of these solvers were domain specific and th
 us of limited usefulness.\n\nBertrand is an equational programming syste
 m whose purpose is to build constraint satisfaction systems using simple
  equational rules. Bertrand has an purely declarative semantics and an a
 bsurdly simple syntax\, yet it is a powerful and expressive language\, c
 apable of solving problems in a large number of domains including graphi
 cs\, word problems\, electrical circuits\, or -- with the right rules --
  virtually any mostly-linear domain.\n\nSince this is the Functional Pro
 gramming Study Group\, this talk will cover the underlying equational pr
 ogramming language of Bertrand and ways in which it could be extended to
  make it more powerful.\n\nTags:\nconstraints\, functional programming\,
  pdxfunc
SUMMARY:Portland Functional Programmers Study Group: Wm Leler's Bertrand 
 constraint language
SEQUENCE:0
LOCATION:CubeSpace [ *sniff* out of business 12 June 2009]
END:VEVENT
END:VCALENDAR