Type inference in stack based languages |
| |
Authors: | Bill Stoddart Peter J Knaggs |
| |
Affiliation: | (1) School of Computing and Mathematics, University of Teesside, TS1 3BA Middlesbrough, Cleveland, UK |
| |
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. |
| |
Keywords: | Formal aspects Stack based languages Semantic model language Algebras Type inference Forth |
本文献已被 SpringerLink 等数据库收录! |
|