BACKUS, J.W.: From Function Level Semantics to Program Transformation and Optimization, Mathematical Foundations of Sofware Development, LNCS 185, Springer 1985, pp. 60-91.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Bac78] Particularly, functional programs are shorter and much simpler, that is, easier to understand, than their imperative equivalents. Furthermore, because of referential transparency their semantics have simple mathematical descriptions. Special advantages of FP like languages are [Bac78, Bac85] i) a hierarchic program structure which simplifies understanding of programs and enhances reusability, ii) reasoning on function level (instead of object level) and (iii) an algebra of programs. Items (ii) and (iii) support a fine approach to program verification and optimization [KS81, ....

....Bac85] i) a hierarchic program structure which simplifies understanding of programs and enhances reusability, ii) reasoning on function level (instead of object level) and (iii) an algebra of programs. Items (ii) and (iii) support a fine approach to program verification and optimization [KS81, Bac85, BK90] which lets FP be an excellent candidate for a functional DBPL, since optimization of queries to large databases is of particular interest [JK84] The model we shall present in the following combines the modelling capabilities of semantic data models including complex objects and type ....

[Article contains additional citation context not shown here]

BACKUS, J.W.: From Function Level Semantics to Program Transformation and Optimization, Mathematical Foundations of Sofware Development, LNCS 185, Springer 1985, pp. 60-91.

....redundancies, and later work built on this idea [Rosen et al. 1988] This kind of redundancy elimination is only loosely related to the Thinner project. Many of the problems of the area are unique to imperative programs. 1.2.4 Advanced Functional Optimization. The algebraic approach developed in Backus [1985] is another advanced method of optimization for functional programs. The foundation of this approach is an axiomatic semantics for the language FP. From these axioms Backus proved several theorems about identities: one of these is a recursion removal theorem which justifies a class of ....

Backus, J. 1985. From function level semantics to program transformation and optimization. In Proceedings of the International Joint Conference on Theory and Practice of Software Development, H. Ehrig, C. Floyd, M. Nivat, and J. Thatcher, Eds. Lecture Notes in Computer Science, vol. 185. Springer-Verlag, Berlin, 60--91.

....Scherlis used internal specialization [47] Cohen [12] explicitly addressed classes of redundant recursive calls; Pettorossi [43, 44] exploited tupling. These methods are more systematic but are still either not automatable or not powerful enough to derive many examples. Backus proposed FP [5, 6] where algebraic laws can be used in forming theorems concerning transforming certain program schemas, including recursion removal. Kieburtz and Shultis [29] followed this approach and proved more general theorems, thus allowing the transformation of a bigger class of program schemas. Bauer and ....

J. Backus. From function level semantics to program transformation and optimization. In H. Ehrig et al., editors, Proceedings of the International Joint Conference on Theory and Practice of Software Development, volume 185 of Lecture Notes in Computer Science, pages 60-91. Springer-Verlag, Berlin, Mar. 1985.

....and how FL compares with other functional programming languages. 1 Introduction In his Turing Award paper, John Backus introduced a simple notation for functional programming called FP [Bac78] The initial design of FP underwent considerable evolution in subsequent years [Wil82b, Wil82a, Bac85, HWWW85, HWW86, BWW86, WW88, BWW90, HWW90] culminating in the definition of FL [BWW 89] Since the FL definition in 1989 a substantial implementation effort has been underway at the IBM Almaden Research Center to build an optimizing compiler for and to test the viability of programming in ....

J. Backus. From function level semantics to program transformation and optimization. Technical Report RJ 4567 (49035), IBM, 1985.

....can be split up into small, mind sized pieces. One can define combinators that capture common idioms of program composition. Apart from the aesthetic benefits and the increased readability of programs, employing combinators encourages the formulation of general mathematical results about programs [Bac85] In turn, such results facilitate concise verification of the equivalence of programs. Also, because combinators are defined by the user, they can be tailored to specific applications: for example, to parsing [Hut92b] pretty printing [Hug95] graphical user interfaces [HC95] or capturing ....

J. Backus. From function level semantics to program transformations and optimization. In H. Ehrig, C. Floyd, M. Nivat, and J. Thatcher, editors, Mathematical foundations of software development, Vol. 1, volume 185 of Lecture Notes in Computer Science, pages 60--91. Springer--Verlag, 1985.

No context found.

J. Backus. From function level semantics to program transformation and optimization. In H. Ehrig et al., editors, Proceedings of the International Joint Conference on Theory and Practice of Software Development, volume 185 of Lecture Notes in Computer Science, pages 60--91. Springer-Verlag, Berlin, Mar. 1985.

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