Type Inference in Stack Based Languages (1993) [6 citations — 1 self]
by
Bill Stoddart
,
Peter J. Knaggs
Formal Aspects of Computing
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@ARTICLE{Stoddart93typeinference,
author = {Bill Stoddart and Peter J. Knaggs},
title = {Type Inference in Stack Based Languages},
journal = {Formal Aspects of Computing},
year = {1993},
volume = {5},
pages = {289--298}
}
author = {Bill Stoddart and Peter J. Knaggs},
title = {Type Inference in Stack Based Languages},
journal = {Formal Aspects of Computing},
year = {1993},
volume = {5},
pages = {289--298}
}
Bookmarks
OpenURL
Abstract:
We consider a language of operations which pass parameters by means of a stack. An algebra over the set of type signatures is introduced, which allows the type signature of a program to be obtained from the type signatures of its constituent operations. Although the theories apply in principle to any stack based language, they have been evolved with particular regard to the proposed ANSI Standard Forth language, which is currently implemented in a type free manner. We hope this work will stimulate an interest in Forth amongst those applying algebraic techniques in software engineering, and we hope to lay the theoretical foundations for implementing practical type checkers to support Forth.
Citations
| 5 | Multiple stack effects of Forth programs – Poial - 1991 |
| 4 | Algebraic Specifications of Stack Effects for Forth Programs – Poial - 1990 |
| 3 | F.: Une generalisation du monoid bicyclique – Nivat, Perrot - 1970 |
| 2 | C.: RPL: A Mathematical Control Language – Wickes - 1988 |
| 1 | Starting Forth, 2 nd Edition – Brodie - 1987 |
| 1 | Letter to the authors – Poial - 1990 |
