User loginNavigation 
Refining Structured Type SystemThis is my first more serious paper on Structured Type System.
In short, we use BNFish grammars as types for function parameters and function results. Some nice constructions can be made by combining grammars and functions. One of the most important properties of structured type system is its ability to additionally extend grammars outside the grammars definitions, all based on function result types. It is fairly simple: where a certain type of expression is expected, there a grammar that results with the same type can be used, and there goes syntax extensibility. Conveniently, we can combine grammar definitions and their inputs in the same source code file. I was hoping to get some feedback and critics from this community before attempting to get more publicity to the paper. This is an important milestone to me and I want to thank You all for being so inspirational community during my research. By Ivan Vodišek at 20170209 23:07  LtU Forum  previous forum topic  next forum topic  other blogs  2594 reads

Browse archivesActive forum topics 
Recent comments
4 hours 31 min ago
4 hours 45 min ago
5 hours 34 min ago
6 hours 9 min ago
7 hours 19 min ago
8 hours 28 min ago
13 hours 24 sec ago
15 hours 10 min ago
1 day 4 hours ago
1 day 8 hours ago