Formalization of operations and function definitions in a functional programming language for data structures

Authors:
John C. Thompson;Reza Sanati-Mehrizy
Affiliations:
Electrical Engineering and Computer Science, 202 W. Boyd, Room 219, University of Oklahoma, Norman, OK;Electrical Engineering and Computer Science, 202 W. Boyd, Room 219, University of Oklahoma, Norman, OK
Venue:
CSC '87 Proceedings of the 15th annual conference on Computer Science
Year:
1987

Citing 5
Cited 1

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

Communications of the ACM
Structured data structures

Communications of the ACM
A language for treating graphs

Communications of the ACM
Compiler Design and Construction

Compiler Design and Construction
The Theory of Parsing, Translation, and Compiling

The Theory of Parsing, Translation, and Compiling

Parallel implementation of an extended functional programming language on cellular tree and data flow architectures

SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a method for formalization of operations on certain class of syntactically represented linked Data Structures and then defines a set of functions to perform the operations. The formalization will be done by designing a set of transformation rules which are based on the grammars generating these Data Structures. Rooted in formal language theory, this method of formalization provides a basis for mathematical demonstration of the correctness of the operations. The function definitions are based on the idea of Functional Programming (FP) originated by John Backus. These function definitions will provide more functions for implementation of Extended Functional Programming (EFP) language designed for operations on Data Structures.