1998
DOI: 10.1590/s0104-65001998000200002
|View full text |Cite
|
Sign up to set email alerts
|

Procedures and Recursion in the Refinement Calculus

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1999
1999
2007
2007

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…In this respect, (pds • c) is regarded as a context: a function of parametrised commands to parametrised commands. Its application to a parametrised command pc, with the same extended parameter declaration, yields the result of substituting pc for the occurrences of m in c. Its fixed point is associated in the environment with all classes N that inherit m from N. This approach is similar to that in [1,10].…”
Section: Programsmentioning
confidence: 99%
“…In this respect, (pds • c) is regarded as a context: a function of parametrised commands to parametrised commands. Its application to a parametrised command pc, with the same extended parameter declaration, yields the result of substituting pc for the occurrences of m in c. Its fixed point is associated in the environment with all classes N that inherit m from N. This approach is similar to that in [1,10].…”
Section: Programsmentioning
confidence: 99%
“…This approach is also used in Back's work and [CSW98] to deal with recursive parameterized procedures. We forbid mutual recursion so that fixpoints can be taken separately for each method.…”
Section: Programs and Methods Callsmentioning
confidence: 99%