Olivier Danvy and Kristoffer Hgsbro Rose. Higher-order rewriting and partial evaluation. In Tobias Nipkow, editor, Rewriting Techniques and Applications, Lecture Notes in Computer Science, Kyoto, Japan, March 1998. SpringerVerlag. Extended version available as the technical report BRICS-RS-97-46.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....cannot fail due to type mismatches. There are many approaches to define the semantics of Lambdamix style specializers, based on denotational semantics [22, 21] operational semantics [27] logical frameworks [26] modal and temporal logics [16, 15] category theory [35] and higher order rewriting [14]. We add a further color to this palette by employing type theory as a semantic foundation. Our plan is as follows: ffl define the static semantics by translating an annotated expression into a term in a suitable type theory; ffl obtain the specialized expression by applying an extraction ....

Olivier Danvy and Kristoffer Rose. Higher-order rewriting and partial evaluation. In Rewriting Techniques and Applications: 9th International Conference, RTA '98, Lecture Notes in Computer Science, Tsukuba, Japan, April 1998. Springer-Verlag.

No context found.

Olivier Danvy and Kristoffer Hgsbro Rose. Higher-order rewriting and partial evaluation. In Tobias Nipkow, editor, Rewriting Techniques and Applications, Lecture Notes in Computer Science, Kyoto, Japan, March 1998. SpringerVerlag. Extended version available as the technical report BRICS-RS-97-46.

.... Sabry and Felleisen have documented such an approach [2, 19, 20, 21] Furthermore, it turns out that CPS transformation and administrative reductions can be integrated into one, higher order, rewriting system that directly produces a CPS program without administrative redexes, in one pass [1, 6, 8, 23]: Let us revisit the simple example above, using Figure 2. k:k x: k:x x k We consider this higher order CPS transformation here, as displayed in Figure 2, where it is phrased to match the syntactic domains of Sections 2.1 and 2.2. The one pass CPS transformation requires ....

Olivier Danvy and Kristoer Hgsbro Rose. Higher-order rewriting and partial evaluation. In Tobias Nipkow, editor, Rewriting Techniques and Applications, Lecture Notes in Computer Science, Kyoto, Japan, March 1998. Springer-Verlag. Extended version available as the technical report BRICS-RS-97-46.

No context found.

Olivier Danvy and Kristoffer Hgsbro Rose. Higher-order rewriting and partial evaluation. In Tobias Nipkow, editor, Rewriting Techniques and Applications, Lecture Notes in Computer Science, Kyoto, Japan, March 1998. Springer-Verlag. Extended version available as the technical report BRICS-RS-97-46.

.... term into a multiset of the size of subterms in compositional positions (with left hand side symbols adding all subterms and multiplying by the largest number of copies) rewriting always decreases this multiset in the well founded multiset ordering [8] details in the full version of this article [6]) Now we can characterize the program transformers under consideration. 4.1.3. Definition. A derivor is an orthogonal and compositional constructor CRS where the normal forms contain only constructors. 4.1.4. Theorem. Derivors are convergent. Proof. Use Theorem 3.1.5 and Lemma 4.1.2. With this ....

....that is insensitive to evaluation order [20] It is interesting to compiler writers because transforming a program into CPS makes it sequential in a way that facilitates code generation. Here we merely formalize one published CPS transformation [4] details in the full version of this article [6]) 4.2.1. Definition (Call by Value CPS transformation) The eager, or Call by Value, CPS transformation can be expressed as a derivor over the two sorted syntax v : x (10) e : v j x:e j e 0 e 1 j x:e j e 0 e 1 j CPS1 (e) j hei (11) the first sort just contains variables) with rules CPS1 ....

Olivier Danvy and Kristoffer Høgsbro Rose. Higher-order rewriting and partial evaluation. Technical Report BRICS RS-97-46, Department of Computer Science, University of Aarhus, Aarhus, Denmark, December 1997.

.... fflffl Sabry and Felleisen have documented such an approach [2,19 21] Furthermore, it turns out that CPS transformation and administrative reductions can be integrated into one, higher order, rewriting system that directly produces a CPS program without administrative redexes, in one pass [1,6,8,23]: DS AGF actual reductions ED Fnan Fnan fflffl CPS transformation administrative reductions Fnan Fnan CPS BCED actual reductions GF Fnan Fnan fflffl Let us revisit the simple example above, using Figure 2. x:x x] DRoot = k:k x:k:x x k We consider this higher order CPS ....

Olivier Danvy and Kristoffer Høgsbro Rose. Higher-order rewriting and partial evaluation. In Tobias Nipkow, editor, Rewriting Techniques and Applications, Lecture Notes in Computer Science, Kyoto, Japan, March 1998. SpringerVerlag. Extended version available as the technical report BRICS-RS-97-46.

.... ## ## Sabry and Felleisen have documented such an approach [2,18 20] Furthermore, it turns out that CPS transformation and administrative reductions can be integrated into one, higher order, rewriting system that directly produces a CPS program without administrative redexes, in one pass [1,5,7,22]: DS #### actual reductions ## ## CPS transformation administrative reductions ## CPS #### actual reductions ## ## We consider this higher order CPS transformation here, as displayed in Figure 2, where it is phrased to match the syntactic domains of Sections 2.1 and 2.2. The one pass ....

Olivier Danvy and Kristoer Hgsbro Rose. Higher-order rewriting and partial evaluation. In Tobias Nipkow, editor, Rewriting Techniques and Applications, Lecture Notes in Computer Science, Kyoto, Japan, March 1998. SpringerVerlag. Extended version available as the technical report BRICS-RS-97-46.

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