(Enter summary)
Abstract: A hierarchical type system for imperative programming languages gives rise to various computational problems, such as type equivalence, type ordering, etc. We present a particular class of finite automata which are shown to be isomorphic to type equations. All the relevant type concepts turn out to have well-known automata analogues, such as language equality, language inclusion, etc. This provides optimal or best known algorithms for the type system, by a process of translating type equations... (Update)
Context of citations to this paper: More
...automata and type equations. The above decision problem translates to a variation of language inclusion for which an efficient algorithm is presented in [9]. 2 Example 6.10: The type T defined by the equations Type A = x : B; y : C) Type B = Omega Type C = D Type D = x : E; z...
...automata and type equations. The above decision problem translates to a variation of language inclusion for which an efficient algorithm is presented in [9]. 2 Example 6.10: The type T defined by the equations Type A = x : B; y : C) Type B Type C = D Type D = x : E; z : F )...
Cited by: More
Interpretations of Recursively Defined Types - Schwartzbach
(Correct)
Static Correctness of Hierarchical Procedures - Schwartzbach (1990)
(Correct)
Active bibliography (related documents): More All
0.4: Type Substitution for Object-Oriented Programming - Palsberg, Schwartzbach (1990)
(Correct)
0.3: Static Typing for Object-Oriented Programming - Palsberg, Schwartzbach (1994)
(Correct)
0.1: Agent-Based Information Infrastructure - Landauer, Bellman (1999)
(Correct)
Similar documents based on text: More All
0.1: Correctness of Binding-time Analysis - Palsberg (1993)
(Correct)
0.1: Comparing Flow-based Binding-time Analyses - Palsberg (1995)
(Correct)
0.1: Three Discussions on Object-Oriented Typing - Palsberg, Schwartzbach (1992)
(Correct)
Related documents from co-citation: More All
3: Infinite trees in normal form and recursive equations having a unique solution (context) - Courcelle - 1979
3: Fundamental properties of infinite trees (context) - Courcelle - 1983
3: An imperative type hierarchy with partial products (context) - Schmidt, Schwartzbach - 1989
BibTeX entry: (Update)
Schwartzbach, M.I. & Schmidt, E.M. "Types and Automata". PB-316, Department of Computer Science, Aarhus University, 1990. http://citeseer.ist.psu.edu/schwartzbach90types.html More
@misc{ schwartzbach90types,
author = "M. Schwartzbach and E. Schmidt",
title = "Types and Automata",
text = "Schwartzbach, M.I. & Schmidt, E.M. Types and Automata. PB-316, Department
of Computer Science, Aarhus University, 1990.",
year = "1990",
url = "citeseer.ist.psu.edu/schwartzbach90types.html" }
Citations (may not include all citations):
388
On Understanding Types (context) - Cardelli, Wegner - 1985
63
Three approaches to type structure (context) - Reynolds - 1985
11
Type Inference with Inequalities (context) - Schwartzbach - 1990
9
Volume 1: Parsing (context) - Aho, Ullman - 1972
5
An Imperative Type Hierarchy with Partial Products (context) - Schmidt, Schwartzbach - 1989
4
Static Correctness of Hierarchical Procedures
- Schwartzbach - 1990
1
Innite Values in Hierarchical Imperative Types (context) - Schwartzbach - 1990
1
Innite Trees in Normal Form and Recursive Equations Having a.. (context) - Courcelle - 1979
1
in Theoretical Computer Science Vol 25 No (context) - Courcelle - 1983
1
DEC Research Report (context) - Cardelli - 1989
Documents on the same site (http://www.cs.purdue.edu/homes/tzhao/ref.html): More
Type Inference in Systems of Recursive Types With Subtyping - Jim, Palsberg (1999)
(Correct)
From Polyvariant Flow Information to Intersection and Union.. - Palsberg, Pavlopoulou (2000)
(Correct)
A Core Calculus of Dependency - Abadi, Banerjee, Heintze, Riecke (1999)
(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