WG 2.11 - User contributions [en]

WG211/M19Schedule

2019-05-01T01:34:42Z

Chung-chieh: /* Talks */ Add ccshan slides

=IFIP Working Group 2.11, Nineteenth Meeting=

== April 29-May 2nd 2019 in Boston, USA ==

The meeting will be held in Boston, USA, hosted by Armando Solar-Lezama.

The meeting will last 3.5 days; the first three days will be full-day, whereas the last day will be a half-day session.

=== Venue ===

The meeting will be held at Salem Waterfront Hotel & Suites in Salem MA, http://www.salemwaterfronthotel.com

We will be in Ballroom A.

=== Travel ===

Travel recommendations (based on mailing list discussion):
* Generic Boston to Salem taxi fare estimated at $60 including tips, add your name below to find people who arrive/leave at similar times and might want to share a ride.
* The commuter rail seems to be running from Chelsea to Salem over the weekend https://www.mbta.com/schedules/CR-Newburyport/timetable?date=2019-04-28&direction_id=0
* The MBTA #459 bus does not run over the weekend, but can be used for transport to the airport https://www.tripadvisor.co.uk/ShowTopic-g60954-i1100-k11774787-Transportation_From_Boston_airport_to_Salem-Salem_Massachusetts.html
* Reports from people travelling to Salem are somewhat mixed - see excerpt at bottom of page.

Flight arrivals and departures:
<blockquote>
{|
!Name
!Arr flight
!Arr time (at BOS)
!Dep flight
!Dep time (at BOS)
!Contact/notes
|-
|Jeremy Gibbons
|BA213
|Sat 13:35
|BA238
|Fri 07:30
|-
|Sandrine Blazy
|AF334
|Sun 15:55
|AF333
|Thu 18:05
|-
|Jacques Carette
|AC7606
|Sun 16:30
|AC527
|Thu 12:20
|-
|Maryam Mehri Dehnavi
|Porter Airlines 941
|Sun 13:30
|(...)
|(...)
|mmehride@cs.toronto.edu, 416-948-2008
|-
|Ulrik Pagh Schultz
|KL6031
|Sun 16:53
|KL6030
|Thu 16:41
|(changed flight)
|-
|Eric Walkingshaw
|AS 30
|Sun 18:00
|UA 8852
|Thu 17:00
|walkiner@oregonstate.edu
|-
|Julia Lawall
|AF 0334
|Sat 15:55
|AF333
|Thu 18:05
|}
</blockquote>

=== Accommodation ===

As noted above, the meeting will take place at the Salem Waterfront Hotel & Suites in Salem MA. We have a block of rooms reserved at the following rates:
* Superior Full: $149.00
* Superior Queen: $159.00
* Superior King: $159.000
* Deluxe King: $169.00
* Junior Suite: $189.00
* King Suite: $209.00
All the costs are per night before taxes for up to 2 guests per room ($10 plus tax is added for extra guests in a room). In order to get this rate people need to call the hotel directly at 1-888-337-253 (US) or +1-978-740-8788 (internationally) and refer to MIT.
The block is held until April 2nd 2019, but please reserve as soon as possible so we have a good headcount.

=== Registration ===

Registration is done using eventbrite: https://www.eventbrite.com/e/wg-211-meeting-tickets-57113878147

The password is circulated by email. The registration is $520.42. (People from the US can save the eventbrite fee of 5% by paying with a check when they arrive, in this case they only need to pay $497.00.)

== Attendance ==

Members: please add yourself here (in alphabetical order by last name) or email a chair-person to be added.

Sandrine Blazy,
Edwin Brady,
Jacques Carette (not Thursday),
Maryam Mehri Dehnavi,
Jack Feser,
Franz Franchetti (Monday and Tuesday),
Jeremy Gibbons,
Kevin Hammond,
Christian Kaestner (not Thursday),
James Koppel,
Julia Lawall,
Geoff Mainland,
Ulrik Pagh Schultz,
Chung-chieh Shan (not Thursday),
Yannis Smaragdakis,
Armando Solar-Lezama,
Eelco Visser (not Thursday),
Eric Walkingshaw,
Eric Van Wyk,
Jeremy Yallop.

