In this paper, we bring together two important ideas in the semantics of Algol-like imperative programming languages. One is that program phrases act on fixed sets of storage locations. The second is that the information of local variables is hidden from client programs. This involves combining sheaf theory and parametricity to produce new classes of sheaves. We define the semantics of an Algol-like language using such sheaves and discuss the reasoning principles validated by the semantics. 1
|
302
|
Introduction to Higher Order Categorical Logic
– Lambek, Scott
- 1986
|
|
266
|
Types, abstraction, and parametric polymorphism
– Reynolds
- 1983
|
|
133
|
The essence of Algol
– Reynolds
- 1981
|
|
114
|
Syntactic control of interference
– Reynolds
- 1978
|
|
103
|
Parametricity and local variables
– O'Hearn, Tennent
- 1995
|
|
86
|
Towards fully abstract semantics for local variables: Preliminary report
– Meyer, Sieber
- 1988
|
|
83
|
A new approach to abstract syntax involving binders
– Gabbay, Pitts
- 1999
|
|
65
|
Relational properties of domains
– Pitts
- 1996
|
|
53
|
Types, abstraction, and parametric polymorphism, part 2
– Ma, Reynolds
- 1992
|
|
49
|
From Algol to polymorphic linear lambda-calculus
– O’Hearn, Reynolds
|
|
43
|
Structural Polymorphism
– Freyd
- 1989
|
|
42
|
A Category-Theoretic Approach to the Semantics of Programming Languages
– Oles
- 1982
|
|
39
|
Syntactic control of interference revisited
– O’Hearn, Takeyama, et al.
- 1995
|
|
39
|
Idealized algol and its specification logic
– Reynolds
- 1997
|
|
35
|
Sheaf semantics for concurrent interacting objects
– GOGUEN
- 1992
|
|
34
|
Categorical models for local names
– Stark
- 1996
|
|
26
|
Algol-like Languages (Two volumes
– O’Hearn, Tennent
- 1997
|
|
21
|
An axiomatic approach to binary logical relations with applications to data refinement
– Kinoshita, O'Hearn, et al.
- 1997
|
|
18
|
Objects and classes in Algol-like languages
– Reddy
- 1998
|
|
15
|
A model for syntactic control of interference
– O'Hearn
- 1993
|
|
13
|
Semantical analysis of specification logic
– Tennent
- 1990
|
|
12
|
Reflexive graphs and parametric polymorphism
– Robinson, Rosolini
- 1994
|
|
11
|
The Semantics of Non-Interference: A Natural Approach
– O'Hearn
- 1990
|
|
9
|
Constructive sheaf semantics
– Palmgren
- 1997
|
|
7
|
Semantical analysis of specification logic, part 2
– O'Hearn, Tennent
- 1993
|
|
6
|
Lambda definability with sums via Grothendieck logical relations
– Fiore, Simpson
- 1999
|
|
6
|
Observable properties of higher-order functions that dynamically create local names, or: What’s new
– Pitts, Stark
- 1993
|
|
2
|
A topos-theorist looks at dilators
– Johnstone
- 1989
|
|
1
|
Prelim proposal
– Dunphy
- 2000
|
|
1
|
Relational sheaves and predicate intuitionistic modal logic
– Hilken
- 1999
|
|
1
|
where U is the minimal equivalence relation containing U which is defined as follows: f 0 U f 1 iff there exists
– unknown authors
|
|
1
|
where P is the minimal equivalence relation containing P which is defined as follows: ' P / iff / is an edge morphism of the form P ! I W ! R for some vertex W such that
– unknown authors
|
