Décrire et comparer les implantations de langages fonctionnels
作者： Pascal Fradet , Rémi Douence
DOI:
关键词:
摘要: Resume: Nous proposons un cadre formel pour decrire et comparer les implantations de langages fonctionnels. decrivons le processus compilation comme une suite transformations programmes dans fonctionnel. Les choix fondamentaux mise en œuvre ainsi que optimisations s’expriment naturellement des differentes. avantages cette approche sont decomposer structurer la compilation, simplifier preuves correction permettre comparaisons formelles etudiant chaque transformation ou leur composition. nous concentrons ici sur l’appel par valeur trois differentes: Cam [7], Tabac compilateur base [13] version stricte machine Krivine [19].
参考文章(28)
Guy Argo, Improving the three instruction machine Proceedings of the fourth international conference on Functional programming languages and computer architecture - FPCA '89. pp. 100- 115 ,(1989) , 10.1145/99370.99378
Zhong Shao, Andrew W. Appel, Space-efficient closure representations international conference on functional programming. pp. 150- 161 ,(1994) , 10.1145/182409.156783
Geoffrey Burn, Daniel Le Métayer, Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis † Journal of Functional Programming. ,vol. 6, pp. 75- 109 ,(1996) , 10.1017/S0956796800001581
D. A. Turner, A New Implementation Technique for Applicative Languages Software - Practice and Experience. ,vol. 9, pp. 31- 49 ,(1979) , 10.1002/SPE.4380090105
Pascal Fradet, Daniel Le Métayer, Compilation of functional languages by program transformation ACM Transactions on Programming Languages and Systems. ,vol. 13, pp. 21- 51 ,(1991) , 10.1145/114005.102805
M.S. Joy, V.J. Rayward-Smith, F.W. Burton, Efficient combinator code Computer Languages. ,vol. 10, pp. 211- 224 ,(1985) , 10.1016/0096-0551(85)90017-7
Simon L. Peyton Jones, Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine Journal of Functional Programming. ,vol. 2, pp. 127- 202 ,(1992) , 10.1017/S0956796800000319
PETER SESTOFT, Deriving a lazy abstract machine Journal of Functional Programming. ,vol. 7, pp. 231- 264 ,(1997) , 10.1017/S0956796897002712
John Hannan, Dale Miller, From Operational Semantics to Abstract Machines Mathematical Structures in Computer Science. ,vol. 2, pp. 415- 459 ,(1992) , 10.1017/S0960129500001559
P. J. Landin, The Mechanical Evaluation of Expressions The Computer Journal. ,vol. 6, pp. 308- 320 ,(1964) , 10.1093/COMJNL/6.4.308