== Talks ==

See below for schedule, note that the actual scheduling of talks will not be available until the meeting starts. Members: please add yourself and your topic, alphabetical order by last name, following the template below.

* Sandrine Blazy [[WG211/M19Blazy | Teaching deductive verification with Why3 to undergraduate students]]
* Edwin Brady [[WG211/M19Brady | Resource Safety with Linear Dependent Types]]
* Jacques Carette [[WG211/M19Carette | Metaprogramming Agda]]
* Maryam Mehri Dehnavi [[WG211/M19Dehnavi | Sparse Matrix Code Generation with Symbolic Decoupling ]]
* Franz Franchetti [[WG211/M19Franchetti | Formal Software Synthesis of Computational Kernels]] ([[Media:WG211_M19_Franchetti.pdf|slides]])
* Jeremy Gibbons [[WG211/M19Gibbons | Asymmetric Numeral Systems]] ([[Media:Wg211m19-20190429-edited.pdf|slides]])
* Kevin Hammond [[WG211/M19Hammond | Energy Usage for Parallel Haskell Programs]]
* Christian Kaestner [[WG211/M19Kaestner | Higher-Order Mutation Testing with Variational Execution ]]
* James Koppel [[WG211/M19Koppel | Language-Parametric Tools]]
* Julia Lawall [[WG211/M19Lawall | Julia's adventures with Why3]] ([[Media:WG211_M19_lawall.pdf|slides]])
* Geoffrey Mainland [[WG211/M19Mainland | Compiling Low-level Radio Protocols]]
* Ulrik Pagh Schultz [[WG211/M19Schultz | Teaching Program Generation to the Masses (all the Non-Computer-Scientists)]]
* Chung-chieh Shan [[WG211/M19Shan | From high-level inference algorithms to efficient code]] ([[Media:WG211_M19_ccshan.pdf|slides]])
* Yannis Smaragdakis [[WG211/M19Smaragdakis | Smart Contract Static Analysis: Decompilation and Gas Vulnerabilities]]
* Armando Solar-Lezama [[WG211/M19Lezama | TBD]]
* Eric Van Wyk [[WG211/M19VanWyk | Monads in Attribute Grammars ]] ([[Media:WG211_M19_VanWyk.pdf|slides]])
* Eelco Visser [[WG211/M19Visser | Declarative Type System Specification with Statix]]
* Eric Walkingshaw [[WG211/M19Walkingshaw | Toward a Variational Programming Language]]
* Jeremy Yallop [[WG211/M19Yallop | A typed, algebraic approach to parsing]]

We will follow our usual format of interactive talks with an active audience, but this time making use of a chess clock for timing, as follows. For each talk the speaker and the audience each get at most 25 minutes. The audience does not have to wait until the end of a talk to ask questions; interaction and discussion is encouraged. (But experience from previous meeting shows that it is useful to let the speaker at least finish their introduction before interrupting.) To ensure fairness, administration of the time used by each party is done using a chess clock. Operation of the clock rotates among participants. Both speakers and audience are expected to contribute to make talks and discussions engaging, interesting, and useful. Therefore, we observe a policy of no use of electronic devices during talks (other than the device the speaker uses to present slides). Bring paper and pen for making notes.

== Program / schedule ==

=== Scientific program ===

Note that links to slides are provided for some talks in the alphabetical list of talks above.

Monday, April 29:
* 8:45 - 10:30: Welcome and 2 talks
** 9:00: Chung-chieh Shan [[WG211/M19Shan | From high-level inference algorithms to efficient code]]
** 9:45: Julia Lawall [[WG211/M19Lawall | Julia's adventures with Why3]]
* 10:30 - 11:15: Break
* 11:15 - 12:00: 1 talk
** Eelco Visser [[WG211/M19Visser | Declarative Type System Specification with Statix]]
* 12:00 - 14:00: Lunch
* 14:00 - 15:30: 2 regular talks
** Maryam Mehri Dehnavi [[WG211/M19Dehnavi | Sparse Matrix Code Generation with Symbolic Decoupling ]]
** Jeremy Gibbons [[WG211/M19Gibbons | Asymmetric Numeral Systems]]
* 15:30 - 16:15: Break
* 16:15 - 17:30: 1 talk
** Geoffrey Mainland [[WG211/M19Mainland | Compiling Low-level Radio Protocols]]
* 18:30 Dinner at Adriatic Restaurant (155 Washington Street)

Tuesday, April 30:
* 9:00 - 10:30: Welcome and 2 talks
** 9:00: Sandrine Blazy [[WG211/M19Blazy | Teaching deductive verification to undergraduate students]]
** 9:45: Franz Franchetti [[WG211/M19Franchetti | Formal Software Synthesis of Computational Kernels]]
* 10:30 - 11:15: Break
* 11:15 - 12:00: 1 talk
** 11:15: Jacques Carette [[WG211/M19Carette | Metaprogramming Agda]]
* 12:00 - 14:00: Lunch
* 14:00 - 15:30: 2 regular talks
** 14:00: Eric Van Wyk [[WG211/M19VanWyk | Monads in Attribute Grammars ]]
** 14:45: Eric Walkingshaw [[WG211/M19Walkingshaw | Toward a Variational Programming Language]]
* 15:30 - 16:00: Break
* 16:00 - 17:30: Business Meeting, members only
* 18:30 Dinner at Bambolina Restaurant (288 Derby Street)

Wednesday, May 1:
* 9:00 - 10:30: Welcome and 2 talks
** 9:00: Christian Kaestner [[WG211/M19Kaestner | Higher-Order Mutation Testing with Variational Execution ]]
** 9:45: James Koppel [[WG211/M19Koppel | Language-Parametric Tools]]
* 10:30 - 11:15: Break
* 11:15 - 12:00: 1 talk
** 11:15: Jeremy Yallop [[WG211/M19Yallop | A typed, algebraic approach to parsing]]
* 12:00 - 14:00: Lunch
* 14:00 - 15:30: 2 regular talks
** 14:00: Ulrik Pagh Schultz [[WG211/M19Schultz | Teaching Program Generation to the Masses (all the Non-Computer-Scientists)]]
** 14:45: Armando Solar-Lezama [[WG211/M19Lezama | TBD]]
* 17:00 - 19:00: Excursion, The Salem Historical Tours (starts at hotel, ends at restaurant)
* 19:00 Dinner at Opus (87 Washington Street)

Thursday, May 2:
* 9:00 - 10:30: 2 talks
** 9:00: Kevin Hammond [[WG211/M19Hammond | Energy Usage for Parallel Haskell Programs]]
** 9:45: Yannis Smaragdakis [[WG211/M19Smaragdakis | Smart Contract Static Analysis: Decompilation and Gas Vulnerabilities]]
* 10:30 - 11:00: Break
* 11:00 - 12:00: 1 talk
** 11:00: Edwin Brady [[WG211/M19Brady | Resource Safety with Linear Dependent Types]]
* 12:00: Lunch and/or departure

=== Social events ===

The Salem Historical Tours, https://www.salemhistoricaltours.com/
They are going to give a mixed tour of general history and a witch tour (Salem is famous for the Salem Witch Trials). They will pick us up at the hotel at 17:15 (so we meet 17:00 in the lobby), and will drop us off directly at the restaurant.

'''Dinner Locations and Schedule'''

* Monday April 29, 6:30 pm. Adriatic Restaurant, 155 Washington Street, Salem, Ma 01970. T: 978-594-1832
* Tuesday, April 30, 6:30 pm. Bambolina Restaurant, 288 Derby Street, Salem, Ma 01970. T: 978-594-8709
* Wednesday May 1, 7:00 pm. Opus Restaurant, 87 Washington Street, Salem, MA 01970. T: 978-744-9600

== Travel Recommendations ==

People travelling to Salem over the weekend have reported somewhat mixed experiences with the public transportation system, excerpt:

* JL: The commuter rail was substantially less easy than expected. I was expecting something that runs every 5-10 minutes, but actually it runs every 1-2 hours. Theer are trains from Chelsea at 2:40, 4:40 and 5:40 (verify on the the mbta website). From the airport, you take the 33 bus (free) to the blue line (airport T station) and then silver line 3 to the commuter rail at Chelsea. I don't know if one is supposed to pay for the silver line or not. The driver didn't seem very interested when I asked if it was necessary to pay, but other people were using tickets. At Chelsea, the train is just to the right of the bus stop. There is only one platform that says inbound. You wait there and cross the tracks to get to the outbound train. You need to wave at the train to get it to stop. I bought my ticket with the mticket app, so I don't know where or whether the tickets can be bought at the station. Taking a taxi or uber may be a simpler option.

* JG: I asked for directions at the airport information desk - they recommended instead going into the city and catching the commuter train from there. From the airport, take the Silver Line 1 bus to South Station, then the red then orange T lines to North Station, from where it is a short walk to the commuter rail station (underneath TD Garden, a sports stadium). At least there is a ticket office at North Station. Of course, the trains go no more frequently. I understand that the SL1 and T is free all the way to North Station (though in fact I walked from South Station to North Station, to get some daylight).

File:WG211 M19 ccshan.pdf

2019-05-01T01:34:08Z

Chung-chieh:

WG211/M19Shan

2019-04-15T16:42:28Z

Chung-chieh: /* From high-level inference algorithms to efficient code */ Add joint authors

== From high-level inference algorithms to efficient code ==

(joint work with Rajan Walia, Jacques Carette, Praveen Narayanan, and Sam Tobin-Hochstadt)

Probabilistic programming languages are valuable because they allow
domain experts to express probabilistic models and inference algorithms
without worrying about irrelevant details. However, for decades there
remained an important and popular class of probabilistic inference
algorithms whose efficient implementation required manual low-level
coding that is tedious and error-prone. They are algorithms whose idiomatic expression requires
random array variables that are ''latent'' or whose likelihood is
''conjugate''. Although that is how practitioners
communicate and compose these algorithms on paper, executing such
expressions requires ''eliminating'' the latent variables and
''recognizing'' the conjugacy by symbolic mathematics. Moreover,
matching the performance of handwritten code requires speeding up loops
by more than a constant factor.

We show how probabilistic programs that directly and concisely express
these desired inference algorithms can be compiled
while maintaining efficiency. We introduce new transformations that
turn high-level probabilistic programs with arrays into pure loop code.
We then make great use of domain-specific invariants and norms to
optimize the code, and to specialize and JIT-compile the code per execution.
The resulting performance is competitive with manual implementations.

WG211/M19Shan

2019-04-15T16:41:34Z

Chung-chieh:

== From high-level inference algorithms to efficient code ==

Probabilistic programming languages are valuable because they allow
domain experts to express probabilistic models and inference algorithms
without worrying about irrelevant details. However, for decades there
remained an important and popular class of probabilistic inference
algorithms whose efficient implementation required manual low-level
coding that is tedious and error-prone. They are algorithms whose idiomatic expression requires
random array variables that are ''latent'' or whose likelihood is
''conjugate''. Although that is how practitioners
communicate and compose these algorithms on paper, executing such
expressions requires ''eliminating'' the latent variables and
''recognizing'' the conjugacy by symbolic mathematics. Moreover,
matching the performance of handwritten code requires speeding up loops
by more than a constant factor.

We show how probabilistic programs that directly and concisely express
these desired inference algorithms can be compiled
while maintaining efficiency. We introduce new transformations that
turn high-level probabilistic programs with arrays into pure loop code.
We then make great use of domain-specific invariants and norms to
optimize the code, and to specialize and JIT-compile the code per execution.
The resulting performance is competitive with manual implementations.

WG211/M19Shan

2019-04-15T16:41:03Z

Chung-chieh:

# From high-level inference algorithms to efficient code

Probabilistic programming languages are valuable because they allow
domain experts to express probabilistic models and inference algorithms
without worrying about irrelevant details. However, for decades there
remained an important and popular class of probabilistic inference
algorithms whose efficient implementation required manual low-level
coding that is tedious and error-prone. They are algorithms whose idiomatic expression requires
random array variables that are ''latent'' or whose likelihood is
''conjugate''. Although that is how practitioners
communicate and compose these algorithms on paper, executing such
expressions requires ''eliminating'' the latent variables and
''recognizing'' the conjugacy by symbolic mathematics. Moreover,
matching the performance of handwritten code requires speeding up loops
by more than a constant factor.

We show how probabilistic programs that directly and concisely express
these desired inference algorithms can be compiled
while maintaining efficiency. We introduce new transformations that
turn high-level probabilistic programs with arrays into pure loop code.
We then make great use of domain-specific invariants and norms to
optimize the code, and to specialize and JIT-compile the code per execution.
The resulting performance is competitive with manual implementations.

WG211/M19Shan

2019-04-15T16:40:52Z

Chung-chieh: Add Shan abstract

* From high-level inference algorithms to efficient code

Probabilistic programming languages are valuable because they allow
domain experts to express probabilistic models and inference algorithms
without worrying about irrelevant details. However, for decades there
remained an important and popular class of probabilistic inference
algorithms whose efficient implementation required manual low-level
coding that is tedious and error-prone. They are algorithms whose idiomatic expression requires
random array variables that are ''latent'' or whose likelihood is
''conjugate''. Although that is how practitioners
communicate and compose these algorithms on paper, executing such
expressions requires ''eliminating'' the latent variables and
''recognizing'' the conjugacy by symbolic mathematics. Moreover,
matching the performance of handwritten code requires speeding up loops
by more than a constant factor.

We show how probabilistic programs that directly and concisely express
these desired inference algorithms can be compiled
while maintaining efficiency. We introduce new transformations that
turn high-level probabilistic programs with arrays into pure loop code.
We then make great use of domain-specific invariants and norms to
optimize the code, and to specialize and JIT-compile the code per execution.
The resulting performance is competitive with manual implementations.

WG211/M19Schedule

2019-04-15T16:39:36Z

Chung-chieh: /* Talks */ Add Shan talk

WG211/M19Schedule

2019-04-15T16:38:55Z

Chung-chieh: /* Attendance */ Shan absent on Thursday

WG211/M19Schedule

2019-03-12T19:41:16Z

Chung-chieh: /* Attendance */

2016-08-19T14:51:31Z

Chung-chieh: /* Venue */ Add map

=IFIP Working Group 2.11, Sixteenth Meeting=

== August 22-25, 2016 in Bloomington, Indiana, USA.==

The meeting will be held in Bloomington, Indiana, USA, hosted by [http://homes.soic.indiana.edu/ccshan/ Chung-chieh Shan] (Indiana University). The meeting will last 3.5 days; the first three days (August 22-24) will be full-day, whereas the last day (August 25) will be a half-day session ending with lunch.

=== Venue ===

[[File:M16map.jpg|thumb|640px|link=https://drive.google.com/open?id=1yVSzUHs8WaqiKpBKCBciMQIDfgE&usp=sharing|Map of relevant Bloomington locations in Google, [[Media:M16map.pdf|also available as printable PDF]] ]]

The venue will be the ground-level meeting room at the [http://crest.iu.edu/ Center for Research in Extreme Scale Technologies] at 420 N. Walnut St near downtown Bloomington.

=== Travel ===

Beware that the Bloomington in Indiana is different from the Bloomington in Illinois and Minnesota. Do not fly into Bloomington-Normal airport in Illinois!

The most convenient airport is Indianapolis (IND), about one hour of driving time from campus. To get from the airport to campus:
* Every couple of hours there are two companies ([http://goexpresstravel.com/airport_shuttle_schedule Go Express] and [http://www.soashuttle.com/locations/bloomington-to-indianapolis/ Star of America]) that provide shuttle van service to Bloomington (from 6:20am to 10:40pm; ~$20), with a stop in front of the Indiana Memorial Union.
* Or call e2Taxi at +1 812-961-8294.
* Or rent a car at the airport.

You can also drive from another city, such as Chicago (4 hours), Cincinnati (3 hours), Louisville (2 hours).

==== Accommodation ====

As of July 20, the block of hotel rooms we reserved at the Indiana Memorial Union ($129-$164/night + tax, earliest check-in on August 20, latest check-out on August 26) has released, so any further booking is subject to current availability. Please use the hotel block "group code" "IFIP" by calling +1-800-209-8145 or +1-812-855-2536.

There are also several other hotels and bed-and-breakfasts convenient to downtown Bloomington.

== Registration ==

The registration fee is US$375. Please register and pay using this link:
https://indianauniv.ungerboeck.com/prod/emc00/register.aspx?OrgCode=10&EvtID=7572&AppCode=REG

== Attendance ==

Members: please add yourself here (in alphabetical order by last name) or email a chair-person to be added.

Sandrine Blazy, Edwin Brady, Jacques Carette, Charles Consel (M-W), Ewen Denney, Jeremy Gibbons, Kevin Hammond (M-W), Christian Kaestner (M-W), Oleg Kiselyov, Ralf Laemmel, Julia Lawall (M-W), Praveen Narayanan, Ryan Newton, Tiark Rompf, Sven-Bodo Scholz, Ulrik Pagh Schultz, Chung-chieh Shan, Amr Sabry (intermittent), Jeremy Siek, Satnam Singh, Eelco Visser, Eric Van Wyk

== Talks ==

See below for schedule, note that the actual scheduling of talks will not be available until the meeting starts.

Sandrine Blazy [[WG211/M16Blazy | A Verified Compiler for a Memory Model supporting Pointer Arithmetic and Uninitialised Data ]]

Edwin Brady [[WG211/M16Brady | Concurrent programming with dependent types ]]

Jacques Carette [[WG211/M16Carette | Drasil: From generating code to generating software ]]

Charles Consel [[WG211/M16Consel | Integrating Domain Experts in the Software Development Process via a DSL-Based Approach ]]

Ewen Denney [[WG211/M16Denney | Synthesizing Domain-specific Annotations ]]

Kevin Hammond [[WG211/M16Hammond | Farms, Pipes, Streams and Reforestation: Reasoning about Structured Parallel Processes using Types and Hylomorphisms ]]

Jeremy Gibbons [[WG211/M16Gibbons | APLicative Programming with Naperian Functors ]]

Christian Kaester [[WG211/M16Kaestner | Cross-Language Analysis of Dynamic Web Applications ]]

Oleg Kiselyov [[WG211/M16Kiselyov | Generating Code with Polymorphic let: A Ballad of Value Restriction, Copying and Sharing]]

Ralf Lämmel [[WG211/M16Laemmel | Compilation of megamodels]]

Julia Lawall [[WG211/M16Lawall | Prequel: A Patch-Like Query Language for Commit History Search]]

Praveen Narayanan [[WG211/M16PraveenNarayanan | Disintegrating probabilistic programs with arrays ]]

Ryan Newton TBA

Tiark Rompf [[WG211/M16SRomph | LMS-Verify: Abstraction Without Regret for Verified Systems Programming]]

Sven-Bodo Scholz [[WG211/M16Scholz | SpaceTime -- a fresh view on parallel programming ]]

Ulrik Pagh Schultz [[WG211/M16Schultz | Adventures in Object-Oriented Reversible Programming]]

Jeremy Siek TBA

Satnam Singh [[WG211/M16Singh | Code Generation Challenges for Android Applications ]]

Eric Van Wyk [[WG211/M16VanWyk | Language extensions for parallel programming: opportunities and challenges ]]

Eelco Visser [[WG211/M16Visser | Scopes Describe Frames: A Uniform Model for Memory Layout in Dynamic Semantics ]]

== Schedule ==

Note that the actual scheduling of talks will not be available until the meeting starts (although you will know in advance if you are giving a talk in the first session).

''Preliminary schedule''

Breakfast, wireless Internet, and a bottomless cup of coffee are available every day from 7am at [http://www.scholarsinn.com/scholars-inn-bakehouse.html Scholars Inn Bakehouse downtown] (125 N College, southwest of the intersection with 6th St). Please tell them to charge your meal to the "computer science workshop". It's less than 10 minutes walk from the meetings (on Walnut, southeast of the intersection with 9th St).

Monday August 22:
* 9:15 arrive, welcome
* 9:15-10:00 work (1 talk)
* 10:00-10:30 morning break with refreshments
* 10:30-12:00 work (2 talks)
* 12:00-14:00 catered lunch from [http://www.feastcateringonline.com/ Feast]
* 14:00-15:30 work (2 talks)
* 15:30-16:00 afternoon break with refreshments
* 16:00-17:30 work (2 talks)
* 19:00 dinner at [https://the-uptown.com/ Uptown Cafe]

Tuesday August 23:
* 8:30-10:00 work (2 talks)
* 10:00-10:30 morning break with refreshments
* 10:30-12:00 work (2 talks)
* 12:00-14:00 catered lunch from [http://www.falafelsonline.com/ Falafels]
* 14:00-15:30 work (2 talks)
* 15:30-16:00 afternoon break with refreshments
* 16:00-17:30 business meeting (members only)
* 19:00 dinner at [http://www.topos403.com/ Topos 403]

Wednesday August 24:
* 9:00-10:30 work (2 talks)
* 10:30-11:00 morning break with refreshments
* 11:00-12:30 work (2 talks)
* 12:30-14:30 buffet lunch at [http://www.restaurantanatolia.com/ Anatolia]
* 14:30-17:30 excursion (see below)
* 19:00 dinner at [http://www.esanthairest.com/ Esan Thai]

Thursday August 25:
* 8:30-10:00 work (2 talks)
* 10:00-10:30 morning break with refreshments
* 10:30-12:00 work (2 talks)
* 12:00-14:00 catered lunch (or to go) from [http://thelaughingplanetcafe.com/ Laughing Planet]

== Excursion==

After lunch on Wednesday, August 24, we'll take in the highlights of the [https://artmuseum.indiana.edu/ Indiana University Art Museum] and [http://www.indiana.edu/~liblilly/ Lilly Library], including its [http://www.indiana.edu/~liblilly/collections/puzzles.shtml puzzle collection]. If we're lucky, we'll also learn a bit about the [https://www.kinseyinstitute.org/ Kinsey Institute].

If you're looking to spend some free time in Bloomington (like meeting up for Sunday dinner), here are '''some''' of [http://www.visitbloomington.com/ the options]:
* Food:
** "restaurant row" on 4th St around Dunn St and Grant St: Tibetan, Burmese, Korean, Indian, Turkish, ...
** downtown: Samira (Afghan), Owlery (vegan diner), King Dough (wood-oven pizza, including vegetarian, vegan, and gluten-free options), ...
* Alcohol: Upland Brewery, The Tap, Function Brewery, Quaff On, ...
* Coffee: Pourhouse, Soma, Runcible Spoon, Hopscotch, ...
* Chocolate: BLU Boy
* More museums: [http://wonderlab.org/ WonderLab], [http://www.mathers.indiana.edu/ Mathers Museum of World Cultures]
* Film: More "Raiders of the Lost Ark" than you probably want at the [http://www.cinema.indiana.edu/calendar/ Indiana University Cinema]
* Bicycling: Maybe rent a bike at Revolution Bike & Bean, enjoy an espresso, and head for one of the lakes (Griffy, Lemon, Monroe)?

File:M16map.pdf

2016-08-19T14:44:33Z

Chung-chieh:

2016-08-03T21:46:52Z

Chung-chieh: /* Venue */