论文信息 - On Introducing Higher Order Functions in ABEL

On Introducing Higher Order Functions in ABEL

We discuss how the 1'st order specification and programming language ABEL could be extended with higher order functions. Several issues arise, related to subtyping, parameterization, strictness of generators and defined functions, and to the choice between lambda expressions and currying. The paper can be regarded as an exercise in language design: how to introduce higher order functions under the restrictions enforced by (1'st order) ABEL. A technical result is a soundness proof for covariant subtype replacement, useful when implementing data types under volume constraints imposed by computer hardware.

Bjørn Kristoffersen | Ole-Johan Dahl | O. Dahl | Bjørn Kristoffersen

[1] Ole-Johan Dahl. Verifiable programming , 1992, Prentice Hall international series in computer science.

[2] Olaf Owe,et al. Preliminary Report on the Specification and Programming Language Abel , 1987 .

[3] Thomas Johnsson,et al. Lambda Lifting: Treansforming Programs to Recursive Equations , 1985, FPCA.

[4] Olaf Owe,et al. Subtyping and Constructive Specification , 1998, Nord. J. Comput..

[5] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .

[6] J. Roger Hindley,et al. Introduction to combinators and λ-calculus , 1986, Acta Applicandae Mathematicae.

[7] Editors , 1986, Brain Research Bulletin.

[8] Dale Miller,et al. A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification , 1991, J. Log. Comput..

[9] Maribel Fernández,et al. Strong Normalization of Typeable Rewrite Systems , 1993, HOA.

[10] Frank Pfenning,et al. Refinement types for ML , 1991, PLDI '91.

[11] Olaf Owe,et al. On the use of subtypes in ABEL , 1995 .

[12] John Hughes,et al. Why Functional Programming Matters , 1989, Comput. J..

[13] J. Goguen. Higher-order functions considered unnecessary for higher-order programming , 1990 .