17th Annual Symposium on Foundations of Computer Science (Sfcs 1976) 1976
DOI: 10.1109/sfcs.1976.5
|View full text |Cite
|
Sign up to set email alerts
|

An algebraic formulation of knuthian semantics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

1
1
0

Year Published

1980
1980
1981
1981

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 14 publications
1
1
0
Order By: Relevance
“…This paper is based on and continues the work of Duske e.a. [1][2][3][4][5][6][7][8][9][10]. Our results answer the question (which we asked ourselves when reading El0-]) whether both the L and the 1 S restriction are necessary in their characterization result.…”
Section: Introductionsupporting
confidence: 55%
See 1 more Smart Citation
“…This paper is based on and continues the work of Duske e.a. [1][2][3][4][5][6][7][8][9][10]. Our results answer the question (which we asked ourselves when reading El0-]) whether both the L and the 1 S restriction are necessary in their characterization result.…”
Section: Introductionsupporting
confidence: 55%
“…for every tree t=t(a~, ..., a,,), re>O, cb contains the function f,: V'~V such that f(tl .... , t,,)= t(tl,..., t,,). For a still more formal description see [7].…”
Section: Trees and Stringsmentioning
confidence: 99%