Two-level functional languages
著者
書誌事項
Two-level functional languages
（Cambridge tracts in theoretical computer science, 34）
Cambridge University Press, 2005
- : pbk
大学図書館所蔵 件 / 全1件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Originally published in 1992
"This dgitally printed first paperback version 2005" -- T.p. verso
Includes bibliographical references (p. 285-292) and index
内容説明・目次
内容説明
The authors describe here a framework in which the type notation of functional languages is extended to include a notation for binding times (that is run-time and compile-time) that distinguishes between them. Consequently the ability to specify code and verify program correctness can be improved. Two developments are needed, the first of which introduces the binding time distinction into the lambda calculus, in a manner analogous with the introduction of types into the untyped lambda calculus. Methods are also presented for introducing combinators for run-time. The second concerns the interpretation of the resulting language, which is known as the mixed lambda-calculus and combinatory logic. The notion of 'parametrized semantics' is used to describe code generation and abstract interpretation. The code generation is for a simple abstract machine designed for the purpose; it is close to the categorical abstract machine. The abstract interpretation focuses on a strictness analysis that generalises Wadler's analysis for lists.
目次
- 1. Introduction
- 2. Types made explicit
- 3. Binding-time made explicit
- 4. Combinators made explicit
- 5. Parametrized semantics
- 6. Code generation
- 7. Abstract interpretation
- 8. Conclusions
- Bibliography
- Summary of transformation functions
- Index.
「Nielsen BookData」 より
