Peter Ljunglöf

Results 34 comments of Peter Ljunglöf

> my understanding is that `pgf` would become a dependency of `gf`, so that Haskell projects wouldn't need to specify the whole `gf` as a dependency in order to simply...

Please voice your opinions here! Just tagging some GF people, but everyone is of course welcome: @aarneranta @krangelov @Thomas-H @johnjcamilleri @inariksit @odanoburu

Thinking a bit more, and came to the following modification to (2): 2b. Keep intensional semantics, but disallow `variants{}` completely. Further: let the semantics of `nonExist` be extensional (as in...

> And I just have one strong opinion, which is: backward compatibility (...) So my definite vote is to keep the current behaviour of variants, |, and nonExist, as it...

Just three more things: 1. I still think we should disallow `variants{}` anywhere except on the top-level!. This is because the meaning of this: lin a1 = {s1 = "a1";...

Thanks for the clarification, I didn't know about that paper! > For backwards compatibility, however, it is better not to restrict the use of empty variants in other places. But...

Looking into the source code: ``` getMeta :: MetaId -> TcM s (MetaValue s) getMeta i = TcM (\abstr k h ms -> case IntMap.lookup i ms of Just mv...

And here's another example (by Krasimir from issue #37): lin ... = ... let x = "a" | "b" in x ++ x results in `{"aa", "ab", "ba", "bb"}` while...

That's exactly what I meant. I think. Also: all of the current export formats (except Haskell concrete syntax) are on the PGF grammar, but it's sometimes more useful to print...

I made a very quick abstract syntax for canonical GF. I.e., what's left after compilation and partial evaluation, or what `batchCompile` is returning here: https://github.com/GrammaticalFramework/gf-core/blob/f32d222e7120b2cdbcf7959f2230d01588ee1aa0/src/compiler/GF/Compiler.hs#L47-L52 I know that I'm skipping...