1974
DOI: 10.1007/bf01762181
|View full text |Cite
|
Sign up to set email alerts
|

Semantic preserving translations

Abstract: Let X1, X2 be derivation systems (free x-categories) generated by context free grammars. Let Xo be a translation category with x-functors fi: Xo --~ X, i = l, 2." Let T be an ~*-theory, a generalization of algebraic theories. Let It: X~ -~ T be algebraic interpretations of the derivations systems, giving the semantics of derivation systems. The translation category Xo is shown to preserve the common semantics through the translation if there is a natural transformation from the functor ]'2 °/2 to the functor f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

1978
1978
1995
1995

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 17 publications
0
4
0
Order By: Relevance
“…[] CLAIM 2. If Z satisfies the conditions of Theorem 6 except for condition (2), then it is undecidable whether rz is a total semanttc-preserving translation. If Z sattsfies the condttions of Theorem 6 except for condition (3), then tt is undecidable whether *z is a total semantic-preservmg translation.…”
Section: Productionmentioning
confidence: 96%
See 2 more Smart Citations
“…[] CLAIM 2. If Z satisfies the conditions of Theorem 6 except for condition (2), then it is undecidable whether rz is a total semanttc-preserving translation. If Z sattsfies the condttions of Theorem 6 except for condition (3), then tt is undecidable whether *z is a total semantic-preservmg translation.…”
Section: Productionmentioning
confidence: 96%
“…Denote the root node oft2 in t by c, and the root node of t~ in t' by d. Thus A(d) ffi c. Since~rt~ ~~r;~ for q = 1, 2, we have 7rt~ (c, a) --~r~(d, a), q = 1, 2, We now prove that ~rt ~ ~r~,. Clearly conditions (1), (2), and (4) of Definition ! i are met.…”
Section: ) If A(a') = a Then A Ttr2(a') = A Ttri(a)mentioning
confidence: 97%
See 1 more Smart Citation
“…In [7], Benson has studied such transformations in a general algebraic framework. For example, it is interesting to simplify the syntactic rules used to describe given objects.…”
Section: Introductionmentioning
confidence: 99%