{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:33:20Z","timestamp":1725492800717},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441441"},{"type":"electronic","value":"9783540457190"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45719-4_7","type":"book-chapter","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T10:55:00Z","timestamp":1191927300000},"page":"83-98","source":"Crossref","is-referenced-by-count":10,"title":["Fully Automatic Adaptation of Software Components Based on Semantic Specifications*"],"prefix":"10.1007","author":[{"given":"Christian","family":"Haack","sequence":"first","affiliation":[]},{"given":"Brian","family":"Howard","sequence":"additional","affiliation":[]},{"given":"Allen","family":"Stoughton","sequence":"additional","affiliation":[]},{"given":"Joe B.","family":"Wells","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"7_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Type isomorphisms for module signatures","author":"M. V. Aponte","year":"1996","unstructured":"M. V. Aponte, R. D. Cosmo. Type isomorphisms for module signatures. In 8th Int\u2019l Symp. Prog. Lang.: Implem., Logics & Programs, PLILP\u2019 96, vol. 1140 of LNCS. Springer-Verlag, 1996."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"I. Cervesato, F. Pfenning. Linear higher-order pre-unification. In Proc. 12th Ann. IEEE Symp. Logic in Comput. Sci., 1997.","DOI":"10.1109\/LICS.1997.614967"},{"key":"7_CR3","unstructured":"R. L. Constable, J. Hickey. Nuprl\u2019s class theory and its applications. Unpublished, 2000."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"R. Di Cosmo. Isomorphisms of Types: From Lambda-Calculus to Information Retrieval and Language Design. Birkh\u00e4user, 1995.","DOI":"10.1007\/978-1-4612-2572-0"},{"key":"7_CR5","unstructured":"R. Dyckhoff, L. Pinto. A permutation-free sequent calculus for intuitionistic logic. Technical Report CS\/96\/9, University of St Andrews, 1996."},{"key":"7_CR6","unstructured":"B. Fischer, J. Schumann. NORA\/HAMMR: Making deduction-based software component retrieval practical. In Proc. CADE-14 Workshop on Automated Theorem Proving in Software Engineering, 1997."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"C. Haack. Foundations for a tool for the automatic adaptation of software components based on semantic specifications. PhD thesis, Kansas State University, 2001.","DOI":"10.1007\/3-540-45719-4_7"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"R. Harper, J. Mitchell. On the type structure of Standard ML. ACM Trans. on Prog. Lang. and Sys., 15(2), 1993.","DOI":"10.1145\/169701.169696"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"D. Hemer, P. Lindsay. Specification-based retrieval strategies for module reuse. In Australian Software Engineering Conference. IEEE Computer Society Press, 2001.","DOI":"10.1109\/ASWEC.2001.948517"},{"key":"7_CR10","series-title":"Lect Notes Comput Sci","volume-title":"A \u03bb-calculus structure isomorphic to Gentzen-style sequent calculus structure","author":"H. Herbelin","year":"1994","unstructured":"H. Herbelin. A \u03bb-calculus structure isomorphic to Gentzen-style sequent calculus structure. In Proc. Conf. Computer Science Logic, vol. 933 of LNCS. Springer-Verlag, 1994."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"G. Huet. A unification algorithm for typed \u03bb-calculus. Theoret. Comput. Sci., 1(1), 1975.","DOI":"10.1016\/0304-3975(75)90011-0"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"S. Kahrs, D. Sannella, A. Tarlecki. The definition of Extended ML: A gentle introduction. Theoretical Computer Science, 173, 1997.","DOI":"10.1016\/S0304-3975(96)00163-6"},{"key":"7_CR13","series-title":"Lect Notes Comput Sci","volume-title":"Amphion: Automatic programming for scientific subroutine libraries","author":"M. Lowry","year":"1994","unstructured":"M. Lowry, A. Philpot, T. Pressburger, I. Underwood. Amphion: Automatic programming for scientific subroutine libraries. In Proc. 8th Intl. Symp. on Methodologies for Intelligent Systems, vol. 869 of LNCS, Charlotte, 1994."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"D. Miller. A logic programming language with lambda-abstraction, function variables and simple unification. Journal of Logic and Computation, 1(4), 1991.","DOI":"10.1093\/logcom\/1.4.497"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"R. Milner, M. Tofte, R. Harper, D. MacQueen. The Definition of Standard ML (Revised). MIT Press, 1997.","DOI":"10.7551\/mitpress\/2319.001.0001"},{"key":"7_CR16","series-title":"Lect Notes Comput Sci","volume-title":"Higher-order unification, polymorphism and subsorts","author":"T. Nipkow","year":"1990","unstructured":"T. Nipkow. Higher-order unification, polymorphism and subsorts. In Proc. 2nd Int. Workshop Conditional & Typed Rewriting System, LNCS. Springer-Verlag, 1990."},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"G. D. Plotkin. Call-by-name, call-by-value and the lambda calculus. Theoret. Comput. Sci., 1, 1975.","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"M. Rittri. Using types as search keys in function libraries. J. Funct. Programming, 1(1), 1991.","DOI":"10.1017\/S095679680000006X"},{"key":"7_CR19","unstructured":"E. R. Rollins, J. M. Wing. Specifications as search keys for software libraries. In K. Furukawa, ed., Eighth International Conference on Logic Programming. MIT Press, 1991."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"C. Runciman, I. Toyn. Retrieving reusable software components by polymorphic type. Journal of Functional Programming, 1(2), 1991.","DOI":"10.1017\/S0956796800020049"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"M. Stickel, R. Waldinger, M. Lowry, T. Pressburger, I. Underwood. Deductive composition of astronomical software from subroutine libraries. In The 12th International Conference on Automated Deduction, Nancy, France, 1994.","DOI":"10.1007\/3-540-58156-1_24"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"P. Wadler. Theorems for free! In 4th Int. Conf. on Functional Programming Languages and Computer Architecture, 1989.","DOI":"10.1145\/99370.99404"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"A. M. Zaremski, J. M. Wing. Specification matching of software components. ACM Transactions on Software Engineering and Technology, 6(4), 1997.","DOI":"10.1145\/261640.261641"}],"container-title":["Lecture Notes in Computer Science","Algebraic Methodology and Software Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45719-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,26]],"date-time":"2020-04-26T23:38:19Z","timestamp":1587944299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45719-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441441","9783540457190"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-45719-4_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}