Analysing the implicit complexity of programs
Information and Computation - Special issue: ICC '99
Two-way finite automata with a write-once track
Journal of Automata, Languages and Combinatorics
Quasi-interpretations a way to control resources
Theoretical Computer Science
Course of value distinguishes the intentionality of programming languages
Proceedings of the Second Symposium on Information and Communication Technology
Hi-index | 0.00 |