{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:15:27Z","timestamp":1725455727746},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540605898"},{"type":"electronic","value":"9783540478027"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0015462","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:32:11Z","timestamp":1131863531000},"page":"190-204","source":"Crossref","is-referenced-by-count":1,"title":["A fine-grain sort discipline and its application to formal program construction"],"prefix":"10.1007","author":[{"given":"Jochen","family":"Burghardt","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"10_CR1","unstructured":"Oliver Bittel. Ein tableau-basierter Theorembeweiser f\u00fcr die intuitionistische Logik. PhD thesis, Univ. Karlsruhe, 1991."},{"key":"10_CR2","unstructured":"Jochen Burghardt. Eine feink\u00f6rnige Sortendisziplin und ihre Anwendung in der Programmkonstruktion. PhD thesis, Univ. Karlsruhe, 1993."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Jochen Burghardt. The deductive synthesis approach applied to a production cell. In T. Lindner and C. Lewerentz, editors, Formal development of reactive systems \u2014 Case study production cell, volume 1 of FZI-Report. FZI Karlsruhe, 1994.","DOI":"10.1007\/3-540-58867-1_61"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Jochen Burghardt. Deductive synthesis applied to the case study production cell. In T. Lindner and C. Lewerentz, editors, Formal development of reactive systems \u2014 Case study production cell, volume 891 of LNCS, pages 297\u2013311. Springer, 1995.","DOI":"10.1007\/3-540-58867-1_61"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Jochen Burghardt. Regular substitution sets: A means of controlling E-unification. In Proc. Conf. on Rewriting Techniques and Applications, volume 914 of LNCS, pages 382\u2013396, 1995.","DOI":"10.1007\/3-540-59200-8_71"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Hubert Comon. Equational formulas in order-sorted algebras. In Proc. ICALP, 1990.","DOI":"10.1007\/BFb0032066"},{"key":"10_CR7","unstructured":"Oliver Haase. Nicht-Klausel-Resolution bei der deduktiven Programmsynthese. Master's thesis, University Karlsruhe, 1992."},{"key":"10_CR8","unstructured":"Birgit Heinz. Lemma discovery by anti-unification of regular sorts. Technical Report 94-21, TU Berlin, 1994."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"S. H\u00f6lldobler. Foundations of Equational Programming, volume 353 of LNAI. Springer, 1989.","DOI":"10.1007\/BFb0015791"},{"issue":"11","key":"10_CR10","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1002\/spe.4380191102","volume":"19","author":"E. Klein","year":"1989","unstructured":"Eduard Klein and M. Martin. The parser generating system PGS. Software Practice and Experience, 19(11):1015\u20131028, 1989.","journal-title":"Software Practice and Experience"},{"key":"10_CR11","unstructured":"Ursula Mohaupt. Deduktive Programmsynthese. Master's thesis, Technical University Berlin, 1991."},{"key":"10_CR12","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF02737109","volume":"25","author":"U.R. Schmerl","year":"1988","unstructured":"U.R. Schmerl. Resolution on formula-trees. Acta Informatica, 25:425\u2013438, 1988.","journal-title":"Acta Informatica"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Manfred Schmidt-Schau\u00df. Computational Aspects of an Order-Sorted Logic with Term Declarations. PhD thesis, Univ. Kaiserslautern, Apr 1988.","DOI":"10.1007\/BFb0024065"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"J.W. Thatcher and J.B. Wright. Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory, 2(1), 1968.","DOI":"10.1007\/BF01691346"}],"container-title":["Lecture Notes in Computer Science","KORSO: Methods, Languages, and Tools for the Construction of Correct Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0015462","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:46:50Z","timestamp":1586551610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015462"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540605898","9783540478027"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0015462","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}