| Tom Hirschowitz. Modules mixins, modules et recursion etendue en appel par valeur. These de doctorat, Universite Paris 7, 2003. |
.... In work on the compilation of extended recursion (particularly for mixin modules) Hirschowitz, Leroy, and Wells have (independently) used a semantics which is similar to # d save that (a) the language allows more general recursive definitions, and (b) the semantics collapses multiple lets [HLW03, Hir03] It draws on work of Ariola and Blom [AB02] which also collapses let blocks. For rebinding, we need to preserve this structure. There are also similarities with Felleisen and Hieb s syntactic theory of state [FH92] Their # S models late (redex time) resolution of state variables in a ....
Tom Hirschowitz. Modules mixins, modules et recursion etendue en appel par valeur. These de doctorat, Universite Paris 7, 2003.
No context found.
T. Hirschowitz. Modules mixins, modules et recursion etendue en appel par valeur. PhD thesis, University of Paris VII, 2003.
No context found.
Tom Hirschowitz. Modules mixins, modules et recursion etendue en appel par valeur. These de doctorat, Universite Paris 7, 2003.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC