Peter Holst Andersen

Learn More
One of the remaining problems on the path towards fully automatic partial evaluation is ensuring termination of the specialization phase. In [10] we gave a termination analysis which could be applied to partial evaluation of first-order strict languages, using a new result about inductive arguments (loosely: if whenever something grows, something gets(More)
One of the remaining problems on the path towards fully automatic partial evaluation is ensuring termination of the specialization phase. In [Holst, 1991] we gave a termination analysis which could be applied to partial evaluation of rst-order strict languages, using a new result about inductive arguments (loosely: if whenever something grows, something(More)
Transition Semantics. The abstraction transition semantics, which collects abstract 1-step transitions and compositions of these, is given below. AbsTrans = Fnames Fnames 7! P(SizeDep ) CS : AnnExp! Fenv! AbsTrans CSfi [[Clo(fj ; he1; : : : ; eni)]] = Fk CSfi [[ek]] CSfi [[Clo(fj ; he1; : : : ; eni)]] = Fk CSfi [[ek]] t [hfi; fji 7! hS [[e1]] ; : : :(More)
  • 1