- curry - lists.rwth-aachen.de

LOPSTR 2020 - First CFP
by Michael Hanus 31 Mar '20

31 Mar '20

====================================================================== LOPSTR 2020: Fist Call for Papers ====================================================================== 30th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2020 https://nms.kcl.ac.uk/maribel.fernandez/LOPSTR2020/ Bologna, 7-9 September 2020 Abstract Deadline: 5 June 2020 Paper Deadline: 12 June 2020 SCOPE The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development in any language paradigm. LOPSTR 2020 will be co-located with PPDP, WFLP and Microservices. TOPICS Topics of interest cover all aspects of logic-based program development (including in domain-specific languages), all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large, including: * synthesis; transformation; specialisation; composition; optimisation * specification; analysis and verification; testing and certification * program and model manipulation; inversion * machine learning for program development * transformational techniques in SE; applications and tools Both full papers and extended abstracts describing applications in all these areas are especially welcome. Survey papers and papers that describe experience with industrial applications are also welcome. Important Dates --------------- Abstract submission: 5 June 2020 (AoE) Paper/Extended abstract submission: 12 June 2020 (AoE) Notification: 12 July 2020 Camera-ready (for electronic pre-proceedings): 12 August 2020 Symposium: 7-9 September 2020 Submission Guidelines --------------------- Authors should submit an electronic copy of the paper (written in English) in PDF, formatted in the Lecture Notes in Computer Science style. Each submission must include on its first page the paper title; authors and their affiliations; contact author's email; abstract; and three to four keywords which will be used to assist the PC in selecting appropriate reviewers for the paper. Page numbers (and, if possible, line numbers) should appear on the manuscript to help the reviewers in writing their report. Submissions cannot exceed 15 pages excluding references. Additional pages may be used for appendices (not intended for publication). Reviewers are not required to read appendices, and thus papers should be intelligible without them. Papers should be submitted via the Easychair submission website for LOPSTR 2020. PROCEEDINGS Post-conference proceedings will be published by Springer in the LNCS series, as in previous editions. Full papers can be directly accepted for publication in the formal proceedings, or accepted only for presentation at the symposium and inclusion in informal proceedings. After the symposium, all authors of extended abstracts and full papers accepted only for presentation will be invited to revise and/or extend their submissions. Then, after another round of reviewing, these revised papers may also be published in the formal proceedings. Authors should consult Springer’s authors’ guidelines and use their proceedings templates, available also in Overleaf, for the preparation of their papers. Springer encourages authors to include their ORCIDs in their papers. BEST PAPER AWARDS Thanks to Springer's sponsorship, two awards (including a 500EUR prize each) will be given at LOPSTR 2020, based on relevance, originality and technical quality of papers. The PC may split the awards among several papers. PROGRAMME COMMITTEE Elvira Albert, Complutense University of Madrid, Spain María Alpuente, Universitat Politècnica de València, Spain Mauricio Ayala-Rincón, University of Brasilia, Brazil Clara Bertolissi, University Aix-Marseilles, France Emanuele De Angelis, CNR Inst. for Systems Analysis and Computer Science, Italy Maribel Fernández, King's College London, UK (chair) Mario Florido, University of Porto, Portugal Maurizio Gabbrielli, University of Bologna, Italy Robert Glück, University of Copenhagen, Denmark Gopal Gupta, University of Texas at Dallas, US Michael Hanus, Kiel University, Germany Delia Kesner, Université de Paris, France Andy King, University of Kent, UK Temur Kutsia, RISC J. Kepler University of Linz, Austria Giselle Reis, Carnegie Mellon University, Qatar Masahito Sakai, Nagoya University, Japan René Thiemann, University of Innsbruck, Austria Alwen Tiu, The Australian National University, Australia Germán Vidal, Universitat Politècnica de València, Spain LOCAL ORGANISATION Maurizio Gabbrielli, University of Bologna CONTACT For more information please contact the PC Chair: Maribel.Fernandez(a)kcl.ac.uk

1 0

Haskell compatibility
by Volker Wysk 19 Dec '19

