Anthony J. Field and Peter G. Harrison. Functional Programming. International Series in Computer Science. Addison-Wesley, 1988. (reprinted 1993).  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... paper are also (immediately) applicable in the context of analysis, specialisation, and transformation techniques in general, especially when applied to computational paradigms, such as logic programming, constrained logic programming [25] conditional term rewriting, functional programming [19] and functional logic programming[23, 18] For instance, abstract interpretation techniques usually analyse a set of abstract calls to which new call patterns are continuously added. One thus faces a problem very similar to global termination of partial deduction. We also believe our discussions ....

P. Henderson. Functional Programming: Application and Implementation. International Series in Computer Science. Prentice-Hall, Inc., Englewood Cliffs, N.J., 1980.

.... are also (immediately) applicable in the context of analysis, synthesis, specialisation, and transformation techniques in general, especially when applied to computational paradigms, such as logic programming, constrained logic programming [32] conditional term rewriting, functional programming [26] and functional logic programming[30, 25] For instance, abstract interpretation [10, 11] techniques usually analyse a set of abstract calls to which new call patterns are continuously added. One thus faces a problem very similar to global termination An A 1 Gamma Gamma Psi R ....

P. Henderson. Functional Programming: Application and Implementation. International Series in Computer Science. Prentice-Hall, Inc., Englewood Cliffs, N.J., 1980.

....coherency of boxes and groups are parts of the definitions. These definitions can also be viewed as the specification of an abstract machine with transitions between states. We assume some familiarity with denotational semantics [Sto77, Sch86] or at least higher order functional programming [Hen80, FWH92] To improve the legibility of definitions, we adopt a syntax close to that of a programming language. We expect these denotations to be self explanatory. 3 There can be more than one task if (thunk) forks new tasks The language runs on a network of heterogeneous workstations. A site ....

Peter Henderson. Functional Programming, Application and Implementation. International Series in Computer Science. Prentice-Hall, 1980.

....to a hardware realization. Boyer subsequently rederived this design in a multi chip VLSI implementation [10] Wehrmeister used DDD to derive the control and architecture of a computer based on Landin s SECD machine [73] The initial specification was derived from Henderson s Lisp specification [33]. Another derivation exercise was to derive an implementation of Winkel and Prosser s state machine for playing the dealers hand in a game of Black Jack [41] The experiences gained from these derivation exercises have been invaluable to the understanding of hardware design in a formal framework ....

Peter Henderson. Functional Programming, Application and Implementation. Prentice-Hall, Englewood Cliffs, NJ, 1980. C. A. R. Hoare, Series Editor (international series in computer science). BIBLIOGRAPHY 116

No context found.

Anthony J. Field and Peter G. Harrison. Functional Programming. International Series in Computer Science. Addison-Wesley, 1988. (reprinted 1993).

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