User loginNavigation 
Formalizing a minimal subset of concatenative languagesI've read a bit about concatenative languages and how they can be modeled, but they seem to take a mostly informal tone. I'd like to change that, so I wrote the beginnings of a formalism on a tiny subset of concatenative languages. It's available here (the important parts are in monospaced font after an introduction). This is heavily based on existing work, which I reference. The main thing I'm wondering about is, how can I make this mathematically rigorous and prove that the combinators Well, the question of Turingcompleteness may be a bit academic. Another issue of concern relates to type systems. If a set of type rules is defined on a language, how can it be shown that those rules are consistent with the operational semantics? I think a minimal set of combinators would be an optimal base for a correct type system, but I'm not sure. By Daniel Ehrenberg at 20070423 02:50  LtU Forum  previous forum topic  next forum topic  other blogs  5135 reads

Browse archivesActive forum topics 
Recent comments
9 hours 42 min ago
2 days 12 hours ago
2 days 13 hours ago
2 days 14 hours ago
2 days 15 hours ago
2 days 23 hours ago
3 days 6 hours ago
3 days 7 hours ago
4 days 8 hours ago
4 days 15 hours ago