WG211/M23Schedule - Revision history

Geoff: /* Scientific program */

2024-03-27T11:12:20Z

Scientific program

← Older revision		Revision as of 13:12, 27 March 2024
Line 209:		Line 209:
	* 9:00 - 10:30 2 talks		* 9:00 - 10:30 2 talks
	** 9:00 - 9:45 Igor Pikovets [[WG211/M23Pikovets \| OCaml in the Big Data World ]]		** 9:00 - 9:45 Igor Pikovets [[WG211/M23Pikovets \| OCaml in the Big Data World ]]
	** 9:45 - 10:30 Geoffrey Mainland [ [WG211/M23Mainland \| Metaprogramming with Combinators ]]		** 9:45 - 10:30 Geoffrey Mainland [[WG211/M23Mainland \| Metaprogramming with Combinators ]]
	* 10:30 - 11:00 Break		* 10:30 - 11:00 Break
	* 11:00 - 11:45 1 talk		* 11:00 - 11:45 1 talk

Geoff: /* Scientific program */

2024-03-27T11:12:05Z

Scientific program

← Older revision		Revision as of 13:12, 27 March 2024
Line 209:		Line 209:
	* 9:00 - 10:30 2 talks		* 9:00 - 10:30 2 talks
	** 9:00 - 9:45 Igor Pikovets [[WG211/M23Pikovets \| OCaml in the Big Data World ]]		** 9:00 - 9:45 Igor Pikovets [[WG211/M23Pikovets \| OCaml in the Big Data World ]]
	** 9:45 - 10:30 Geoffrey Mainland [WG211/M23Mainland \| Metaprogramming with Combinators ]]		** 9:45 - 10:30 Geoffrey Mainland [ [WG211/M23Mainland \| Metaprogramming with Combinators ]]
	* 10:30 - 11:00 Break		* 10:30 - 11:00 Break
	* 11:00 - 11:45 1 talk		* 11:00 - 11:45 1 talk

Geoff: /* Scientific program */

2024-03-27T11:11:53Z

Scientific program

← Older revision		Revision as of 13:11, 27 March 2024
Line 209:		Line 209:
	* 9:00 - 10:30 2 talks		* 9:00 - 10:30 2 talks
	** 9:00 - 9:45 Igor Pikovets [[WG211/M23Pikovets \| OCaml in the Big Data World ]]		** 9:00 - 9:45 Igor Pikovets [[WG211/M23Pikovets \| OCaml in the Big Data World ]]
	** 9:45 - 10:30 Geoffrey Mainland		** 9:45 - 10:30 Geoffrey Mainland [WG211/M23Mainland \| Metaprogramming with Combinators ]]
	* 10:30 - 11:00 Break		* 10:30 - 11:00 Break
	* 11:00 - 11:45 1 talk		* 11:00 - 11:45 1 talk

Jeremy-y: Add talk titles

2024-03-27T01:24:31Z

Add talk titles

← Older revision		Revision as of 03:24, 27 March 2024
Line 134:		Line 134:
	* Jeremy Johnson (TBD)		* Jeremy Johnson (TBD)
	* Yukiyoshi Kameyama [[WG211/M23Kameyama \| Program generation and (lightweight) analysis: case studies on cryptographic implementations ]]		* Yukiyoshi Kameyama [[WG211/M23Kameyama \| Program generation and (lightweight) analysis: case studies on cryptographic implementations ]]
			* Ohad Kammar [[WG211/M23Kammar \| Paella: handlers for parameterised algebraic effects ]]
	* Martin Kellogg [[WG211/M23Kellogg \| Static Program Reduction via Specification Slicing ]]		* Martin Kellogg [[WG211/M23Kellogg \| Static Program Reduction via Specification Slicing ]]
	* Oleg Kiselyov [[WG211/M23Kiselyov \| The Mysteries of AXPY ]]		* Oleg Kiselyov [[WG211/M23Kiselyov \| The Mysteries of AXPY ]]
Line 146:		Line 147:
	* Stephanie Weirich [[WG211/M23Weirich \| CBPV + effects + coeffects]]		* Stephanie Weirich [[WG211/M23Weirich \| CBPV + effects + coeffects]]
	* Eric Van Wyk [[WG211/M23VanWyk \| Modular Metatheory for Extensible Languages]]		* Eric Van Wyk [[WG211/M23VanWyk \| Modular Metatheory for Extensible Languages]]
	* Jeremy Yallop ~~(TBD)~~		* Jeremy Yallop [[WG211/M23Yallop \| Rough thoughts on refunctionalization ]]

	We will follow our usual format of interactive talks with an active audience, using 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 meetings shows that it is useful to let the speaker at least finish the 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 speaker 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.		We will follow our usual format of interactive talks with an active audience, using 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 meetings shows that it is useful to let the speaker at least finish the 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 speaker 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.