19 Dec '19

Hi! I've read that Curry is a super set of Haskell, except for the type classes. But some Curry implementations do also include Haskell type classes. Does that mean, that Haskell code can easily be used inside Curry programs? Like C in C++? Is it possible to use all those Haskell libraries in Curry? Or, if not, is it very easy to port Haskell to Curry? Cheers Volker

3 7

Unicode support
by Volker Wysk 16 Dec '19

16 Dec '19

Hi! I'm wondering if Curry (or rather a specific implementation of curry?) supports Unicode? Does it have a string type of Unicode-code points? And does it have, for instance, a Unicode-aware function to get the upper case if a letter? Or, is there a Unicode-aware collation function? I googled, but there wasn't found much. Cheers, Volker

2 1

Dynamic Predicates?
by Felix Holmgren 14 Oct '19

14 Oct '19

Hi! I'm reading the "Dynamic Predicates in Functional Logic Programs" paper and I'm finding it quite interesting since I've always found the integration with persistent data stores to be a weak point in most languages and frameworks, and it seemed to me that Logic Programming should offer a more natural way to deal with this problem given that it's got the idea of a global database built in (as the paper points out). So my question is: has this been implemented in any form in existing Curry systems? I think there was a mention of dynamic predicates having been implemented as a library but I can't find it. Was the idea scrapped perhaps? Cheers /Felix

2 1

Declare 2019 - Call for Participation
by Petra Hofstedt (BTU) 09 Aug '19

09 Aug '19

================================================================== Declare 2019: Call for Participation Cottbus, Germany, September 9-12, 2019 www.declare19.de ================================================================== Declarative programming is an advanced paradigm for the modeling and solving of complex problems. This method has attracted increased attention over the last decades, e.g., in the domains of data and knowledge engineering, databases, artificial intelligence, natural language processing, modeling and processing combinatorial problems, and for establishing systems for the web. The conference Declare 2019 aims at cross-fertilizing exchange of ideas and experiences among researches and students from the different communities interested in the foundations, implementation techniques, novel applications, and combinations of high-level, declarative programming and related areas. The technical program of the event will include invited talks, presentations of refereed papers, and system demonstrations. Declare 2019 consists of the sub-events INAP, WFLP, and WLP: INAP - 22nd International Conference on Applications of Declarative Programming and Knowledge Management WFLP - 27th International Workshop on Functional and (Constraint) Logic Programming WLP - 33rd Workshop on (Constraint) Logic Programming Accepted papers and preliminary program: https://www.declare19.de/index.php/organization/program/ Please register here: https://www.declare19.de/index.php/organization/registration/ Looking forward to see you at Declare 2019 in Cottbus in September. The Organizing Committee Petra Hofstedt (General Chair), Sven Löffler, Katrin Ebert, Brandenburg University of Technology, Cottbus, Germany

1 0

WFLP 2019 - Submission Deadline extended
by Herbert Kuchen 04 Jun '19

04 Jun '19

