<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://mw.hh.se/wg211/index.php?action=history&amp;feed=atom&amp;title=WG211%2FM20Kiselyov</id>
	<title>WG211/M20Kiselyov - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://mw.hh.se/wg211/index.php?action=history&amp;feed=atom&amp;title=WG211%2FM20Kiselyov"/>
	<link rel="alternate" type="text/html" href="http://mw.hh.se/wg211/index.php?title=WG211/M20Kiselyov&amp;action=history"/>
	<updated>2026-04-05T19:32:36Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.5</generator>
	<entry>
		<id>http://mw.hh.se/wg211/index.php?title=WG211/M20Kiselyov&amp;diff=2151&amp;oldid=prev</id>
		<title>Jacques: Created page with &quot;Title: Session Types without Sophistry: Practical embedding of DSLs with sophisticated type systems  Abstract: Whereas ordinary types approximate the results, session types ap...&quot;</title>
		<link rel="alternate" type="text/html" href="http://mw.hh.se/wg211/index.php?title=WG211/M20Kiselyov&amp;diff=2151&amp;oldid=prev"/>
		<updated>2020-02-04T18:59:11Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;Title: Session Types without Sophistry: Practical embedding of DSLs with sophisticated type systems  Abstract: Whereas ordinary types approximate the results, session types ap...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;Title: Session Types without Sophistry:&lt;br /&gt;
Practical embedding of DSLs with sophisticated type systems&lt;br /&gt;
&lt;br /&gt;
Abstract:&lt;br /&gt;
Whereas ordinary types approximate the results, session types&lt;br /&gt;
approximate communication among computations.  As a form of typestate,&lt;br /&gt;
they describe not only what is communicated now but also what is to be&lt;br /&gt;
communicated next. Writing session-typed programs in an ordinary&lt;br /&gt;
programming language such an OCaml requires inordinary cleverness to&lt;br /&gt;
simulate type-level computations and linear typing~-- meaning the&lt;br /&gt;
implementation and the error messages are very hard to understand. One&lt;br /&gt;
is constantly reminded of template metaprogramming in C++.&lt;br /&gt;
&lt;br /&gt;
We present a system exploring a very different approach to&lt;br /&gt;
session typing: lowering type-level sophistry to ordinary &lt;br /&gt;
programming, while maintaining the static assurances. Error messages&lt;br /&gt;
are detailed and customizable, and one can use an ordinary debugger to&lt;br /&gt;
investigate session-type problems. Our system is a binary-session--typed&lt;br /&gt;
DSL for service-oriented programming in OCaml, supporting &lt;br /&gt;
multiple communication channels, internal and external&lt;br /&gt;
choices, recursion, and also channel delegation.&lt;br /&gt;
&lt;br /&gt;
The key idea is staging: ordinary run-time checks in the generator&lt;br /&gt;
play the role of `type-checks&amp;#039; from the point of view of the generated&lt;br /&gt;
program. What is a fancy type to the latter is ordinary&lt;br /&gt;
data to the generator.&lt;br /&gt;
&lt;br /&gt;
Joint work with Keigo Imai&lt;/div&gt;</summary>
		<author><name>Jacques</name></author>
	</entry>
</feed>