Programming Methodology, Other Programming Languages, General & Miscellaneous Computing
Log in to track your reading progress.
Overview
Programming languages may be classified into procedural languages, for which programs are directly described using sequences of actions to be performed and declarative languages, for which programs are a set of mathematical object definitions, functions and relations without any reference to computational methods. Implementations of procedural languages have received much attention. This is essentially due to the fact that procedural languages allow their users to ensure efficiency by specifying the desired computation in detail. There are now well-understood standard techniques for scanning, parsing, symbol table and code generation for such languages. However, a soundness proof of procedural programs is rarely an easy task!On the other hand, declarative languages have the potential for extremely simple semantics. It is based on traditional semantics of mathematical expressions. Hence, soundness proof of carefully designed declarative programs is almost always an easy task! This characteristic is very attractive and tends to compensate for the efficiency loss of declarative language implementations.In this book, Implementation of Term Rewriting-Based Programming Languages , we detail an ensemble of methods and techniques for efficient implementation of declarative languages.Book Details
Published
January 1, 2003
Publisher
Nova Science Publishers, Incorporated
Pages
135
Format
Hardcover
ISBN
9781590336458