| E. Pasalic, W. Taha, and T. Sheard. Tagless staged interpreters for typed languages. In International Conference on Functional Programming (ICFP), pages 218--229, New York, NY, USA, 2002. ACM Press. |
No context found.
Emir Pasalic, Walid Taha, and Tim Sheard. Tagless staged interpreters for typed languages. In the International Conference on Functional Programming (ICFP '02), Pittsburgh, USA, October 2002. ACM.
No context found.
Emir Pasalic, Walid Taha, and Tim Sheard. Tagless staged interpreters for typed languages. In the International Conference on Functional Programming (ICFP '02), Pittsburgh, USA, October 2002. ACM.
No context found.
Emir Pasalic, Walid Taha, and Tim Sheard. Tagless staged interpreters for typed languages (formal development). Technical Report 02-006, OGI, 2002. Available from [33].
No context found.
Emir Pasalic, Walid Taha, and Tim Sheard. Tagless staged interpreters for typed languages. In the International Conference on Functional Programming (ICFP '02), Pittsburgh, USA, October 2002. ACM.
No context found.
Emir Pasalic, Walid Taha, and Tim Sheard. Tagless staged interpreters for typed languages. In the International Conference on Functional Programming (ICFP '02), Pittsburgh, USA, October 2002. ACM.
No context found.
Emir Pasalic, Walid Taha, and Tim Sheard. Tagless staged interpreters for typed languages. In Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP-02)., pages 218--229, Pittsburgh, PA., October 4--6 2002. ACM Press.
....even more work than deconstructing tagged values. However, with staging all these overheads are performed in the first stage, and an overhead free term is generated for execution in a later stage. Staging violations are prevented in a standard way by Meta D s type system (See technical report [34]) The staging constructs are those of Davies [10] with the addition of cross stage persistence [55] We refer the reader to these references for futher details on the nature of staging violations. Adding a run construct along the lines of previous works [51, 30] was not considered here. Now we ....
....to save on space (and rely on incomplete case expressions instead) This feature is restricted to ground types whose value can be shown equal at runtime. Due to space limination we omit this approach here, but define an alternative type checking function in the accompanying technical report[34]. fun envEvalS (e : Env) 1 = case e of EmptyE = unit ExtE e2 t = envEvalS e2, code (typEval t) fun evalS (e : Env) rho: envEvalS e) s : Exp) t : Typ) j : J(e,s,t) code (typEval t) case j of JN e1 n1 = n1 . JV e1 t1 = #2(rho) JW e1 t1 t2 i j1 = evalS e1 (#1(rho) ....
[Article contains additional citation context not shown here]
Emir Pasalic, Walid Taha, and Tim Sheard. Tagless staged interpreters for typed languages (formal development). Technical Report 02-006, OGI, 2002. Available from [33].
No context found.
E. Pasalic, W. Taha, and T. Sheard. Tagless staged interpreters for typed languages. In International Conference on Functional Programming (ICFP), pages 218--229, New York, NY, USA, 2002. ACM Press.
No context found.
Emir Pasalic, Walid Taha, and Tim Sheard. Tagless staged interpreters for typed languages. In Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP-02)., pages 218--229, Pittsburgh, PA., October 4--6 2002. ACM Press.
No context found.
Emir Pasalic, Walid Taha, and Tim Sheard. Tagless staged interpreters for typed languages. In The International Conference on Functional Programming (ICFP '02), Pittsburgh, USA, October 2002. ACM.
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