Translation Networks and Function Composition
Pages 261 - 263
Abstract
A notation for specifying translation networks is analyzed and shown to be a special case of a notation for specifying functions. Cancellation of domains and ranges and associativity is derived more simply than in a previous paper by Sklansky, Finkelstein, and Russell.
Reference
[1]
SELANSKY, J., FINKELSTEIN, M., AND RUSSELL, E.C. A formalism for program translation. J. ACM 15, 2 (April 1968), 165--175.
Index Terms
- Translation Networks and Function Composition
Recommendations
Towards the Composition of Specifications in Event-B
The development of a system can start with the creation of a specification. Following this viewpoint, we claim that often a specification can be constructed from the combination of specifications which can be seen as composition. Event-B is a formal ...
Conjunction as composition
Partial specifications written in many different specification languages can be composed if they are all given semantics in the same domain, or alternatively, all translated into a common style of predicate logic. The common semantic domain must be very ...
Comments
Information & Contributors
Information
Published In
Copyright © 1969 ACM.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 April 1969
Published in JACM Volume 16, Issue 2
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 348Total Downloads
- Downloads (Last 12 months)46
- Downloads (Last 6 weeks)11
Reflects downloads up to 04 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in