Abstract
A methodology Tor polymorphic type inference for general term graph rewriting systems is presented. This requires modified notions of type and of type inference due to the absence of structural induction over graphs. Induction over terms is replaced by dataflow analysis.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Banach R. (1989), Dataflow Analysis of Term Graph Rewriting Systems, in proc. PARLE-89, Odijk E., Rem M., Syre J-C. eds., Springer, LNCS 366 55–72.
Banach R. (1991a), DACTL Rewriting is Categorical, in proc. SemaGraph-91, University of Nijmegen Dept. of Informatics Technical Report 9-25 part II 339–357. Also see in: Term Graph Rewriting: Theory and Practice, John Wiley, 1992, to appear.
Banach R. (1991b), Term Graph Rewriting and Garbage Collection à la Grothendieck. Submitted to TCS.
Banach R. (1991c), MONSTR: Term Graph Rewriting for Parallel Machines, in proc. SemaGraph-91, University of Nijmegen Dept. of Informatics Technical Report 91-25 part II 251–260. Also see in: Term Graph Rewriting: Theory and Practice, John Wiley, 1992, to appear.
Banach R. (1992), MONSTR, in preparation.
Barendregt H.P. (1984), The Lambda Calculus. Its Syntax and Semantics, North-Holland.
Barendregt H.P., van Eekelen M.C.J.D., Glauert J.R.W., Kennaway J.R., Plasmeijer M.J., Sleep M.R. (1987), Term Graph Rewriting, in proc. PARLE-87, de Bakker J.W., Nijman A.J., Treleaven P.C. eds., Springer, LNCS 259 141–158.
Farmer W.M., Watro R.J. (1990), Redex Capturing in Term Graph Rewriting, Int. Jour. Found. Comp. Sci. 1 369–386, and in proc. RTA-91, R.V. Book ed., Springer, LNCS 488 13–24.
Girard J-Y., Taylor P., Lafont Y. (1989), Proofs and Types, Cambridge Tracts in Theoretical Computer Science 7, CUP.
Glauert J.R.W., Kennaway J.R., Sleep M.R., Somner G.W. (1988a), Final Specification of DACTL, Internal Report SYS-C88-11, School of Information Systems, University of East Anglia, Norwich, U.K.
Glauert J.R.W., Hammond K., Kennaway J.R., Papdopoulos G.A., Sleep M.R. (1988b), DACTL: Some Introductory Papers, School of Information Systems, University of East Anglia, Norwich, U.K.
Hankin C. (1991), Static Analysis of Term Graph Rewriting Systems, in proc. PARLE-91, Aarts E.H.L., van Leeuwen J., Rem M. eds., Springer, LNCS 506 367–384.
Hindley R. (1969), The Principal Type-Scheme of an Object in Combinatory Logic, Trans. Amer. Math. Soc. 146 29–60.
Huet G. (1990), Logical Foundations of Functional Programming, Addison-Wesley.
Kennaway J.R., Klop J-W., Sleep M.R., de Vries F-J. (1991), Transfinite Reductions in Orthogonal Term Rewrite Systems, in proc. RTA-91, R.V. Book ed., Springer, LNCS 488 1–12, and Report CS-R9041, CWI Amsterdam.
Milner R. (1978), A Theory of Type Polymorphism in Programming, Jour. Comp. Sys. Sci. 17 348–375.
Milner R., Tofte M. (1991), Co-induction in Relational Semantics, Theor. Comp. Sci. 87 209–220.
Peyton-Jones S.L. (1987), The Implementation of Functional Programming Languages, Prentice-Hall.
Tofte M. (1990), Type Inference for Polymorphic References, Inf. and Comp. 89 1–34.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Banach, R. (1993). Simple type inference for term graph rewriting systems. In: Rusinowitch, M., Rémy, JL. (eds) Conditional Term Rewriting Systems. CTRS 1992. Lecture Notes in Computer Science, vol 656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56393-8_4
Download citation
DOI: https://doi.org/10.1007/3-540-56393-8_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56393-8
Online ISBN: 978-3-540-47549-1
eBook Packages: Springer Book Archive