WFLP 2019 - Submission Deadline extended 27th International Workshop on Functional and (Constraint) Logic Programming Cottbus, Germany, September 9-13, 2019 (part of Declare 2019; co-located with INAP, WLP, and QPLogic: www.declare19.de) Important Dates --- EXTENDED DEADLINES --- Paper submission: June 24, 2019 Notification of acceptance: July 15, 2019 Camera-ready papers: August 5, 2019 Early registration: August 12, 2019 Online Registration: September 2, 2019 Workshop: September 9-13, 2019 The international Workshop on Functional and (constraint) Logic Programming (WFLP) aims at bringing together researchers, students, and practitioners interested in functional programming, logic programming, and their integration. WFLP has a reputation for being a lively and friendly forum, and it is open for presenting and discussing work in progress, technical contributions, experience reports, experiments, reviews, and system descriptions. The 27th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2019) will be held at the Brandenburgische Technische Universität Cottbus Germany. Previous WFLP editions were WFLP 2018 (Frankfurt am Main, Germany), WFLP 2017 (Würzburg, Germany), WFLP 2016 (Leipzig, Germany), WFLP 2014 (Wittenberg, Germany), WFLP 2013 (Kiel, Germany), WFLP 2012 (Nagoya, Japan), WFLP 2011 (Odense, Denmark), WFLP 2010 (Madrid, Spain), WFLP 2009 (Brasilia, Brazil), WFLP 2008 (Siena, Italy), WFLP 2007 (Paris, France), WFLP 2006 (Madrid, Spain), WCFLP 2005 (Tallinn, Estonia), WFLP 2004 (Aachen, Germany), WFLP 2003 (Valencia, Spain), WFLP 2002 (Grado, Italy), WFLP 2001 (Kiel, Germany), WFLP 2000 (Benicassim, Spain), WFLP'99 (Grenoble, France), WFLP'98 (Bad Honnef, Germany), WFLP'97 (Schwarzenberg, Germany), WFLP'96 (Marburg, Germany), WFLP'95 (Schwarzenberg, Germany), WFLP'94 (Schwarzenberg, Germany), WFLP'93 (Rattenberg, Germany), and WFLP'92 (Karlsruhe, Germany). WFLP 2019 will be part of DECLARE 2019 and hence be co-located with INAP 2019 (International Conference on Applications of Declarative Programming and Knowledge Management), WLP 2019 (Workshop on (Constraint) Logic Programming), and QPLogic 2019 (Quantum and Probability Logic). Topics The topics of interest cover all aspects of functional and logic programming. They include (but are not limited to): * Functional programming * Logic programming * Constraint programming * Deductive databases, data mining * Extensions of declarative languages, objects * Multi-paradigm declarative programming * Foundations, semantics, non-monotonic reasoning, dynamics * Parallelism, concurrency * Program analysis, abstract interpretation * Program and model manipulation * Program transformation, partial evaluation, meta-programming * Specification, * Verification * Debugging * Testing * Knowledge representation, machine learning * Interaction of declarative programming with other formalisms * Implementation of declarative languages * Advanced programming environments and tools * Software techniques for declarative programming * Applications The primary focus is on new and original research results, but submissions describing innovative products, prototypes under development, application systems, or interesting experiments (e.g., benchmarks) are also encouraged. Survey papers that present some aspects of the above topics from a new perspective, and experience reports are also welcome. Papers must be written and presented in English. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Submission Guidelines Submission is via Easychair submission website for WFLP 2019: https://easychair.org/conferences/?conf=wflp2019 Authors are invited to submit papers in the following categories: + Regular research paper + Work-in-progress report + System description Regular research papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been formally published or that are simultaneously submitted to a journal, conference, or workshop with formal proceedings. They will be judged on the basis of significance, relevance, correctness, originality, and clarity. For work-in-progress reports and system descriptions, less formal rules apply, and presentation-only submissions (talk and discussion, but no paper in the formal proceedings) are possible. Please contact the PC chair with any questions. All submissions must be formatted in the Lecture Notes in Computer Science style. Submissions cannot exceed 15 pages including references but excluding well-marked appendices not intended for publication. Reviewers are not required to read the appendices, and thus papers should be intelligible without them. However, all submissions (especially work-in-progress reports and system descriptions) may be considerably shorter than 15 pages. Proceedings All papers accepted for presentation at the conference will be published in informal proceedings publicly available at the Computing Research Repository. According to the program committee reviews, submissions can be directly accepted for publication in the formal post-conference proceedings. The formal post-conference proceedings will be published in both electronic and paper formats by Springer in the Lecture Notes in Computer Science series. After the conference, all authors accepted only for presentation will be invited to revise and/or extend their submissions in the light of the feedback solicited at the conference. Then, after another round of reviewing, these revised papers may also be published in the formal proceedings. Therefore, all accepted papers will be published in open-access, and the authors can also decide to publish their work in the Springer LNCS formal proceedings. Program Committee Maria Alpuente Frasnedo, Universitat Politècnica de València, Spain Sergio Antoy, Portland State University, USA Olaf Chitil, University of Kent, UK Sandra Dylus, University of Kiel, Germany Moreno Falaschi, U. Siena, Italy Michael Hanus, University of Kiel, Germany Herbert Kuchen, University of Münster, Germany (Chair) Julio Mariño Carballo, Universidad Politécnica de Madrid, Spain Manuel Montenegro Montes, Universidad Complutense de Madrid, Spain Kostis Sagonas, Uppsala University, Sweden Sibylle Schwarz, HTWK Leipzig, Germany Dietmar Seipel, University of Würzburg, Germany Josep Silva Galiana, Universitat Politècnica de València, Spain Johannes Waldmann, HTWK Leipzig, Germany Organizing Committee Petra Hofstedt (General Chair), Sven Löffler, Katrin Ebert, Brandenburg University of Technology, Cottbus, Germany

