Higher-Order and Symbolic Computation, 14(1)5
EditorialOlivier Danvy and Carolyn Talcott
|
This issue of HOSC is composed of three contributed articles."A
Generic Reification Technique for Object-Oriented Reflective
Languages" describes how to transform non-reflective interpreters into
reflective ones allowing per-object reflection. Douence and
Südholt's selective reification technique is geared to tailoring
dedicated Meta-Object Protocols for each application. "Functional Differentiation of Computer Programs" describes tools for computational differentiation expressed as functional programs. On the ground that scientific computing requires more abstract constructions than plain arithmetic, Karczmarczuk exploits the expressive power of lazy functional programming for the differential calculus, thus building a bridge between two distinct areas. "A Per Model of Secure Information Flow in Sequential Programs" builds on the observation that a binding-time analysis is similar to a security analysis based on information flow. Based on Hunt and Sands's per model of binding-time analysis, Sabelfeld and Sandsshow that the soundness condition of binding-time analysis provides a model for secure information flow in the case of deterministic programs. They also extend the per model to handle information flow in nondeterministic and probabilistic programs. |
![[picture of journal cover]](../LISP.JPG)