<?xml version="1.0" encoding="UTF-8"?>
 <rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:cc="http://web.resource.org/cc/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:admin="http://webns.net/mvcb/">
  <channel rdf:about="http://pinboard.in">
    <title>Pinboard (Vaguery)</title>
    <link>https://pinboard.in/u:Vaguery/public/</link>
    <description>recent bookmarks from Vaguery</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="https://sonic-pi.net/"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1205.5975"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1109.0777"/>
	<rdf:li rdf:resource="http://bnl.jayfields.com/04_damp.html"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="https://sonic-pi.net/">
    <title>Sonic Pi - The Live Coding Music Synth for Everyone</title>
    <dc:date>2019-03-26T14:18:38+00:00</dc:date>
    <link>https://sonic-pi.net/</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Sonic Pi

The Live Coding Music Synth for Everyone.

Welcome to the future of music. 

Simple enough for computing and music lessons.
Powerful enough for professional musicians.
Free to download with a friendly tutorial.
Diverse community of over one million live coders.
]]></description>
<dc:subject>music programming domain-specific-language rather-interesting performance open-source to-learn to-write-about consider:genetic-programming</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:aeee5c635a83/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:music"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:domain-specific-language"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:performance"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:open-source"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-learn"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:genetic-programming"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1205.5975">
    <title>[1205.5975] A Domain-Specific Compiler for Linear Algebra Operations</title>
    <dc:date>2012-06-08T15:15:10+00:00</dc:date>
    <link>http://arxiv.org/abs/1205.5975</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["We present a prototypical linear algebra compiler that automatically exploits domain-specific knowledge to generate high-performance algorithms. The input to the compiler is a target equation together with knowledge of both the structure of the problem and the properties of the operands. The output is a variety of high-performance algorithms, and the corresponding source code, to solve the target equation. Our approach consists in the decomposition of the input equation into a sequence of library-supported kernels. Since in general such a decomposition is not unique, our compiler returns not one but a number of algorithms. The potential of the compiler is shown by means of its application to a challenging equation arising within the genome-wide association study. As a result, the compiler produces multiple "best" algorithms that outperform the best existing libraries."]]></description>
<dc:subject>domain-specific-language linear-algebra software-engineering compiler nudge-targets</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:1af4eb618e5e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:domain-specific-language"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:linear-algebra"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:software-engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:compiler"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1109.0777">
    <title>[1109.0777] Efficient and Correct Stencil Computation via Pattern Matching and Static Typing</title>
    <dc:date>2012-01-01T14:25:43+00:00</dc:date>
    <link>http://arxiv.org/abs/1109.0777</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Stencil computations, involving operations over the elements of an array, are a common programming pattern in scientific computing, games, and image processing. As a programming pattern, stencil computations are highly regular and amenable to optimisation and parallelisation. However, general-purpose languages obscure this regular pattern from the compiler, and even the programmer, preventing optimisation and obfuscating (in)correctness. This paper furthers our work on the Ypnos domain-specific language for stencil computations embedded in Haskell. Ypnos allows declarative, abstract specification of stencil computations, exposing the structure of a problem to the compiler and to the programmer via specialised syntax. In this paper we show the decidable safety guarantee that well-formed, well-typed Ypnos programs cannot index outside of array boundaries. Thus indexing in Ypnos is safe and run-time bounds checking can be eliminated. Program information is encoded as types, using the advanced type-system features of the Glasgow Haskell Compiler, with the safe-indexing invariant enforced at compile time via type checking.]]></description>
<dc:subject>domain-specific-language algorithms grid-computing nudge-targets</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:40291523ec3e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:domain-specific-language"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:grid-computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://bnl.jayfields.com/04_damp.html">
    <title>Business Natural Languages - Damp</title>
    <dc:date>2009-05-28T12:41:10+00:00</dc:date>
    <link>http://bnl.jayfields.com/04_damp.html</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["Based on my experience I believe that the DRY rule does not apply to Business Natural Languages. A major reason for using a Business Natural Language is to separate the business logic from the complexities of the under-lying system. When using a Business Natural Language, business users who are the most familiar with the domain can maintain the business logic. To a business user, a Business Natural Language should be no different than a group of phrases that describe the rules for running the business correctly."
]]></description>
<dc:subject>DRY DSL domain-specific-language design software-development user-experience reusablility reuse communicativeness</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:68e6ea6a6aec/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:DRY"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:DSL"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:domain-specific-language"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:software-development"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:user-experience"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:reusablility"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:reuse"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:communicativeness"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>