Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

High-order language

See High-Order Language (HOL) for additional related information. [Pg.39]

It looks simple to introduce GNDL in the family of repetitive sentences found in high level languages. So we feel that a claim in this direction to language and compiler builders can be made here. Some immediate computational benefits in order to construct really general programs may be obtained. [Pg.232]

The design of feedback controllers in the frequency domain is the subject of this chapter. The Chinese language that we learned in Chap. 12 is now put to use to tune controllers. Frequency-domain methods are widely used because they have the significant advantage of being easier to use for high-order systems than the time- and Laplace-domain methods. [Pg.455]

A compact and short example in order to illustrate nested summations usefulness, programmed using a hybrid Fortran 90 high level language follows ... [Pg.142]

To make an oscillator from an amplifier requires, in the language of electronics, positive feedback. In lasers this is provided by the active medium being between two mirrors, both of them highly reflecting but one rather less so in order to allow some of the stimulated radiation to leak out and form the laser beam. The region bounded by the mirrors is called the laser cavity. Various mirror systems are used but that shown in Figure 9.1, consisting of... [Pg.337]

More specifically, the basic notions of a Turing Machine, of computable functions and of undecidable properties are needed for Chapter VI (Decision Problems) the definitions of recursive, primitive recursive and partial recursive functions are helpful for Section F of Chapter IV and two of the proofs in Chapter VI. The basic facts regarding regular sets, context-free languages and pushdown store automata are helpful in Chapter VIII (Monadic Recursion Schemes) and in the proof of Theorem 3.14. For Chapter V (Correctness and Program Verification) it is useful to know the basic notation and ideas of the first order predicate calculus a highly abbreviated version of this material appears as Appendix A. [Pg.6]


See other pages where High-order language is mentioned: [Pg.2298]    [Pg.39]    [Pg.206]    [Pg.2298]    [Pg.39]    [Pg.206]    [Pg.233]    [Pg.35]    [Pg.13]    [Pg.46]    [Pg.13]    [Pg.78]    [Pg.230]    [Pg.238]    [Pg.117]    [Pg.616]    [Pg.138]    [Pg.46]    [Pg.536]    [Pg.45]    [Pg.63]    [Pg.80]    [Pg.228]    [Pg.233]    [Pg.7]    [Pg.334]    [Pg.1422]    [Pg.20]    [Pg.97]    [Pg.117]    [Pg.2648]    [Pg.41]    [Pg.233]    [Pg.288]    [Pg.223]    [Pg.504]    [Pg.682]    [Pg.55]    [Pg.54]   
See also in sourсe #XX -- [ Pg.206 ]




SEARCH



High-order

© 2024 chempedia.info