<?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%2FM13Aldrich</id>
	<title>WG211/M13Aldrich - 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%2FM13Aldrich"/>
	<link rel="alternate" type="text/html" href="http://mw.hh.se/wg211/index.php?title=WG211/M13Aldrich&amp;action=history"/>
	<updated>2026-04-05T21:09:33Z</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/M13Aldrich&amp;diff=1016&amp;oldid=prev</id>
		<title>Christian: Created page with &quot;Programming languages often include specialized notation for common datatypes (e.g. lists) and some also build in support for specific specialized datatypes (e.g. regular express...&quot;</title>
		<link rel="alternate" type="text/html" href="http://mw.hh.se/wg211/index.php?title=WG211/M13Aldrich&amp;diff=1016&amp;oldid=prev"/>
		<updated>2014-03-13T18:41:19Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;Programming languages often include specialized notation for common datatypes (e.g. lists) and some also build in support for specific specialized datatypes (e.g. regular express...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;Programming languages often include specialized notation for common datatypes (e.g. lists) and some also build in support for specific specialized datatypes (e.g. regular expressions), but user-defined types must use general-purpose notations. Frustration with this causes developers to use strings, rather than structured representations, with alarming frequency, leading to correctness, performance, security and usability issues. Allowing developers to modularly extend a language with new notations could help address these issues.  Unfortunately, prior mechanisms either limit expressiveness or are not safely composable: individually-unambiguous extensions can cause ambiguities when used together. We introduce type-specific languages (TSLs): logic associated with a type that determines how generic literal forms, able to contain arbitrary syntax, are parsed and expanded, hygienically, into general-purpose syntax.  The TSL for a type is invoked only when a literal appears where a term of that type is expected, guaranteeing non-interference.  We give evidence supporting the applicability of this approach and specify it with a bidirectional type system for an emerging language, Wyvern.&lt;/div&gt;</summary>
		<author><name>Christian</name></author>
	</entry>
</feed>