Olivier Danvy. An extensional characterization of lambda-lifting and lambda-dropping. In Middeldorp and Sato [33], pages 241--250.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....n ary sums are reduced to binary sums and n ary products to binary products. For instance, the data declaration is translated to Fix (#List . #A . 1 A List A) Interestingly, the representation of regular types such as List can be improved by applying a technique called lambda dropping [6]: if Fix (#F . #A . T ) is regular, then it is equivalent to #A . Fix (#B . T [ F A : B ] where T [ T 1 : T 2 ] denotes the type term, in which all occurrences of T 1 are replaced by T 2 . For instance, the # dropped version of Fix (#List . #A . 1 A List A) is #A . Fix (#B . 1 A B ) ....

Olivier Danvy. An extensional characterization of lambda-lifting and lambdadropping. In Aart Middeldorp and Taisuke Sato, editors, 4th Fuji International Symposium on Functional and Logic Programming (FLOPS'99), Tsukuba, Japan, volume 1722 of Lecture Notes in Computer Science, pages 241--250. Springer-Verlag, November 1999.

.... T : x 1 : x m : t 11 t 1m1 ) t n1 t nmn ) where t 1 t 0 = 1. For simplicity, n ary sums are reduced to binary sums and n ary products to binary products. Remark 2 The representation of regular types can be improved by applying lambda dropping (Danvy, 1999) on the type level: if f : a:t is regular, then it is equivalent to a: b:t [ f a: b ] where t [ t 1 : t 2 ] denotes the type term, in which all occurrences of t 1 are replaced by t 2 . For instance, the dropped version of List : a:1 a List a is a: b: a:1 a b. Note that the dropped and ....

Danvy, Olivier. (1999). An extensional characterization of lambda-lifting and lambdadropping. Pages 241-250 of: Middeldorp, Aart, & Sato, Taisuke (eds), 4th Fuji international symposium on functional and logic programming (FLOPS'99), Tsukuba, Japan. Lecture Notes in Computer Science, vol. 1722. Springer-Verlag.

No context found.

Olivier Danvy. An extensional characterization of lambda-lifting and lambda-dropping. In Middeldorp and Sato [33], pages 241--250.

....in Section 2 would follow from showing these to be equivalent to the xed point reached by the stepwise algorithms. In an alternative attempt, the rst author has recast the two transformations extensionally, expressing them as transformations on functionals prior to taking their xed point [15]. As already pointed out, several algorithms exist for lambda lifting. Our favorite one is Johnsson s [23] and we designed lambda dropping as its inverse for maximally nested programs. We take equality of programs as syntactic equality, modulo renaming of variables and modulo the ordering of ....

Olivier Danvy. An extensional characterization of lambda-lifting and lambda-dropping. Technical Report BRICS RS-98-2, Department of Computer Science, University of Aarhus, Aarhus, Denmark, January 1998.

....in Section 2 would follow from showing these to be equivalent to the fixed point reached by the stepwise algorithms. In an alternative attempt, the first author has recast the two transformations extensionally, expressing them as transformations on functionals prior to taking their fixed point [15]. As already pointed out, several algorithms exist for lambda lifting. Our favorite one is Johnsson s [23] and we designed lambda dropping as its inverse for maximally nested programs. We take equality of programs as syntactic equality, modulo renaming of variables and modulo the ordering of ....

Olivier Danvy. An extensional characterization of lambda-lifting and lambdadropping. Technical Report BRICS RS-98-2, Department of Computer Science, University of Aarhus, Aarhus, Denmark, January 1998.

....a system in Objective Caml, whose byte code made it possible to remain portable. The system can be used in any situation where strong normalization could be of benefit. Besides the examples mentioned above, we have applied it to type specialization [9] lambda lifting and lambda dropping [10], formatting strings [11] higher order abstract syntax [12] and deforestation [15] We are also considering to apply it for cut elimination in formal proofs, in a proof assistant. We are in the process of extending our implementation for a subset of the Caml module language. This extension ....

Olivier Danvy. An extensional characterization of lambda-lifting and lambdadropping. Technical Report BRICS RS-98-2, Department of Computer Science, University of Aarhus, Aarhus, Denmark, January 1998.

No context found.

Olivier Danvy. An extensional characterization of lambda-lifting and lambdadropping. In Aart Middeldorp and Taisuke Sato, editors, 4th Fuji International Symposium on Functional and Logic Programming (FLOPS'99), Tsukuba, Japan, volume 1722 of Lecture Notes in Computer Science, pages 241--250. SpringerVerlag, November 1999.

No context found.

Olivier Danvy. An extensional characterization of lambda-lifting and lambdadropping. In Aart Middeldorp and Taisuke Sato, editors, 4th Fuji International Symposium on Functional and Logic Programming (FLOPS'99), Tsukuba, Japan, volume 1722 of Lecture Notes in Computer Science, pages 241--250. SpringerVerlag, November 1999.

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