1977
DOI: 10.1007/3-540-08342-1_3
|View full text |Cite
|
Sign up to set email alerts
|

Semantics and proof theory of pascal procedures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1978
1978
2019
2019

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(2 citation statements)
references
References 8 publications
(9 reference statements)
0
2
0
Order By: Relevance
“…The notation "B[ t, v ]" and the corresponding recursion rule in Section 6.2.2 are from [3]. The definition of semantics of programs containing procedure calls suggested in Section 6.2 is partially motivated by [ 45).…”
Section: Bibliographical Remarksmentioning
confidence: 99%
“…The notation "B[ t, v ]" and the corresponding recursion rule in Section 6.2.2 are from [3]. The definition of semantics of programs containing procedure calls suggested in Section 6.2 is partially motivated by [ 45).…”
Section: Bibliographical Remarksmentioning
confidence: 99%
“…In [AdB77] it was proposed to model these two parameter mechanisms of Pascal by means of an appropriate syntactic transformation of the procedure body, that was called 'syntactic application'. In what follows we use in the procedure declaration the qualification val to indicate call-by-value and var to indicate call-by-variable.…”
Section: Parameter Mechanisms and Procedures Callsmentioning
confidence: 99%