{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:20:18Z","timestamp":1725664818492},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614647"},{"type":"electronic","value":"9783540685968"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61464-8_67","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:40:16Z","timestamp":1330292416000},"page":"392-407","source":"Crossref","is-referenced-by-count":14,"title":["Higher-order families"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Oostrom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"30_CR1","series-title":"Background: Computational Structures","volume-title":"Handbook of Logic in Computer Science, volume 2","year":"1992","unstructured":"S. Abramsky, Dov M. Gabbay, and T. S. E. Maibaum, editors. Handbook of Logic in Computer Science, volume 2, Background: Computational Structures. Oxford University Press, New York, 1992."},{"key":"30_CR2","first-page":"1","volume":"664","author":"Y. Akama","year":"1993","unstructured":"Yohji Akama. On Mints' reduction for ccc-calculus. In TLCA'93, LNCS 664, pp. 1\u201312, 1993.","journal-title":"LNCS"},{"key":"30_CR3","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1017\/S0960129500000566","volume":"4","author":"A. Asperti","year":"1994","unstructured":"Andrea Asperti and Cosimo Laneve. Interaction systems I: The theory of optimal reductions. Mathematical Structures in Computer Science, 4:457\u2013504, 1994.","journal-title":"Mathematical Structures in Computer Science"},{"key":"30_CR4","unstructured":"H. P. Barendregt. The Lambda Calculus, Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, revised edition, 1984."},{"key":"30_CR5","unstructured":"H. P. Barendregt, J. Bergstra, J. W. Klop, and H. Volken. Degrees, reductions and representability in the \u03bb-calculus. Report 22, Rijksuniversiteit Utrecht, February 1976. The Blue Preprint."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"G. Dowek, J. Heering, K. Meinke, and B. M\u00f6ller, editors. Proceedings of the Second International Workshop on Higher-Order Algebra, Logic, and Term Rewriting, (HOA '95), volume 1074 of LNCS. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61254-8"},{"key":"30_CR7","series-title":"volume B: Formal Models and Semantics","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In [Lee90, Ch. 6]."},{"key":"30_CR8","first-page":"72","volume":"7","author":"G. Gonthier","year":"1992","unstructured":"Georges Gonthier, Jean-Jacques L\u00e9vy, and Paul-Andr\u00e9 Melli\u00e8s. An abstract standardisation theorem. In LICS 7, pp. 72\u201381, 1992.","journal-title":"LICS"},{"key":"30_CR9","volume-title":"Computational Logic-Essays in Honor of Alan Robinson","author":"G. Huet","year":"1991","unstructured":"G\u00e9rard Huet and Jean-Jacques L\u00e9vy. Computations in orthogonal rewriting systems. In [LP91]."},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"J. Heering, K. Meinke, B. M\u00f6ller, and T. Nipkow, editors. Higher-Order Algebra, Logic, and Term Rewriting, First International Workshop, HOA '93, volume 816 of LNCS. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58233-9"},{"key":"30_CR11","unstructured":"Michael Hanus and Christian Prehofer. Higher-order narrowing with definitional trees. In these proceedings."},{"key":"30_CR12","unstructured":"J. Roger Hindley and Jonathan P. Seldin. Introduction to Combinators and \u03bb-Calculus, volume 1 of London Mathematical Society Students Texts. Cambridge University Press, 1986."},{"key":"30_CR13","series-title":"Background: Computational Structures","first-page":"1","volume-title":"Handbook of Logic in Computer Science, volume 2","author":"J. W. Klop","year":"1992","unstructured":"J. W. Klop. Term rewriting systems. In [AGM92, pp. 1\u2013116]."},{"key":"30_CR14","unstructured":"J. W. Klop. Combinatory Reduction Systems. PhD thesis, Rijksuniversiteit Utrecht, June 1980. Mathematical Centre Tracts 127."},{"key":"30_CR15","series-title":"volume B: Formal Models and Semantics","volume-title":"Handbook of Theoretical Computer Science","year":"1990","unstructured":"Jan van Leeuwen, editor. Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics. Elsevier Science Publishers B.V., Amsterdam, 1990."},{"key":"30_CR16","unstructured":"Jean-Jacques L\u00e9vy. R\u00e9ductions correctes et optimales dans le \u03bb-calcul. Th\u00e8se de doctorat d'etat, Universit\u00e9 Paris VII, 1978."},{"volume-title":"Computational Logic-Essays in Honor of Alan Robinson","year":"1991","key":"30_CR17","unstructured":"Jean-Louis Lassez and Gordon Plotkin, editors. Computational Logic-Essays in Honor of Alan Robinson. The MIT Press, Cambridge, Massachusetts, 1991."},{"key":"30_CR18","unstructured":"Luc Maranget. La strat\u00e9gie paresseuse. Th\u00e8se de doctorat, Universit\u00e9 Paris VII, 6 juilliet 1992."},{"key":"30_CR19","unstructured":"Paul-Andr\u00e9 Melli\u00e8s. Description Abstraite des Syst\u00e8mes de R\u00e9\u00e9criture. Th\u00e8se de doctorat, Universit\u00e9 Paris VII, 1996. To appear."},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Dale Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. In ELP'89, LNAI 475, 1991.","DOI":"10.1093\/logcom\/1.4.497"},{"key":"30_CR21","first-page":"342","volume":"6","author":"T. Nipkow","year":"1991","unstructured":"Tobias Nipkow. Higher-order critical pairs. In LICS 6, pp. 342\u2013349, 1991.","journal-title":"LICS"},{"key":"30_CR22","first-page":"306","volume":"664","author":"T. Nipkow","year":"1993","unstructured":"Tobias Nipkow. Orthogonal higher-order rewrite systems are confluent. In TLCA'93, LNCS 664, pp. 306\u2013317, 1993.","journal-title":"LNCS"},{"key":"30_CR23","volume-title":"PhD thesis","author":"V. Oostrom van","year":"1994","unstructured":"Vincent van Oostrom. Confluence for Abstract and Higher-Order Rewriting. PhD thesis, Vrije Universiteit, Amsterdam, March 1994."},{"key":"30_CR24","volume-title":"PhD thesis","author":"F. Raamsdonk van","year":"1996","unstructured":"Femke van Raamsdonk. Confluence and Normalisation for Higher-Order Rewriting. PhD thesis, Vrije Universiteit, Amsterdam, May 1996."}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61464-8_67.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T19:11:46Z","timestamp":1687288306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61464-8_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614647","9783540685968"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-61464-8_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}