## User login## Navigation |
## archives## Refining Structured Type SystemThis is my first more serious paper on Structured Type System.
In short, we use BNF-ish 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. |
## Browse archives## Active forum topics |

## Recent comments

7 hours 47 min ago

8 hours 15 min ago

10 hours 17 min ago

13 hours 44 min ago

21 hours 58 sec ago

22 hours 27 min ago

1 day 10 hours ago

1 day 10 hours ago

1 day 11 hours ago

2 days 7 hours ago