{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T06:24:16Z","timestamp":1648880656581},"reference-count":21,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.325.39","type":"journal-article","created":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T01:01:53Z","timestamp":1600304513000},"page":"296-302","source":"Crossref","is-referenced-by-count":0,"title":["Research Summary on Implementing Functional Patterns by Synthesizing Inverse Functions"],"prefix":"10.4204","volume":"325","author":[{"given":"Finn","family":"Teegen","sequence":"first","affiliation":[{"name":"Kiel University"}]}],"member":"2720","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"key":"AbramovGlueck2000URA","series-title":"MPC'00","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/10722010_13","article-title":"The Universal Resolving Algorithm: Inverse Computation in a Functional Language","volume-title":"Mathematics of Program Construction","author":"Abramov","year":"2000"},{"issue":"2","key":"AbramovGlueck2002URACorrectness","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0167-6423(02)00023-0","article-title":"The Universal Resolving Algorithm and its Correctness: Inverse Computation in a Functional Language","volume":"43","author":"Abramov","year":"2002","journal-title":"Science of Computer Programming"},{"key":"AbramovAtAl2006URALazy","series-title":"PSI'06","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-70881-0_6","article-title":"An Universal Resolving Algorithm for Inverse Computation of Lazy Languages","volume-title":"Proceedings of the 6th International Andrei Ershov Memorial Conference on Perspectives of Systems Informatics","author":"Abramov","year":"2007"},{"key":"Almendros-JimenezEtAl2006AutomaticPartial","series-title":"IFL'06","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-74130-5_15","article-title":"Automatic Partial Inversion of Inductively Sequential Functions","volume-title":"Proceedings of the 18th International Conference on Implementation and Application of Functional Languages","author":"Almendros-Jim\u00e9nez","year":"2007"},{"key":"Antoy2001Constructor","series-title":"PPDP\u201901","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1145\/773184.773205","article-title":"Constructor-Based Conditional Narrowing","volume-title":"Proceedings of the 3rd ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming","author":"Antoy","year":"2001"},{"key":"AntoyHanus2005FunctionalPatterns","series-title":"LOPSTR'05","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/11680093_2","article-title":"Declarative Programming with Function Patterns","volume-title":"Proceedings of the 15th International Conference on Logic-Based Program Synthesis and Transformation","author":"Antoy","year":"2006"},{"issue":"4","key":"AntoyHanus2010FunctionalLogicProgramming","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/1721654.1721675","article-title":"Functional Logic Programming","volume":"53","author":"Antoy","year":"2010","journal-title":"Communications of the ACM"},{"key":"AntoyHanus2017Eliminating","series-title":"PADL'17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-51676-9_1","article-title":"Eliminating Irrelevant Non-determinism in Functional Logic Programs","volume-title":"Practical Aspects of Declarative Languages","author":"Antoy","year":"2017"},{"key":"AntoyHanus2018Equivalence","series-title":"FLOPS'18","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-319-90686-7_10","article-title":"Equivalence Checking of Non-deterministic Operations","volume-title":"Proceedings of the 14th International Symposium on Functional and Logic Programming","author":"Antoy","year":"2018"},{"key":"BrasselChristiansen2008Relation","series-title":"RelMiCS'08","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-78913-0_5","article-title":"A Relation Algebraic Semantics for a Lazy Functional Logic Language","volume-title":"Relations and Kleene Algebra in Computer Science","author":"Bra\u00dfel","year":"2008"},{"key":"ChristiansenFischer2008EasyCheck","series-title":"FLOPS'08","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-540-78969-7_23","article-title":"EasyCheck \u2013 Test Data for Free","volume-title":"Proceedings of the 9th International Symposium on Functional and Logic Programming","author":"Christiansen","year":"2008"},{"issue":"1","key":"DylusEtAl2020PFLP","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1017\/S1471068419000085","article-title":"Implementing a Library for Probabilistic Programming Using Non-strict Non-determinism","volume":"20","author":"Dylus","year":"2020","journal-title":"Theory and Practice of Logic Programming"},{"key":"GlueckKawabe2004Derivation","series-title":"FLOPS'04","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-24754-8_21","article-title":"Derivation of Deterministic Inverse Programs Based on LR Parsing","volume-title":"Functional and Logic Programming","author":"Gl\u00fcck","year":"2004"},{"key":"GlueckKlimov1993PerfectProcessTree","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-57264-3_34","article-title":"Occam's Razor in Metacomputation: the Notion of a Perfect Process Tree","volume-title":"Static Analysis","author":"Gl\u00fcck","year":"1993"},{"key":"GonzalezEtAl1999Approach","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0743-1066(98)10029-8","article-title":"An approach to declarative programming based on a rewriting logic","volume":"40","author":"Gonz\u00e1lez-Moreno","year":"1999","journal-title":"Journal of Logic Programming"},{"key":"Hanus2016CurryCheck","series-title":"LOPSTR'16","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-319-63139-4_13","article-title":"CurryCheck: Checking Properties of Curry Programs","volume-title":"Proceedings of the 26th International Symposium on Logic-Based Program Synthesis and Transformation","author":"Hanus","year":"2017"},{"key":"HanusTeegen2020Data","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-030-46714-2_15","article-title":"Adding Data to Curry","volume-title":"Declarative Programming and Knowledge Management","author":"Hanus","year":"2020"},{"key":"Lopez-FraguasSanchez-Hernandez1999TOY","series-title":"RTA'99","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-48685-2_19","article-title":"TOY: A Multiparadigm Declarative System","volume-title":"Rewriting Techniques and Applications","author":"L\u00f3pez-Fraguas","year":"1999"},{"key":"NishidaEtAl2005Partial","series-title":"RTA'05","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-540-32033-3_20","article-title":"Partial Inversion of Constructor Term Rewriting Systems","volume-title":"Proceedings of the 16th International Conference on Term Rewriting and Applications","author":"Nishida","year":"2005"},{"key":"Peemoeller2016Normalization","volume-title":"Normalization and Partial Evaluation of Functional Logic Programs","author":"Peem\u00f6ller","year":"2016"},{"key":"SecherSorensen2002Driving","series-title":"PEPM'02","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/509799.503036","article-title":"From Checking to Inference via Driving and Dag Grammars","volume-title":"Proceedings of the 2002 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation","author":"Secher","year":"2002"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2020,10,13]],"date-time":"2020-10-13T02:31:52Z","timestamp":1602556312000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/2009.10254v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,19]]},"references-count":21,"URL":"http:\/\/dx.doi.org\/10.4204\/eptcs.325.39","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,19]]}}}