{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T00:55:01Z","timestamp":1778892901027,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662452332","type":"print"},{"value":"9783662452349","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45234-9_3","type":"book-chapter","created":{"date-parts":[[2014,9,26]],"date-time":"2014-09-26T01:28:35Z","timestamp":1411694915000},"page":"26-40","source":"Crossref","is-referenced-by-count":21,"title":["Combinatory Logic Synthesizer"],"prefix":"10.1007","author":[{"given":"Jan","family":"Bessai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrej","family":"Dudenhefner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boris","family":"D\u00fcdder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moritz","family":"Martens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakob","family":"Rehof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Rehof, J.: Towards Combinatory Logic Synthesis. In: 1st International Workshop on Behavioural Types, BEAT 2013. ACM (2013)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"931","DOI":"10.2307\/2273659","volume":"48","author":"H. Barendregt","year":"1983","unstructured":"Barendregt, H., Coppo, M., Dezani-Ciancaglini, M.: A Filter Lambda Model and the Completeness of Type Assignment. Journal of Symbolic Logic\u00a048, 931\u2013940 (1983)","journal-title":"Journal of Symbolic Logic"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-21691-6_15","volume-title":"Typed Lambda Calculi and Applications","author":"J. Rehof","year":"2011","unstructured":"Rehof, J., Urzyczyn, P.: Finite Combinatory Logic with Intersection Types. In: Ong, L. (ed.) Typed Lambda Calculi and Applications. LNCS, vol.\u00a06690, pp. 169\u2013183. Springer, Heidelberg (2011)"},{"key":"3_CR4","unstructured":"D\u00fcdder, B., Martens, M., Rehof, J., Urzyczyn, P.: Bounded Combinatory Logic. In: Proceedings of CSL 2012. LIPIcs, vol.\u00a016, pp. 243\u2013258. Schloss Dagstuhl (2012)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-54833-8_5","volume-title":"Programming Languages and Systems","author":"B. D\u00fcdder","year":"2014","unstructured":"D\u00fcdder, B., Martens, M., Rehof, J.: Staged Composition Synthesis. In: Shao, Z. (ed.) ESOP 2014 (ETAPS). LNCS, vol.\u00a08410, pp. 67\u201386. Springer, Heidelberg (2014)"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1109\/32.153379","volume":"18","author":"Z. Manna","year":"1992","unstructured":"Manna, Z., Waldinger, R.: Fundamentals Of Deductive Program Synthesis. IEEE Transactions on Software Engineering\u00a018, 674\u2013704 (1992)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s10009-013-0287-9","volume":"15","author":"R. Bodik","year":"2013","unstructured":"Bodik, R., Jobstmann, B.: Algorithmic Program Synthesis: Introduction. International Journal on Software Tools for Technology Transfer\u00a015, 397\u2013411 (2013)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-642-00596-1_28","volume-title":"Foundations of Software Science and Computational Structures","author":"Y. Lustig","year":"2009","unstructured":"Lustig, Y., Vardi, M.Y.: Synthesis from Component Libraries. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 395\u2013409. Springer, Heidelberg (2009)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Hindley, J.R., Seldin, J.P.: Lambda-calculus and Combinators, an Introduction. Cambridge University Press (2008)","DOI":"10.1017\/CBO9780511809835"},{"key":"3_CR10","unstructured":"Steffen, B., Margaria, T., von der Beeck, M.: Automatic Synthesis of Linear Process Models from Temporal Constraints: An Incremental Approach. In: In ACM\/SIGPLAN Int. Workshop on Automated Analysis of Software, AAS 1997 (1997)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-45719-4_7","volume-title":"Algebraic Methodology and Software Technology","author":"C. Haack","year":"2002","unstructured":"Haack, C., Howard, B., Stoughton, A., Wells, J.B.: Fully Automatic Adaptation of Software Components Based on Semantic Specifications. In: Kirchner, H., Ringeissen, C. (eds.) AMAST 2002. LNCS, vol.\u00a02422, pp. 83\u201398. Springer, Heidelberg (2002)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/11506676_17","volume-title":"Logic Based Program Synthesis and Transformation","author":"J.B. Wells","year":"2005","unstructured":"Wells, J.B., Yakobowski, B.: Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis. In: Etalle, S. (ed.) LOPSTR 2004. LNCS, vol.\u00a03573, pp. 262\u2013277. Springer, Heidelberg (2005)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Freeman, T., Pfenning, F.: Refinement Types for ML. In: Proceedings of PLDI 1991, pp. 268\u2013277. ACM (1991)","DOI":"10.1145\/113446.113468"},{"key":"3_CR14","unstructured":"Linial, L., Post, E.L.: Recursive Unsolvability of the Deducibility, Tarski\u2019s Completeness and Independence of Axioms Problems of Propositional Calculus. Bulletin of the American Mathematical Society 50 (1949)"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/382780.382785","volume":"48","author":"R. Davies","year":"2001","unstructured":"Davies, R., Pfenning, F.: A Modal Analysis of Staged Computation. Journal of the ACM\u00a048, 555\u2013604 (2001)","journal-title":"Journal of the ACM"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-38946-7_11","volume-title":"Typed Lambda Calculi and Applications","author":"B. D\u00fcdder","year":"2013","unstructured":"D\u00fcdder, B., Martens, M., Rehof, J.: Intersection Type Matching with Subtyping. In: Hasegawa, M. (ed.) TLCA 2013. LNCS, vol.\u00a07941, pp. 125\u2013139. Springer, Heidelberg (2013)"},{"key":"3_CR17","unstructured":"Vasileva, A.: Synthese von Orchestrationscode f\u00fcr Cloud-basierte Dienste. Diploma thesis, Technical University of Dortmund, Department of Computer Science (2013)"},{"key":"3_CR18","unstructured":"Wolf, P.: Entwicklung einer Adapters mit VI Scripting (LabVIEW) zur Synthese von LEGO\u00ae NXT-VIs aus einem Repository. Bachelor\u2019s thesis, Technical University of Dortmund, Department of Computer Science (2013)"},{"key":"3_CR19","unstructured":"Plate, S.: Automatische Generierung einer Konfiguration f\u00fcr virtuelle Maschinen unter Zuhilfenahme eines Inhabitationsalgorithmus. Bachelor\u2019s thesis, Technical University of Dortmund, Department of Computer Science (2013)"},{"key":"3_CR20","unstructured":"Bessai, J.: Synthesizing Dependency Injection Configurations for the Spring Framework. Master\u2019s thesis, TU Dortmund, Department of Computer Science (2013)"},{"key":"3_CR21","unstructured":"Bracha, G.: The Programming Language Jigsaw: Mixins, Modularity and Multiple Inheritance. PhD thesis, University of Utah, Salt Lake City, UT, USA (1992)"}],"container-title":["Lecture Notes in Computer Science","Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45234-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T00:26:46Z","timestamp":1559003206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45234-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662452332","9783662452349"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45234-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}