Translation Networks and Function Composition
TL;DR: Cancellation of domains and ranges and associativity is derived more simply than in a previous paper by Sklansky, Finkelstein and Russell.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Unified operating system for distributed computing
Dave M. Duggal,William J. Malyk,Manfred R. Koethe +2 more
- 26 Jan 2017
TL;DR: In this paper, a real-time event is detected and context is determined based on the real time event, and an application model is fetched based on context and meta-data associated with the realtime event, including pre-condition and post-condition descriptors.
6
References
A Formalism for Program Translation
J. Slansky,M. Finkelstein +1 more
TL;DR: The formalism is shown to be capable of concisely and clearly representing the overall tasks of assemblers and preprocessors, and checking for similarities or equivalences among translation networks, and reducing translation networks to smaller entities.
17
Related Papers (5)
Jonathan P. Bowen
- 01 Jan 2001
Edmund Grimley-Evans,George Anton Kiraz,Stephen Pulman +2 more
- 05 Aug 1996
W. M. Beynon
- 01 Sep 1983