Export to

• Google Calendar
• iCalendar file
• hCalendar markup
  <div class="vevent h-event"> <h1 class="summary p-name">Portland Functional Programmers Study Group: Wm Leler's Bertrand constraint language</h1> <div class='date'><time class="dtstart dt-start" title="2009-02-09T19:00:00" datetime="2009-02-09T19:00:00">Monday, February 9, 2009 from 7</time>–<time class="dtend dt-end" title="2009-02-09T21:00:00" datetime="2009-02-09T21:00:00">9pm</time></div> <div class="location vcard p-location h-card"> <a class="url" href='http://calagator.org/venues/202389907'><span class='fn org p-name'>CubeSpace [ *sniff* out of business 12 June 2009]</span></a> <div class="adr p-adr h-adr"> <div class="street-address p-street-address">622 SE Grand Ave.</div> <span class="locality p-locality">Portland</span> , <span class="region p-region">Oregon</span> <span class="postal-code p-postal-code">97214</span> <div class="country-name p-country-name">USA</div> (<a href='https://maps.google.com/maps?q=622%20SE%20Grand%20Ave.,%20Portland%20Oregon%2097214%20USA'>map</a>) </div> </div> <div class="description p-description"> <p><i>A study/user group exploring the world of functional programming based in Portland, Oregon. The group welcomes programmers interested in all functional languages, including Haskell, Erlang, OCaml, Scala, 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.</i></p> <p>This 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 Specification and Generation".</p> <p>Constraint Satisfaction Systems were a hot topic of research in the 80's -- famous constraint systems include Ivan Sutherland's Sketchpad, Alan Borning's ThingLab (built on top of Smalltalk), Guy Steele's constraint language, and James Gosling's Magritte. These systems were used for computer graphics, design, and general numeric problem solving, but most of these solvers were domain specific and thus of limited usefulness.</p> <p>Bertrand is an equational programming system whose purpose is to build constraint satisfaction systems using simple 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 graphics, word problems, electrical circuits, or -- with the right rules -- virtually any mostly-linear domain.</p> <p>Since this is the Functional Programming Study Group, this talk will cover the underlying equational programming language of Bertrand and ways in which it could be extended to make it more powerful.</p> </div> <h3>Links</h3> <ul> <li><a class="url u-url" href="http://groups.google.com/group/pdxfunc">Website</a></li> </ul> </div>