1 0

"Normal form" of a partial application
by Andy Jost 29 May '19

29 May '19

I'm trying to understand the following output of PAKCS: test> ((1+1)+) _impl#+#Prelude.Num#Prelude.Int (1 _impl#+#Prelude.Num#Prelude.Int 1) test> :t (+) (1+1) (+) (1+1) :: Num a => a -> a It surprises me that the subexpression 1+1 is not reduced. The full expression has no normal form because the first occurrence of + cannot be eliminated. Yet PAKCS seems to treat it as if it was a value. This makes a certain practical sense in the context of the REPL, but if this is like a value then why is the subexpression not reduced? If I go one step further and apply $!! to force normalization of the partial application, I see that $!! ignores the subexpression 1+1 (trace shown): test> id $!! ((1+1)+) Call: id $!! (_impl#+#Prelude.Num#Prelude.Int (1 _impl#+#Prelude.Num#Prelude.Int 1)) Call: id (_impl#+#Prelude.Num#Prelude.Int (1 _impl#+#Prelude.Num#Prelude.Int 1)) Exit: id (_impl#+#Prelude.Num#Prelude.Int (1 _impl#+#Prelude.Num#Prelude.Int 1)) (HNF: _impl#+#Prelude.Num#Prelude.Int (1 _impl#+#Prelude.Num#Prelude.Int 1)) Exit: id $!! (_impl#+#Prelude.Num#Prelude.Int (1 _impl#+#Prelude.Num#Prelude.Int 1)) (HNF: _impl#+#Prelude.Num#Prelude.Int (1 _impl#+#Prelude.Num#Prelude.Int 1)) _impl#+#Prelude.Num#Prelude.Int (1 _impl#+#Prelude.Num#Prelude.Int 1) This seems to imply that (1+1)+ is a normal form, which it clearly is not. Is this perhaps some corner that is not well defined, or are there good reasons to NOT reduce an expression such as ((1+1)+) to (2+)? I can imagine that attaining correct semantics might require this delay if the subexpression is non-deterministic but I'm not entirely convinced. Certainly, it is not obvious to me. And is there some theoretical basis upon which I can understand these seeming quirks? -Andy

2 1

Choosing default instances in Curry
by Andy Jost 27 May '19

27 May '19

I'm trying to understand the implementation of typeclasses in Curry so that I can implement them in my compiler. Is there some documentation describing how dictionaries are implemented, including the naming conventions used? One problem I face is knowing how to choose default instances. For example, the program "main = 1 + 1" translates to the following FlatCurry: program "test" import "Prelude" function "test.main" 1 lhs_vars [1] Node "Prelude.apply" ( Node "Prelude.apply" ( Node "Prelude.+" ( var 1 ) , Node "Prelude.apply" ( Node "Prelude.fromInt" ( var 1 ) , int 1 ) ) , Node "Prelude.apply" ( Node "Prelude.fromInt" ( var 1 ) , int 1 ) ) Function "main" expects an implicit argument that is an instance of Prelude.Num. This is because no type declaration was specified, so its type is "Num a => a". If I were to declare main as having a concrete type such as Int or Float, then it would take no arguments. KiCS2 and PAKCS can run this program, so they must somehow choose a default instance. How is this done? I'm especially bothered that the FlatCurry appears to be missing crucial information - i.e., the fact that "main" expects a Num instance is not mentioned in the FlatCurry. How do other Curry implementations know to pass a Num dictionary and how is the default instance chosen? -Andy

