{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:50:47Z","timestamp":1725558647333},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651956"},{"type":"electronic","value":"9783540494942"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/10692760_13","type":"book-chapter","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T16:35:37Z","timestamp":1277915737000},"page":"149-163","source":"Crossref","is-referenced-by-count":1,"title":["Internally Typed Second-Order Term Graphs"],"prefix":"10.1007","author":[{"given":"Wolfram","family":"Kahl","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","first-page":"117","volume-title":"Handbook of Logic in Computer Science","author":"H.P. Barendregt","year":"1992","unstructured":"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.\u00a02, pp. 117\u2013309. Oxford Univertity Press, New York (1992)"},{"volume-title":"Relational Methods in Computer Science. Advances in Computing","year":"1997","key":"13_CR2","unstructured":"Brink, C., Kahl, W., Schmidt, G. (eds.): Relational Methods in Computer Science. Advances in Computing. Springer, Wien (1997) ISBN 3-211-82971-7"},{"key":"13_CR3","unstructured":"Kahl, W.: Algebraische Termgraphersetzung mit gebundenen Variablen. Reihe Informatik. Herbert Utz Verlag, M\u00fcnchen, zugleich Dissertation an der Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t der Bundeswehr M\u00fcnchen (1996) ISBN 3-931327-60-4"},{"key":"13_CR4","unstructured":"Wolfram Kahl. A Fibred Approach to Rewriting \u2014 How the Duality between Adding and Deleting Cooperates with the Difference between Matching and Rewriting. Tech. Rep. 9702 (May 1997), Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t der Bundeswehr M\u00fcnchen."},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1093\/jigpal\/6.2.259","volume":"6","author":"W. Kahl","year":"1998","unstructured":"Kahl, W.: Relational Treatment of Term Graphs With Bound Variables. Journal of the IGPL\u00a06(2), 259\u2013303 (1998)","journal-title":"Journal of the IGPL"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Kahl, W.: The Higher Object Programming System \u2014 User Manual for HOPS, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t der Bundeswehr M\u00fcnchen (February 1998), http:\/\/diogenes.informatik.unibwmuenchen.de:8080\/kahl\/HOPS\/","DOI":"10.1007\/978-3-7091-6355-9_10"},{"key":"13_CR7","unstructured":"Klop, J.W.: Combinatory Reduction Systems. Mathematical Centre Tracts 127, Centre for Mathematics and Computer Science, Amsterdam. PhD Thesis (1980)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/3540543961_7","volume-title":"Functional Programming Languages and Computer Architecture, 5th ACM Conference","author":"E. Meijer","year":"1991","unstructured":"Meijer, E., Fokkinga, M., Paterson, R.: Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol.\u00a0523, pp. 124\u2013144. Springer, Heidelberg (1991)"},{"key":"13_CR9","unstructured":"Schmidt, G., Str\u00f6hlein, T.: Relations and Graphs, Discrete Mathematics for Computer Scientists. In: EATCS-Monographs on Theoretical Computer Science. Springer, Berlin (1993)"},{"key":"13_CR10","series-title":"Prentice Hall International Series in Computer Science","volume-title":"The Z Notation: A Reference Manual","author":"J.M. Spivey","year":"1989","unstructured":"Spivey, J.M.: The Z Notation: A Reference Manual. Prentice Hall International Series in Computer Science. Prentice Hall, Englewood Cliffs (1989)"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/0304-3975(93)90240-T","volume":"112","author":"C.L. Talcott","year":"1993","unstructured":"Talcott, C.L.: A Theory of Binding Structures and Applications to Rewriting. Theoretical Computer Science\u00a0112, 68\u201381 (1993)","journal-title":"Theoretical Computer Science"},{"key":"13_CR12","unstructured":"Wadsworth, C.P.: Semantics and Pragmatics ofthe Lambda Calculus. Ph.D. thesis, Oxford University (September 1971)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"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.\u00a0246, pp. 68\u201381. Springer, Heidelberg (1987)","DOI":"10.1007\/3-540-17218-1_50"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10692760_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T12:05:47Z","timestamp":1635595547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10692760_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651956","9783540494942"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/10692760_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}