Paper Info
Title
Functional programming and logical programming for the telegram analysis problem
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.
Year
Venue
Keywords
1984
ICSE
different way,definite clause grammar,control procedures,telegram analysis problem,p. henderson,rigorous specification method,formal specification,logical programming,functional programming,high level data link,abstract sequential machine,user interfaces,high level data link control,knowledge based systems
Field
DocType
ISBN
Functional reactive programming,Functional logic programming,Procedural programming,Programming language,Horn clause,Programming paradigm,Definite clause grammar,Computer science,Inductive programming,Theoretical computer science,Declarative programming
Conference
0-8186-0528-6
Citations 
PageRank 
References 
4
0.72
4
Authors
4
Name
Order
Citations
PageRank
Koji Torii117927.24
Yuji Sugiyama251.41
Yoshitomi Morisawa392.34
Tadao Kasami4751131.11