Jeremy-y: Schedule for Wednesday and Thursday

2024-03-27T01:20:43Z

Schedule for Wednesday and Thursday

← Older revision		Revision as of 03:20, 27 March 2024
Line 190:		Line 190:

	* 9:00 - 10:30 Two talks		* 9:00 - 10:30 Two talks
			** 9:00 - 9:45 Nada Amin [[WG211/M23Amin \| A Redesign for Staged Relational Programming ]]
			** 9:45 - 10:30 Eric Van Wyk [[WG211/M23VanWyk \| Modular Metatheory for Extensible Languages]]
	* 10:30 - 11:00 Break		* 10:30 - 11:00 Break
	* 11:00 - 11:45 One talk		* 11:00 - 11:45 One talk
			** 11:00 - 11:45 Ken Shan [[WG211/M23Shan \| More Efficient Exact Recursive Probabilistic Programming ]]
	* 11:45 - 13:00 Lunch		* 11:45 - 13:00 Lunch
	* 13:00 - 14:30 Two talks		* 13:00 - 14:30 Two talks
			** 13:00 - 13:45 Jeremy Yallop [[WG211/M23Yallop \| Rough thoughts on refunctionalization ]]
			** 13:45 - 14:30 Ohad Kammar [[WG211/M23Kammar \| Paella: handlers for parameterised algebraic effects ]]
	* 14:30 - 15:00 Break		* 14:30 - 15:00 Break
	* 15:30 - 16:15 One talk		* 15:30 - 16:15 One talk
Line 202:		Line 207:

	* 9:00 - 10:30 2 talks		* 9:00 - 10:30 2 talks
			** 9:00 - 9:45 Igor Pikovets [[WG211/M23Pikovets \| OCaml in the Big Data World ]]
			** 9:45 - 10:30 Geoffrey Mainland
	* 10:30 - 11:00 Break		* 10:30 - 11:00 Break
	* 11:00 - 11:45 1 talk		* 11:00 - 11:45 1 talk

Geoff: /* Scientific program */

2024-03-26T20:51:28Z

Scientific program

