Extending the implementation scheme of functional programming system FP for supporting the formal software development methodology

Authors:
Qiming Chen
Affiliations:
Research Institute of Surveying and Mapping, Peking, China
Venue:
ICSE '85 Proceedings of the 8th international conference on Software engineering
Year:
1985

Citing 6
Cited 3

Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Abstract data types and the development of data structures

Communications of the ACM
Abstract data types and software validation

Communications of the ACM
The Algebra of Functional Programs: Function Level Reasoning, Linear Equations, and Extended Definitions

Proceedings of the International Colloquium on Formalization of Programming Concepts
Function level programs as mathematical objects

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
FP with data abstraction and strong typing

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture

A rule-based object/task modelling approach

SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
An object/task modleing approach based on domain knowledge and control knowledge representation

ACM '86 Proceedings of 1986 ACM Fall joint computer conference
The Management of Dynamically Distributed Database Windows (Extended Abstract)

VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

An extension to the implementation scheme of functional programming system FP is proposed for handling multiple order operations at function level. The concepts of Functional Form Operator (FFO), Nth order applications, and invariant semantics of functional forms are introduced. An FFO can be taken as either an operator at function level, or a variable of other operations for building new FFO's. Thus variable-free operators can be defined for mappings from a list of functions to a new function denoted by a functional form, or from a list of FFO's to a new one. Together with the notion of multi-order applications, a hierarchy of operations at function level can be handled. This approach is useful for supporting the formal software development methodology characterized by top-down functional specification, bottom-up function mapping construction and stepwise validation.