Artem Pelenitsyn
  • Member for 11 years, 3 months
  • Last seen more than a month ago
12 answers
41 votes
2k views
Gröbner bases in TCS?
15 votes

There is an interesting Springer volume on applications of Gröbner bases in coding and cryptography: Gröbner Bases, Coding, and Cryptography, / Sala, M.; Mora, T.; Perret, L.; Sakata, S.; Traverso, C....

View answer
6 answers
19 votes
1k views
Which models of computation can be expressed through grammars?
6 votes

Furthermore, could we build Turing-complete programs by specifying grammars…? I'm not sure if I correctly understood your question, but if you're looking for a programming language based on a kind of ...

View answer
1 answers
4 votes
435 views
Featherweight Generic Java formalization in Coq
3 votes

I guess somewhat more realistic task would be to find Coq's formalisation of FJ itself (probably with some extensions, but not necessarily FGJ). The one which I googled easily is: Encoding ...

View answer