← Older revision		Revision as of 22:51, 26 March 2024
Line 185:		Line 185:
	** 15:00 - 15:45 Martin Kellogg [[WG211/M23Kellogg \| Static Program Reduction via Specification Slicing ]]		** 15:00 - 15:45 Martin Kellogg [[WG211/M23Kellogg \| Static Program Reduction via Specification Slicing ]]
	** 15:45 - 1630 Friedrich Steimann [[WG211/M23Steimann \| Relate! Concatenative Relational Programming ]]		** 15:45 - 1630 Friedrich Steimann [[WG211/M23Steimann \| Relate! Concatenative Relational Programming ]]
	* 18:30 Dinner at [https://vedaphilly.com/ Veda]		* 18:30 Dinner at [https://vedaphilly.com/ Veda]. We will meet in the hotel lobby at 17:50 to take the trolley.

	Wednesday, March 27		Wednesday, March 27

Geoff: /* Scientific program */

2024-03-26T20:44:38Z

Scientific program

← Older revision		Revision as of 22:44, 26 March 2024
Line 185:		Line 185:
	** 15:00 - 15:45 Martin Kellogg [[WG211/M23Kellogg \| Static Program Reduction via Specification Slicing ]]		** 15:00 - 15:45 Martin Kellogg [[WG211/M23Kellogg \| Static Program Reduction via Specification Slicing ]]
	** 15:45 - 1630 Friedrich Steimann [[WG211/M23Steimann \| Relate! Concatenative Relational Programming ]]		** 15:45 - 1630 Friedrich Steimann [[WG211/M23Steimann \| Relate! Concatenative Relational Programming ]]
	* 18:00 Dinner at [https://vedaphilly.com/ Veda]		* 18:30 Dinner at [https://vedaphilly.com/ Veda]

	Wednesday, March 27		Wednesday, March 27

Jeremy-y: Formatting fix

2024-03-26T11:39:22Z

Formatting fix

← Older revision		Revision as of 13:39, 26 March 2024
Line 141:		Line 141:
	* Igor Pikovets [[WG211/M23Pikovets \| OCaml in the Big Data World ]]		* Igor Pikovets [[WG211/M23Pikovets \| OCaml in the Big Data World ]]
	* Sven-Bodo Scholz [[WG211/M23Scholz \| Stream it if you can - not just when your GPU runs out of memory ]]		* Sven-Bodo Scholz [[WG211/M23Scholz \| Stream it if you can - not just when your GPU runs out of memory ]]
	* Ken Shan [[WG211/M23Shan More Efficient Exact Recursive Probabilistic Programming ]]		* Ken Shan [[WG211/M23Shan \| More Efficient Exact Recursive Probabilistic Programming ]]
	* Satnam Singh [[WG211/M23Singh \| Haste: A Haskell DSL for Programming the Groq TSP/LPU Machine Learning Chips ]]		* Satnam Singh [[WG211/M23Singh \| Haste: A Haskell DSL for Programming the Groq TSP/LPU Machine Learning Chips ]]
	* Friedrich Steimann [[WG211/M23Steimann \| Relate! Concatenative Relational Programming ]]		* Friedrich Steimann [[WG211/M23Steimann \| Relate! Concatenative Relational Programming ]]

Jeremy-y: Add Ken Shan's talk title

2024-03-26T11:38:41Z

Add Ken Shan's talk title

← Older revision		Revision as of 13:38, 26 March 2024
Line 141:		Line 141:
	* Igor Pikovets [[WG211/M23Pikovets \| OCaml in the Big Data World ]]		* Igor Pikovets [[WG211/M23Pikovets \| OCaml in the Big Data World ]]
	* Sven-Bodo Scholz [[WG211/M23Scholz \| Stream it if you can - not just when your GPU runs out of memory ]]		* Sven-Bodo Scholz [[WG211/M23Scholz \| Stream it if you can - not just when your GPU runs out of memory ]]
	* Ken Shan ~~(TBD)~~		* Ken Shan [[WG211/M23Shan More Efficient Exact Recursive Probabilistic Programming ]]
	* Satnam Singh [[WG211/M23Singh \| Haste: A Haskell DSL for Programming the Groq TSP/LPU Machine Learning Chips ]]		* Satnam Singh [[WG211/M23Singh \| Haste: A Haskell DSL for Programming the Groq TSP/LPU Machine Learning Chips ]]
	* Friedrich Steimann [[WG211/M23Steimann \| Relate! Concatenative Relational Programming ]]		* Friedrich Steimann [[WG211/M23Steimann \| Relate! Concatenative Relational Programming ]]

Jeremy-y: Schedule for Tuesday

2024-03-26T01:28:58Z

Schedule for Tuesday

← Older revision		Revision as of 03:28, 26 March 2024
Line 172:		Line 172:

	* 9:00 - 10:30 Two talks		* 9:00 - 10:30 Two talks
			** 9:00 - 9:45 Oleg Kiselyov [[WG211/M23Kiselyov \| The Mysteries of AXPY ]]
			** 9:45 - 10:30 Michael Ballantyne [[WG211/M23Ballantyne \| A language workbench as library ]]
	* 10:30 - 11:00 Break		* 10:30 - 11:00 Break
	* 11:00 - 11:45 One talk		* 11:00 - 11:45 One talk
			** 11:00 -11:45 Colin Gordon [[WG211/M23Gordon \| Synthesizing Effect Systems from Automata ]]
	* 11:45 - 13:00 Lunch		* 11:45 - 13:00 Lunch
	* 13:00 - 14:30 Two talks		* 13:00 - 14:30 Two talks
			** 13:00 - 13:45 Julia Lawall [[WG211/M23Lawall \| Towards Verification of Linux Kernel Code]]
			** 13:45 - 14:30 Yukiyoshi Kameyama [[WG211/M23Kameyama \| Program generation and (lightweight) analysis: case studies on cryptographic implementations ]]
	* 14:30 - 15:00 Break		* 14:30 - 15:00 Break
	* 15:00 - 16:30 Two talks		* 15:00 - 16:30 Two talks
			** 15:00 - 15:45 Martin Kellogg [[WG211/M23Kellogg \| Static Program Reduction via Specification Slicing ]]
			** 15:45 - 1630 Friedrich Steimann [[WG211/M23Steimann \| Relate! Concatenative Relational Programming ]]
	* 18:00 Dinner at [https://vedaphilly.com/ Veda]		* 18:00 Dinner at [https://vedaphilly.com/ Veda]

← Older revision		Revision as of 03:24, 27 March 2024
Line 134:		Line 134:
	* Jeremy Johnson (TBD)		* Jeremy Johnson (TBD)
	* Yukiyoshi Kameyama [[WG211/M23Kameyama \| Program generation and (lightweight) analysis: case studies on cryptographic implementations ]]		* Yukiyoshi Kameyama [[WG211/M23Kameyama \| Program generation and (lightweight) analysis: case studies on cryptographic implementations ]]
			* Ohad Kammar [[WG211/M23Kammar \| Paella: handlers for parameterised algebraic effects ]]
	* Martin Kellogg [[WG211/M23Kellogg \| Static Program Reduction via Specification Slicing ]]		* Martin Kellogg [[WG211/M23Kellogg \| Static Program Reduction via Specification Slicing ]]
	* Oleg Kiselyov [[WG211/M23Kiselyov \| The Mysteries of AXPY ]]		* Oleg Kiselyov [[WG211/M23Kiselyov \| The Mysteries of AXPY ]]
Line 146:		Line 147:
	* Stephanie Weirich [[WG211/M23Weirich \| CBPV + effects + coeffects]]		* Stephanie Weirich [[WG211/M23Weirich \| CBPV + effects + coeffects]]
	* Eric Van Wyk [[WG211/M23VanWyk \| Modular Metatheory for Extensible Languages]]		* Eric Van Wyk [[WG211/M23VanWyk \| Modular Metatheory for Extensible Languages]]
	* Jeremy Yallop ~~(TBD)~~		* Jeremy Yallop [[WG211/M23Yallop \| Rough thoughts on refunctionalization ]]

	We will follow our usual format of interactive talks with an active audience, using 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 meetings shows that it is useful to let the speaker at least finish the 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 speaker 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.		We will follow our usual format of interactive talks with an active audience, using 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 meetings shows that it is useful to let the speaker at least finish the 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 speaker 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.

← Older revision		Revision as of 13:39, 26 March 2024
Line 141:		Line 141:
	* Igor Pikovets [[WG211/M23Pikovets \| OCaml in the Big Data World ]]		* Igor Pikovets [[WG211/M23Pikovets \| OCaml in the Big Data World ]]
	* Sven-Bodo Scholz [[WG211/M23Scholz \| Stream it if you can - not just when your GPU runs out of memory ]]		* Sven-Bodo Scholz [[WG211/M23Scholz \| Stream it if you can - not just when your GPU runs out of memory ]]
	* Ken Shan [[WG211/M23Shan More Efficient Exact Recursive Probabilistic Programming ]]		* Ken Shan [[WG211/M23Shan \| More Efficient Exact Recursive Probabilistic Programming ]]
	* Satnam Singh [[WG211/M23Singh \| Haste: A Haskell DSL for Programming the Groq TSP/LPU Machine Learning Chips ]]		* Satnam Singh [[WG211/M23Singh \| Haste: A Haskell DSL for Programming the Groq TSP/LPU Machine Learning Chips ]]
	* Friedrich Steimann [[WG211/M23Steimann \| Relate! Concatenative Relational Programming ]]		* Friedrich Steimann [[WG211/M23Steimann \| Relate! Concatenative Relational Programming ]]

← Older revision		Revision as of 13:38, 26 March 2024
Line 141:		Line 141:
	* Igor Pikovets [[WG211/M23Pikovets \| OCaml in the Big Data World ]]		* Igor Pikovets [[WG211/M23Pikovets \| OCaml in the Big Data World ]]
	* Sven-Bodo Scholz [[WG211/M23Scholz \| Stream it if you can - not just when your GPU runs out of memory ]]		* Sven-Bodo Scholz [[WG211/M23Scholz \| Stream it if you can - not just when your GPU runs out of memory ]]
	* Ken Shan ~~(TBD)~~		* Ken Shan [[WG211/M23Shan More Efficient Exact Recursive Probabilistic Programming ]]
	* Satnam Singh [[WG211/M23Singh \| Haste: A Haskell DSL for Programming the Groq TSP/LPU Machine Learning Chips ]]		* Satnam Singh [[WG211/M23Singh \| Haste: A Haskell DSL for Programming the Groq TSP/LPU Machine Learning Chips ]]
	* Friedrich Steimann [[WG211/M23Steimann \| Relate! Concatenative Relational Programming ]]		* Friedrich Steimann [[WG211/M23Steimann \| Relate! Concatenative Relational Programming ]]