Functional programming and logical programming for the telegram analysis problem

Authors:
Koji Torii;Yuji Sugiyama;Yoshitomi Morisawa;Tadao Kasami
Affiliations:
-;-;-;-
Venue:
ICSE '84 Proceedings of the 7th international conference on Software engineering
Year:
1984

Citing 5
Cited 1

Software Development: A Rigorous Approach

Software Development: A Rigorous Approach
Algorithms + Data Structures = Programs

Algorithms + Data Structures = Programs
Some design principles and theory for OBJ-O, a language to express and execute algebraic specification for programs

Proceedings of the International Conference on Mathematical Studies of Information Processing
Principles of Program Design

Principles of Program Design
An Algebraic Specification of HDLC Procedures and Its Verification

IEEE Transactions on Software Engineering

A formal adaption method for process descriptions

ICSE '89 Proceedings of the 11th international conference on Software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The telegram analysis problem posed by P. Henderson and R.A. Snowdon has been repeatedly taken into account. This paper adds yet another contribution to this problem. We propose rigorous specification methods, and describe how programs can be derived from those in two different ways. One is from BNF to Definite Clause Grammar in Prolog and the other is a functional programming by which procedural programs can be easily derived from a formal specification in the form of an abstract sequential machine, too. The first method is especially useful for prototyping, and has been applied to file manipulation. The second method has been applied to sorting, file handlers and High Level Data Link Control Procedures.