4 5

How to interpret a data type with no RHS
by Andy Jost 27 May '19

27 May '19

I can define an empty data type in Curry, e.g.: data A The built-in types such as Char, Int and Float are defined this way in the Prelude. Prior to the introduction of typeclasses the Curry frontend would translate this to a FlatCurry Type with no constructors. Newer versions produce a type with one constructor named "_Constr#A". I'd like to understand how to interpret this. Is the above legal Curry? Is this perhaps a forward declaration or opaque type? Can the type, A, be defined later? If so, would it have to be defined in the same module? Is this documented somewhere? I'm tempted to reject such a declaration unless the system can find a built-in definition but I don't want to reject legal programs. -Andy

3 2

Final Call for Papers - PPDP 2019
by Michael Hanus 14 Apr '19

14 Apr '19

On behalf of the PC chair: ====================================================================== FINAL CALL FOR PAPERS -- PPDP 2019 21st International Symposium on Principles and Practice of Declarative Programming 7–9 October 2019, Porto, Portugal Collocated with FM'19 http://ppdp2019.macs.hw.ac.uk ====================================================================== Important Dates --------------- Title and abstract registration 26 April 2019 (AoE) Paper submission 3 May 2019 (AoE) Rebuttal period (48 hours) 3 June 2019 (AoE) Author notification 14 June 2019 Final paper version 15 July 2019 Conference 7–9 October 2019 About PPDP ---------- The PPDP 2019 symposium brings together researchers from the declarative programming communities, including those working in the functional, logic, answer-set, and constraint handling programming paradigms. The goal is to stimulate research in the use of logical formalisms and methods for analyzing, performing, specifying, and reasoning about computations, including mechanisms for concurrency, security, static analysis, and verification. Invited Speakers ---------------- Amal Ahmed Northeastern University, USA Title: TBA Naoki Kobayashi The University of Tokyo, Japan Title: 10 Years of the Higher-Order Model Checking Project Scope ----- Submissions are invited on all topics related to declarative programming, from principles to practice, from foundations to applications. Topics of interest include, but are not limited to - Language Design: domain-specific languages; interoperability; concurrency, parallelism, and distribution; modules; probabilistic languages; reactive languages; database languages; knowledge representation languages; languages with objects; language extensions for tabulation; metaprogramming. - Implementations: abstract machines; interpreters; compilation; compile-time and run-time optimization; memory management. - Foundations: types; logical frameworks; monads and effects; semantics. - Analysis and Transformation: partial evaluation; abstract interpretation; control flow; data flow; information flow; termination analysis; resource analysis; type inference and type checking; verification; validation; debugging; testing. - Tools and Applications: programming and proof environments; verification tools; case studies in proof assistants or interactive theorem provers; certification; novel applications of declarative programming inside and outside of CS; declarative programming pearls; practical experience reports and industrial application; education. Submission Categories --------------------- Submissions can be made in three categories: regular Research Papers, System Descriptions, and Experience Reports. Submissions of Research Papers must present original research which is unpublished and not submitted elsewhere. They must not exceed 12 pages ACM style 2-column (including figures, but excluding bibliography). Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Research papers will be judged on originality, significance, correctness, clarity, and readability. Submission of System Descriptions must describe a working system whose description has not been published or submitted elsewhere. They must not exceed 10 pages and should contain a link to a working system. System Descriptions must be marked as such at the time of submission and will be judged on originality, significance, usefulness, clarity, and readability. Submissions of Experience Reports are meant to help create a body of published, refereed, citable evidence where declarative programming such as functional, logic, answer-set, constraint programming, etc., is used in practice. They must not exceed 5 pages **including references**. Experience Reports must be marked as such at the time of submission and need not report original research results. They will be judged on significance, usefulness, clarity, and readability. Supplementary material may be provided in a clearly marked appendix beyond the above-mentioned page limits. Reviewers are not required to study any material beyond the respective page limit. Format of a Submission ---------------------- For each paper category, you must use the most recent version of the "Current ACM Master Template" which is available at <https://www.acm.org/publications/proceedings-template>. The most recent version at the time of writing is 1.48. You must use the LaTeX sigconf proceedings template as the conference organizers are unable to process final submissions in other formats. In case of problems with the templates, contact ACM's TeX support team at Aptara <acmtexsupport(a)aptaracorp.com <mailto:acmtexsupport@aptaracorp.com>>. Authors should note ACM's statement on author's rights (http://authors.acm.org/) which apply to final papers. Submitted papers should meet the requirements of ACM's plagiarism policy (http://www.acm.org/publications/policies/plagiarism_policy). Requirements for Publication ---------------------------- At least one author of each accepted submission will be expected to attend and present the work at the conference. The pc chair may retract a paper that is not presented. The pc chair may also retract a paper if complaints about the paper's correctness are raised which cannot be resolved by the final paper deadline. Program Committee Chair ----------------------- Ekaterina Komendantskaya Heriot-Watt University, UK Program Committee ----------------- Henning Basold, CNRS, ENS de Lyon, France Jasmin Christian Blanchette, Vrije Universiteit Amsterdam, The Netherlands Maria Paola Bonacina, Università degli Studi di Verona, Italy Dmitry Boulytchev, JetBrains Research, Russia William Byrd, University of Alabama at Birmingham, USA Ornela Dardha, University of Glasgow, UK Marco Gaboardi, University at Buffalo, SUNY, USA Arie Gurfinkel, University of Waterloo, Canada Zhenjiang Hu, National Institute of Informatics, Japan Moa Johansson, Chalmers University of Technology, Sweden Neelakantan Krishnaswami, University of Cambridge, UK Ralf Lämmel, University of Koblenz · Landau, Germany Anthony Widjaja Lin, Technische Universität Kaiserslautern, Germany Christopher Mieklejohn, Carnegie Mellon University, USA Aart Middeldorp, University of Innsbruck, Austria Gopalan Nadathur, University of Minnesota, USA Keisuke Nakano, Tohoku University, Japan Dominic Orchard, University of Kent, UK Alberto Pardo, University of the Republic, Uruguay Aleksy Schubert, University of Warsaw, Poland Peter J. Stuckey, The University of Melbourne, Australia Tarmo Uustalu, Reykjavik University, Iceland Local Chair ----------- José Nuno Oliveira INESC TEC & University of Minho, Portugal For any queries about local issues please contact the local organiser, José Nuno Oliveira <jno(a)di.uminho.pt <mailto:jno@di.uminho.pt>>. Untitled Document ------------------------------------------------------------------------ */Heriot-Watt University is The Times & The Sunday Times International University of the Year 2018/* Founded in 1821, Heriot-Watt is a leader in ideas and solutions. With campuses and students across the entire globe we span the world, delivering innovation and educational excellence in business, engineering, design and the physical, social and life sciences. This email is generated from the Heriot-Watt University Group, which includes: 1. Heriot-Watt University, a Scottish charity registered under number SC000278 2. Edinburgh Business School a Charity Registered in Scotland, SC026900. Edinburgh Business School is a company limited by guarantee, registered in Scotland with registered number SC173556 and registered office at Heriot-Watt University Finance Office, Riccarton, Currie, Midlothian, EH14 4AS 3. Heriot- Watt Services Limited (Oriam), Scotland's national performance centre for sport. Heriot-Watt Services Limited is a private limited company registered is Scotland with registered number SC271030 and registered office at Research & Enterprise Services Heriot-Watt University, Riccarton, Edinburgh, EH14 4AS. The contents (including any attachments) are confidential. If you are not the intended recipient of this e-mail, any disclosure, copying, distribution or use of its contents is strictly prohibited, and you should please notify the sender immediately and then delete it (including any attachments) from your system.

1 0