Functional programming and parallel graph rewriting
著者
書誌事項
Functional programming and parallel graph rewriting
（International computer science series）
Addison-Wesley, c1993
大学図書館所蔵 件 / 全10件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 553-561) and index
内容説明・目次
内容説明
This is an introduction to the techniques of functional programming, the associated computational models and the implementation of functional programming languages on both sequential and parallel machines. The book presents the features of functional programming languages, using Miranda as an example language. It focuses on an alternative computational model - Graph Rewriting Systems. The book demonstrates and discusses the potential power of concurrent functional programming and the implementation on loosely coupled parallel architectures. All the chapters include a summary and exercises.
目次
- Part 1 Functional programming: basic concepts - why functional programming?, functions in mathematics, a functional programme, the evaluation of a functional programme, functions with guarded equations and patterns, data structures, higher order functions and currying, correctness proof of functional programmes, programme examples
- advanced concepts - Miranda - defining functions, pre-defined data structures, the type system, user-defined data structures and their types, the use of functions as basic building blocks, interactive programmes, top-down functional programming. Part 2 Models of computation: Lambda calculus - Lambda expressions, reduction rules of Lambda expressions, reduction sequences and normal forms, properties of Lambda calculus, reduction strategies, properties of subclasses of the Lambda calculus, Lambda calculus as a basis for implementations
- term rewriting systems - TRS's, rewriting with a TRS, reduction sequences and normal forms, properties of TRS's, reduction strategies, orthogonal TRS's, priority rewrite systems, TRS's as a basis for functional languages, TRS's as a basis for implementations
- graph rewriting systems - extending TRS's to GRS's, GRS's, rewriting with a GRS, reduction sequences and normal forms, shorthand form, properties of GRS's, reduction strategies, term graph rewriting, generalized graph rewriting systems, GRS's as a basis for functional languages, GRS's as a basis for implementations. Part 3 Analysis of functional programmes: type assignment systems - type assignment for Lambda calculus, polymorphism and recursion, type assignment for term rewriting systems
- strictness analysis - strictness, abstract interpretation, basic domain theory, strictness analysis using abstract interpretation, analyzing function definitions, analyzing non-flat domains, abstract reduction, strictness analysis using abstract reduction. (Part contents).
「Nielsen BookData」 より
