(Enter summary)
Abstract: A system of hierarchical, fully recursive types in a truly imperative language allows program fragments written for small types to be reused for all larger types. To exploit this property to enable type-safe hierarchical procedures, it is necessary to impose a static requirement on procedure calls. We introduce an example language and prove the existence of a sound requirement which preserves static correctness while allowing hierarchical procedures. This requirement is further shown to be... (Update)
Context of citations to this paper: More
...formal parameter types are equal then the corresponding two actual parameter types must be equal as well. This parallels the developments in [28, 29]. proc swap(inout x,y: object) var t: object begin t: x; x: y; y: t end Figure 15: Swap procedure. class order var value: object...
...automata provide finite representations of L trees. The idea of representing a regular tree as an automaton is also exploited in [51, 52]. All later algorithms will in reality work on such automata. Proposition 5.3: The partial order v is decidable. Proof: The algorithm is a...
Cited by: More
Interpretations of Recursively Defined Types - Schwartzbach
(Correct)
Types and Automata - Schwartzbach, Schmidt (1990)
(Correct)
Static Typing for Object-Oriented Programming - Palsberg, Schwartzbach (1994)
(Correct)
Active bibliography (related documents): More All
1.1: Static Correctness of Hierarchical Procedures - Schwartzbach (1990)
(Correct)
0.3: Tree Schemata and Fair Termination - Laurent Mauborgne Liens
(Correct)
0.2: Type Substitution for Object-Oriented Programming - Palsberg, Schwartzbach (1990)
(Correct)
Similar documents based on text: More All
0.3: Making Type Inference Practical - Oxhoj, Palsberg, Schwartzbach (1992)
(Correct)
0.3: Object-Oriented Type Inference - Palsberg, Schwartzbach (1991)
(Correct)
0.3: Three Discussions on Object-Oriented Typing - Palsberg, Schwartzbach (1992)
(Correct)
Related documents from co-citation: More All
3: An imperative type hierarchy with partial products (context) - Schmidt, Schwartzbach - 1989
2: Smalltalk-80: The Language and Its Implementation (context) - Adele, David - 1983
2: The Beta programming language (context) - Kristensen, Madsen et al. - 1987
BibTeX entry: (Update)
Michael I. Schwartzbach. Static correctness of hierarchical procedures. In Proc. International Colloquium on Automata, Languages, and Programming 1990, pages 32--45. Springer-Verlag (LNCS 443), 1990. http://citeseer.ist.psu.edu/article/schwartzbach90static.html More
@article{ schwartzbach96static,
author = "Michael I. Schwartzbach",
title = "Static correctness of hierarchical procedures",
journal = "Theoretical Computer Science",
volume = "156",
number = "1--2",
pages = "177--201",
year = "1996",
url = "citeseer.ist.psu.edu/article/schwartzbach90static.html" }
Citations (may not include all citations):
114
Fundamental Properties of Infinite Trees (context) - Courcelle - 1983
90
On Understanding Types, Data Abstraction, and Polymorphism
- Cardelli, Wegner - 1985
82
Typeful Programming
- Cardelli - 1989
71
Operations on Records
- Cardelli, Mitchell - 1990
63
Three approaches to type structure (context) - Reynolds - 1985
12
Infinite Trees in Normal Form and Recursive Equations Having.. (context) - Courcelle - 1979
10
Type Extensions (context) - Wirth - 1988
5
An Imperative Type Hierarchy with Partial Products (context) - Schmidt, Schwartzbach - 1989
3
Infinite Values in Hierarchical Imperative Types (context) - Schwartzbach - 1990
3
Types and Automata
- Schwartzbach, Schmidt - 1990
Documents on the same site (http://www.daimi.aau.dk/~mis/papers.html): More
Distributed Safety Controllers for Web Services - Sandholm, Schwartzbach (1998)
(Correct)
A Domain-Specific Language for Regular Sets of Strings and.. - Klarlund, Schwartzbach (1997)
(Correct)
Graph Types - Klarlund, Schwartzbach (1993)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC