scientific article; zbMATH DE number 108369
This work is a famous textbook for a two-terms study course in functional programming. The first term is an introduction on functional programming models of computation and the implementation of functional languages referring to sequential machines architectures. The second term deals with analysis methods for functional programs, concurrent functional programming and the implementation on parallel architectures. The book consists of 17 chapters in five parts. Part 1 (Functional programming) deals with the idea of functional programming as a basis for most functional languages. Here a Miranda oriented advanced language concept is being introduced. Part 2 (Models of computation) demonstrates three different computation models: Lambda-calculus, term-rewriting-systems and graph-rewriting- systems. These models are compared with respect to their ability for functional languages and their implementation. Graph-rewriting-systems will be used later as a basis for implementation. Part 3 (Analysis of functional languages) treats the static analysis of functional programs. Here type assignment systems for the Lambda- calculus, term rewriting and strictness analysis are discussed. A methodology for the analysis in rewriting systems (called abstract reduction) is described. Part 4 (Implementation on sequential architecture) described an implementation method, which uses Miranda as a basis that is then translated into an intermediate language Clean -- a language for functional graph rewriting. The clean-program is then translated into a code for an abstract stack-based machine, which finally can be transformed into the code for a real processor. Thus, the implementation consists of two intermediate levels and three translations. Part 5 (Concurrency issues) shows conceptual and practical possibilities of concurrent evaluation of functional programs. Here the basis is formed by notions in the language Miranda with concurrency. The intermediate language used is Concurrent Clean, a language for parallel graph rewriting. Here used for implementation of an parallel machine model with a loosely coupled architecture. Finally, the implementation is carried out by a concrete parallel target machine which uses transputer processors. Each chapter also offers interesting exercises. The appendices provide Miranda based syntax of example programs, concurrent Clean syntax and library as well as specifications for abstract sequential and parallel machines. ``This textbook is suited for advanced undergraduate students, for postgraduate students of computer science and for researchers interested in the area of functional programming and the implementation techniques on sequential and parallel architectures.
- Strong and NV-sequentiality of constructor systems
- Semantics and strong sequentiality of priority term rewriting systems
- Context-sensitive rewriting strategies
- Relating graph and term rewriting via Böhm models
- Trends in trends in functional programming 1999/2000 versus 2007/2008
- Parallel rewriting of attributed graphs
- Parallel coherent graph transformations
- On modularity in infinitary term rewriting
- Functional programming framework for \textit{GRworkbench}
- From functional programs to interaction nets via the rewriting calculus
- Termination of lazy rewriting revisited
- On term-graph rewrite strategies
- Sharing in the graph rewriting calculus
- Rewriting strategies and strategic rewrite programs
- Three Syntactic Theories for Combinatory Graph Reduction
- From Outermost Termination to Innermost Termination
- Proving Properties of Lazy Functional Programs with Sparkle
- An Introduction to the Lambda Calculus
- Abstract λ-Calculus Machines
- From Interpretation to Compilation
- Termination of Priority Rewriting
- A term-graph clausal logic: completeness and incompleteness results ★
- Distributed computation by graph reduction
- scientific article; zbMATH DE number 4030948 (Why is no real title available?)
- scientific article; zbMATH DE number 4043221 (Why is no real title available?)
- scientific article; zbMATH DE number 44324 (Why is no real title available?)
- The Impact of the Lambda Calculus in Logic and Computer Science
- Graph rewriting semantics for functional programming languages
- Convergence in infinitary term graph rewriting systems is simple
- Strategic port graph rewriting: an interactive modelling framework
- scientific article; zbMATH DE number 194911 (Why is no real title available?)
- Categorical rewriting of term-like structures
- Research directions in parallel functional programming
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description
- Models of the lambda calculus: an introduction
- Tree representations of the quiver \(\widetilde{\mathbb{E}}_6\)
- Tree representations of the quiver \(\widetilde{\mathbb{D}}_m \)
- Lazy rewriting and eager machinery
- Semantics and strong sequentially of priority term rewriting systems
- Recursive Functions with Pattern Matching in Interaction Nets
- On graph rewriting, reduction, and evaluation in the presence of cycles
- Functional programming with graphs
- Singular and plural functions for functional logic programming
- An Ontology of States
- Parallel graph rewriting on loosely coupled machine architectures
- Concrete data structures and functional parallel programming
- The narrowing-driven approach to functional logic program specialization
- A compact fixpoint semantics for term rewriting systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4023829)
