On Friday October 17, this site was moved to a new server, https://mw.hh.se. The original address will continue to work. Whithin a week or two this site will return to the original address. /Peo HH IT-dep
WG211/M17Kameyama
From WG 2.11
Jump to navigationJump to search
Environment Classifiers, Revisited.
- Yukiyoshi Kameyama
The classic problem of multi-stage programming -- how to ensure static safety (type safety and scope safety) for generated code, has been solved by Taha an Nielsen who introduced environment classifiers to capture the lexical scope of code variables. In this talk we show that, by refining the notion of environment classifiers, we get static safety for stronger languages with (1) local state, (2) global state, and (3) powerful control operators. In the first two cases (joint work with Oleg Kiselyov) the set of classifiers forms a tree, while in the third case it forms a lattice.
