BEGIN:VCALENDAR VERSION:2.0 PRODID:ILLC Website X-WR-TIMEZONE:Europe/Amsterdam BEGIN:VTIMEZONE TZID:Europe/Amsterdam X-LIC-LOCATION:Europe/Amsterdam BEGIN:DAYLIGHT TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST DTSTART:19700329T020000 RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU END:DAYLIGHT BEGIN:STANDARD TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET DTSTART:19701025T030000 RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU END:STANDARD END:VTIMEZONE BEGIN:VEVENT UID:/NewsandEvents/Archives/2011/newsitem/3960/16- June-2011-The-PlusCal-Algorithm-Language-Leslie-La mport DTSTAMP:20110605T000000 SUMMARY:The PlusCal Algorithm Language, Leslie Lam port ATTENDEE;ROLE=Speaker:Leslie Lamport DTSTART;TZID=Europe/Amsterdam:20110616T160000 DTEND;TZID=Europe/Amsterdam:20110616T000000 LOCATION:Turing room, CWI, Science Park, Amsterdam , The Netherlands DESCRIPTION:Algorithms are different from programs and should not be described with programming lang uages. For example, algorithms are usually best de scribed in terms of mathematical objects like sets and graphs instead of the primitive objects like bytes and integers provided by programming languag es. Until now, the only simple alternative to prog ramming languages has been pseudo-code. PlusCal is an algorithm language based on TLA+. A PlusCal algorithm is automatically translated to a TLA+ s pecification that can be checked with the TLC mode l checker or reasoned about formally. (No knowledg e of TLA+ is assumed.) PlusCal makes pseudo-code o bsolete. For more information, see k.r.apt at cw i.nl X-ALT-DESC;FMTTYPE=text/html:\n
Algorit hms are different from programs and should not be described\n with programming languages. F or example, algorithms are usually best\n described in terms of mathematical objects like se ts and graphs\n instead of the primitive o bjects like bytes and integers provided by\n programming languages. Until now, the only sim ple alternative to\n programming languages has been pseudo-code.\n
\n\ n PlusCal is an algorithm language based o n TLA+. A PlusCal algorithm\n is automati cally translated to a TLA+ specification that can be\n checked with the TLC model checker or reasoned about formally. (No\n knowledge of TLA+ is assumed.) PlusCal makes pseudo-code ob solete.\n
\n \nFor more i nformation, see k.r.apt at cwi.nl
URL:/NewsandEvents/Archives/2011/newsitem/3960/16- June-2011-The-PlusCal-Algorithm-Language-Leslie-La mport END:VEVENT END:VCALENDAR