Abstract
We present a typing concept for second-order term graphsthat doesnot consider the types as an external add-on, but as an integral part of the term graph structure. This allows a homogeneous treatment of term-graph representations of many kinds of typing systems, including second-order λ-calculi and systems of dependent types. Applications can be found in interactive systems and as typed intermediate representation for example in compilers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barendregt, H.P.: Lambda Calculi with Types. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 2, pp. 117–309. Oxford Univertity Press, New York (1992)
Brink, C., Kahl, W., Schmidt, G. (eds.): Relational Methods in Computer Science. Advances in Computing. Springer, Wien (1997) ISBN 3-211-82971-7
Kahl, W.: Algebraische Termgraphersetzung mit gebundenen Variablen. Reihe Informatik. Herbert Utz Verlag, München, zugleich Dissertation an der Fakultät für Informatik, Universität der Bundeswehr München (1996) ISBN 3-931327-60-4
Wolfram Kahl. A Fibred Approach to Rewriting — How the Duality between Adding and Deleting Cooperates with the Difference between Matching and Rewriting. Tech. Rep. 9702 (May 1997), Fakultät für Informatik, Universität der Bundeswehr München.
Kahl, W.: Relational Treatment of Term Graphs With Bound Variables. Journal of the IGPL 6(2), 259–303 (1998)
Kahl, W.: The Higher Object Programming System — User Manual for HOPS, Fakultät für Informatik, Universität der Bundeswehr München (February 1998), http://diogenes.informatik.unibwmuenchen.de:8080/kahl/HOPS/
Klop, J.W.: Combinatory Reduction Systems. Mathematical Centre Tracts 127, Centre for Mathematics and Computer Science, Amsterdam. PhD Thesis (1980)
Meijer, E., Fokkinga, M., Paterson, R.: Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol. 523, pp. 124–144. Springer, Heidelberg (1991)
Schmidt, G., Ströhlein, T.: Relations and Graphs, Discrete Mathematics for Computer Scientists. In: EATCS-Monographs on Theoretical Computer Science. Springer, Berlin (1993)
Spivey, J.M.: The Z Notation: A Reference Manual. Prentice Hall International Series in Computer Science. Prentice Hall, Englewood Cliffs (1989)
Talcott, C.L.: A Theory of Binding Structures and Applications to Rewriting. Theoretical Computer Science 112, 68–81 (1993)
Wadsworth, C.P.: Semantics and Pragmatics ofthe Lambda Calculus. Ph.D. thesis, Oxford University (September 1971)
Zierer, H., Schmidt, G., Berghammer, R.: An Interactive Graphical Manipulation System for Higher Objects Based on Relational Algebra. In: Tinhofer, G., Schmidt, G. (eds.) WG 1986. LNCS, vol. 246, pp. 68–81. Springer, Heidelberg (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kahl, W. (1998). Internally Typed Second-Order Term Graphs. In: Hromkovič, J., Sýkora, O. (eds) Graph-Theoretic Concepts in Computer Science. WG 1998. Lecture Notes in Computer Science, vol 1517. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10692760_13
Download citation
DOI: https://doi.org/10.1007/10692760_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65195-6
Online ISBN: 978-3-540-49494-2
eBook Packages: Springer Book Archive