<feed xmlns='http://www.w3.org/2005/Atom'>
<title>graphql/tests/Language, branch v0.5.0.1</title>
<subtitle>GraphQL implementation in Haskell.
</subtitle>
<link rel='alternate' type='text/html' href='https://git.caraus.tech/graphql/'/>
<entry>
<title>Fix #12</title>
<updated>2019-09-06T05:48:01+00:00</updated>
<author>
<name>Eugen Wissner</name>
<email>belka@caraus.de</email>
</author>
<published>2019-09-06T05:48:01+00:00</published>
<link rel='alternate' type='text/html' href='https://git.caraus.tech/graphql/commit/?id=1704022e744b276e0010f5ff147af1f109d30154'/>
<id>1704022e744b276e0010f5ff147af1f109d30154</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>Escape special characters in the encoded strings</title>
<updated>2019-08-13T05:24:05+00:00</updated>
<author>
<name>Eugen Wissner</name>
<email>belka@caraus.de</email>
</author>
<published>2019-08-13T05:24:05+00:00</published>
<link rel='alternate' type='text/html' href='https://git.caraus.tech/graphql/commit/?id=045b6d15fbf299b5a09a20e3045209d7dcc31908'/>
<id>045b6d15fbf299b5a09a20e3045209d7dcc31908</id>
<content type='text'>
Fixes #2.
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
Fixes #2.
</pre>
</div>
</content>
</entry>
<entry>
<title>Add singleError utility function</title>
<updated>2019-07-23T05:22:32+00:00</updated>
<author>
<name>Eugen Wissner</name>
<email>belka@caraus.de</email>
</author>
<published>2019-07-23T04:04:33+00:00</published>
<link rel='alternate' type='text/html' href='https://git.caraus.tech/graphql/commit/?id=282946560e14a94748b4a0599ac7419c27848c04'/>
<id>282946560e14a94748b4a0599ac7419c27848c04</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>Parse the BOM header if any</title>
<updated>2019-07-22T03:50:00+00:00</updated>
<author>
<name>Eugen Wissner</name>
<email>belka@caraus.de</email>
</author>
<published>2019-07-22T03:50:00+00:00</published>
<link rel='alternate' type='text/html' href='https://git.caraus.tech/graphql/commit/?id=1b5094b6a3e6eb68f67bc3238487818f7b7d552a'/>
<id>1b5094b6a3e6eb68f67bc3238487818f7b7d552a</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>Replace tasty and HUnit with Hspec</title>
<updated>2019-07-10T03:57:35+00:00</updated>
<author>
<name>Eugen Wissner</name>
<email>belka@caraus.de</email>
</author>
<published>2019-07-10T03:57:35+00:00</published>
<link rel='alternate' type='text/html' href='https://git.caraus.tech/graphql/commit/?id=eb40810f25a2ab29e24c64f1e3c82b3b590460c8'/>
<id>eb40810f25a2ab29e24c64f1e3c82b3b590460c8</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>Fix ambigious Int resolution in the lexer tests</title>
<updated>2019-06-26T13:41:30+00:00</updated>
<author>
<name>Eugen Wissner</name>
<email>belka@caraus.de</email>
</author>
<published>2019-06-26T13:41:30+00:00</published>
<link rel='alternate' type='text/html' href='https://git.caraus.tech/graphql/commit/?id=3cc38343dbcbe724fa27807af66189370e4a54ff'/>
<id>3cc38343dbcbe724fa27807af66189370e4a54ff</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>Parse queries with megaparsec</title>
<updated>2019-06-21T08:44:58+00:00</updated>
<author>
<name>Eugen Wissner</name>
<email>belka@caraus.de</email>
</author>
<published>2019-06-21T08:44:58+00:00</published>
<link rel='alternate' type='text/html' href='https://git.caraus.tech/graphql/commit/?id=5e9bf9648d891591fcb1f0e1c7b250fb80b1ddc6'/>
<id>5e9bf9648d891591fcb1f0e1c7b250fb80b1ddc6</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
</feed>
