Great! That was pretty fast :)
Are you going to update invertible-syntax to use partial-isomorphisms-0.2?
2011/2/5 Tillmann Rendel
> Hi Ozgur,
>
> Ozgur Akgun wrote:
>
>> I've already implemented a toy example and it worked great. Now I am
>> trying
>> to use your library in a more serious piec
Tillmann,
I've been looking into you packages, very neat ideas and a nice
implementation really.
I've already implemented a toy example and it worked great. Now I am trying
to use your library in a more serious piece of code, and I've realised that
defineIsomorphisms doesn't support record constr
Thanks for all the suggestions, and the great work by Tillmann. I'll have a
look into the paper and the code, and try to see if it suits my needs.
Thanks!
2011/1/26 Tillmann Rendel
> Hi Ozgur,
>
> Ozgur Akgun wrote:
>
>> I can write (separately) a parser and a pretty-printer [...]
>>
>> Is ther
Ozgur Akgun wrote in article
in
gmane.comp.lang.haskell.cafe:
> I working on a DSL represented by a algebraic data type with many
> constructors. I can write (separately) a parser and a pretty-printer for it,
> and I am doing so at the moment. However, this way it feels like repeating
> the sam
Hi Ozgur,
Ozgur Akgun wrote:
I can write (separately) a parser and a pretty-printer [...]
Is there any work to combine the two?
Brent Yorgey wrote:
Maybe take a look at "Invertible Syntax Descriptions: Unifying Parsing
and Pretty Printing" by Tillmann Rendel and Klaus Ostermann from last
year
On 01/26/2011 05:22 PM, Ozgur Akgun wrote:
I working on a DSL represented by a algebraic data type with many
constructors. I can write (separately) a parser and a pretty-printer
for it, and I am doing so at the moment. However, this way it feels
like repeating the same information twice.
Is t
Depending on your concrete syntax, you may be able to use BNFC
(http://hackage.haskell.org/package/BNFC).
/J
On 26 January 2011 17:22, Ozgur Akgun wrote:
> Dear Café,
> I working on a DSL represented by a algebraic data type with many
> constructors. I can write (separately) a parser and a prett
Tillmann Rendel and Klaus Ostermann. "Invertible syntax descriptions: Unifying parsing and pretty printing".Haskell Symposium 2010.Regards,MalcolmOn 26 Jan, 2011,at 04:22 PM, Ozgur Akgun wrote:Dear Café,I working on a DSL represented by a algebraic data type with many constructors. I can write
On Wed, Jan 26, 2011 at 04:22:00PM +, Ozgur Akgun wrote:
> Dear Café,
>
> I working on a DSL represented by a algebraic data type with many
> constructors. I can write (separately) a parser and a pretty-printer for it,
> and I am doing so at the moment. However, this way it feels like repeatin
Dear Café,
I working on a DSL represented by a algebraic data type with many
constructors. I can write (separately) a parser and a pretty-printer for it,
and I am doing so at the moment. However, this way it feels like repeating
the same information twice.
Is there any work to combine the two?
B
10 matches
Mail list logo