- curry - lists.rwth-aachen.de

The PAKCS REPL consider something undefined, but the module defining it is loaded
by Jeffrey Brown 29 Nov '18

29 Nov '18

New StackOverflow question! https://stackoverflow.com/questions/53547365/the-pakcs-repl-consider-someth… -- Jeff Brown | Jeffrey Benjamin Brown Website <https://msu.edu/~brown202/> | Facebook <https://www.facebook.com/mejeff.younotjeff> | LinkedIn <https://www.linkedin.com/in/jeffreybenjaminbrown>(spammy, so I often miss messages here) | Github <https://github.com/jeffreybenjaminbrown>

1 0

Specifying default rules: Why and how?
by Jeffrey Brown 23 Nov '18

23 Nov '18

I posted this question on Stackoverflow[1] yesterday and haven't received any answers yet. I've duplicated the question below, but an answer posted to StackOverflow would be more useful to future students, if you're so inclined. Thanks! --- In section 3.5.6 of the Curry tutorial (pdf) <https://www.informatik.uni-kiel.de/~curry/tutorial/tutorial.pdf>, we are advised to use default rules to "regain control after a failed search". The following example is given. (For clarity I have added a type signature and curried the input.) lookup :: k -> [(k,v)] -> Maybe v lookup key (_++[(key,value)]++_ ) = Just value lookup’default _ _ = Nothing I can't get that to compile unless I replace the ’ with a '. Once I do, it behaves like this: test> test.lookup 1 [(2,3)] *** No value found! Question 1: What is the default declaration for? Why would you need to specify that a particular clause is the default one? Won't it be arrived at one way or another, once the others fail? Question 2: How is it written? Should it be written at all? If instead I drop the string 'default: lookup :: k -> [(k,v)] -> Maybe v lookup key (_++[(key,value)]++_ ) = Just value lookup _ _ = Nothing it behaves as intended: test> test.lookup 1 [(2,3)] Nothing test> Has the 'default syntax changed since the tutorial was written? Has it been removed altogether? [1] https://stackoverflow.com/questions/53357361/specifying-default-rules-in-th… -- Jeff Brown | Jeffrey Benjamin Brown Website <https://msu.edu/~brown202/> | Facebook <https://www.facebook.com/mejeff.younotjeff> | LinkedIn <https://www.linkedin.com/in/jeffreybenjaminbrown>(spammy, so I often miss messages here) | Github <https://github.com/jeffreybenjaminbrown>

3 5

What speed to expect doing logic on graphs represented by maps
by Jeffrey Brown 19 Nov '18

19 Nov '18

I want to write something resembling an editor for a graph database. I'm wondering if Curry will be fast enough. The data defining the graph would resemble the following: type Address = Int data Graph = Graph { address :: Map String Address content :: Map Address String -- `address` and `content` are inverses children :: Map Label (Set Address) parents :: Map Label (Set Address) } I would define rules such as: descendent :: Graph -> Index -> Index descendent g i -- If j is i's child, then j is i's descendent. | Set.member j $ Map.lookup i $ children g = j descendent g i -- If j is i's descendent and k is j's child, then k is i's descendent. | descendent g i j & (Set.member k $ Map.lookup k $ children g) = k I'll use hash maps unless their space requirements stop me. I'm hoping the resulting code will quickly (say, in under a second) answer queries over a few million nodes, along the lines of "the descendents of X and Y, minus any descendents of Z or W". If an unbounded number of generations proves computationally difficult, I would not be bothered by needing to impose depth limits, ala "the first two generations of descendents of X and Y, minus the first seven generations of descendents of Z or W". The graph would be sparse: with an average number of children well under five, and few cycles. Is this kind of performance a reasonable thing to expect from Curry? If so, using which compiler? If not, can you recommend another language? I know Haskell, and prefer it immensely to any other language. I am reluctant to write a full application in a pure logic language like Mercury, but I will if need be. -- Jeff Brown | Jeffrey Benjamin Brown Website <https://msu.edu/~brown202/> | Facebook <https://www.facebook.com/mejeff.younotjeff> | LinkedIn <https://www.linkedin.com/in/jeffreybenjaminbrown>(spammy, so I often miss messages here) | Github <https://github.com/jeffreybenjaminbrown>

3 3

PPDP | LOPSTR | WFLP 2018 Common Call for Participation
by David Sabel 06 Aug '18

06 Aug '18

====================================================================== PPDP | LOPSTR | WFLP 2018: Common Call for Participation ====================================================================== 20th International Symposium on Principles and Practice of Declarative Programming (PPDP 2018) 28th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2018) 26th International Workshop on Functional and Logic Programming (WFLP 2018) Frankfurt am Main, Germany, 3-6 September 2018 http://ppdp-lopstr-18.cs.uni-frankfurt.de ====================================================================== Program ======= The full program of PPDP | LOPSTR | WFLP 2018 is online: http://ppdp-lopstr-18.cs.uni-frankfurt.de/program/0.htm It includes * four invited talks: - Philippa Gardner, Imperial College. Formal Methods for JavaScript - Jorge Navas, SRI International. Constrained Horn Clauses for Verification - Chung-Chieh Shan, University of Indiana. Calculating Distributions - Laure Gonnord, University of Lyon. Experiences in Designing Scalable Static Analyses * invited tutorials: LOPSTR includes two invited tutorials: - Fabio Fioravanti, University of Chieti-Pescara. The VeryMAP System for program transformation and verification - Manuel Hermenegildo, IMDEA Software Institute. 25 Years of Ciao * a session in Honour of Martin Hofmann PPDP includes a session in honour of Martin Hofmann with an invited talk given by Nick Benton, Facebook. Semantic Equivalence Checking for HHVM Bytecode Registration ============ http://www.ppdp-lopstr-18.cs.uni-frankfurt.de/#registration Early registration ends on 15 August, 2018. Sponsors ======== The conferences are financially supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) - 407531063, and by the Goethe-University Frankfurt am Main. Conference Organisers ===================== PPDP Program Committee See http://www.ppdp-lopstr-18.cs.uni-frankfurt.de/ppdp18.html#pc Program Chair Peter Thiemann, Universität Freiburg, Germany LOPSTR Program Committee See http://ppdp-lopstr-18.cs.uni-frankfurt.de/lopstr18.html#pc Program Chairs Fred Mesnard, University of Reunion Island, France Peter Stuckey, University of Melbourne, Australia WFLP Program Committee See http://ppdp-lopstr-18.cs.uni-frankfurt.de/wflp18.html#pc Program Chair Josep Silva, Universitat Politècnica de València, Spain Organizing Committee (Goethe-University Frankfurt am Main, Germany) Ehud Cseresnyes Nils Dallmeyer Bircan Dölek Ronja Düffel Lars Huth Leonard Priester David Sabel (General Chair)

1 0

CFPs: IEEE Int. Conf. on Software Maint., Florence, Italy
by icsm2001 18 Jul '18

18 Jul '18

Dear Colleague I hope that this CFPs could be useful for your work. Please forward the following to anybody who you think may be interested. Apologies if you have already seen this. If you would like to be removed from our list please send an email to icsm2001(a)dsi.unifi.it with REMOVE in the subject. ICSM2001 Technical Committee _=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_= CALL---FOR---PAPERS IEEE International Conference on Software Maintenance 2001 FLORENCE, ITALY, 5-9 November 2001, http://www.dsi.unifi.it/icsm2001 Theme: Systems and Software Evolution in the era of the Internet _=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_= ICSM is the major international conference in the field of software and systems maintenance, evolution, and management. In the era of the Internet, businesses and end-users have invested in new technologies and small and large software organizations around the world are looking for Internet related solutions to evolve and maintain their new Internet software products. Internet technologies are strongly impacting system architectures and business processes and rules. In some cases businesses and end-users have been overwhelmed trying to keep up with software development and evolution processes and practices. In addition to novel solutions to enable the life-cycle of new web-based software systems, huge investments are necessary to migrate aginglegacy applications to web-enabled contemporary systems. ICSM 2001 will address these major changes in the software landscape and their impact on maintenance and evolution. The focus of the conference will be to explore the new challenges that the Internet, as a driver for business changes, poses for software maintenance, and the new opportunities it opens as infrastructure and enabling technology. The purpose of the conference is to promote discussion and interaction between researchers and practitioners. We are particularly interested in exchanging concepts, prototypes, research ideas, and other results which could contribute to the academic arena and also benefit business and the industrial community. ICSM 2001 will be participatory, with working collaborative sessions and presentations of industry projects. ICSM 2001 will bring together researchers, practitioners, developers and users of tools, technology transfer experts, and project managers. The Conference will be held in conjunction with WESS, the Workshop on Empirical Studies of Software. Topics of interest include but are not restricted to the following aspects of maintenance and evolution: - Methods and theories -Processes and strategies - Organizational frameworks -Life cycle and process control - Design for maintenance -Tools and environments - Internet and distributed systems -Multimedia systems - User interface evolution -Commercial off-the-shelf (COTS) - Third party maintenance -Freeware and open source applications - Program comprehension -Software and system visualization - Knowledge based systems -Formal methods - Impact of new software practices -Empirical studies - Software reusability -Programming languages - Source code analysis and manipulation -Testing and regression testing - Models and methods for error prediction -Measurement of software - Maintenance and/or productivity metrics -Preventive maintenance - Personnel aspects of maintenance -Reengineering and reverse engineering - Version and configuration management -Legal aspects and standards - Management and organization -Remote, tele-work, and co-operative applications RESEARCH PAPERS Research papers should describe original and significant work in the research and practice of software maintenance. Research case studies, empirical research, and experiments are particularly welcome. Papers should be 2000 - 5000 words in length, in English. Submit them in PDF or PostScript via email to icsm2001(a)unisannio.it by 15 January 2001. A prize of the Journal of Software Maintenance will be assigned at the Best submitted Paper. INDUSTRIAL APPLICATIONS We welcome proposals for presentations of Industrial Applications. These can be experience reports from real projects, industrial practices and models, or tool demonstrations. Submit proposals for Industrial Application presentations via email to icsm2001.industry(a)unisannio.it by 12 March 2001. Industrial Applications proposals will be reviewed by a dedicated sub-committee of the program committee and a 1 page summary of accepted proposals will be included in the conference proceedings. TUTORIALS Tutorials should present software maintenance and evolution topics of interest to practitioners. Tutorials may be full-day or half-day in length. Submit tutorial proposals via email to icsm2001.tutorial(a)unisannio.it by 12 February 2001. IMPORTANT DATES Research Paper submission 15 January 2001, notification of acceptance 1 June 2001 Industrial Application submission 12 March 2001 Tutorial submission 12 February 2001 ------------------------------ General chair: Paolo Nesi, University of Florence, Italy, nesi(a)dsi.unifi.it Financial chair: Vaclav Rajlich, Wayne State University, USA, vtr(a)cs.wayne.edu Program co-chairs: Gerardo Canfora, University of Sannio, Italy, gerardo.canfora(a)unisannio.it Anneliese von Mayrhauser, Colorado State University, USA, avm(a)CS.ColoState.EDU Tutorials co-chairs: Lionel C. Briand, Carleton University, briand(a)sce.carleton.ca Alessandro Fantechi, University of Florence, Italy, Fantechi(a)dsi.unifi.it Industrial Applications co-chairs: Panagiotis K. Linos, Tennessee Technological University, USA, linos(a)tntech.edu Harry Sneed, Software Engineering Service GmbH, Germany, Harry.Sneed(a)t-online.de Chris Verhoef, University of Amsterdam, NL, x(a)wins.uva.nl Publicity co-chairs: Nicholas Zvegintzov (General Co-chair), Software Management Network, USA, zvegint(a)attglobal.net Malcolm Munro (Co-chair for Europe), University of Durham, UK, malcolm.munro(a)durham.ac.uk William Cheng-Chung Chu (Co-chair for East), TungHai University, Taiwan, chu(a)cis.thu.edu.tw Local Arrangements co-chairs: Fabrizio Fioravanti, University of Florence, Italy, fioravan(a)dsi.unifi.it Pierfrancesco Bellini (Industrial Applications, and Demos), University of Florence, Italy, bellini(a)hpcn.dsi.unifi.it WEB Master: Marius Bogdan Spinu, University of Florence, Italy, spinu(a)hpcn.dsi.unifi.it --------------------------------------------------------------------------------------------------------------

1 0

PPDP 2018: Call for Participation
by David Sabel 06 Jul '18

06 Jul '18

====================================================================== PPDP 2018: Call for Participation ====================================================================== 20th International Symposium on Principles and Practice of Declarative Programming Frankfurt am Main, Germany, 3-5 September 2018 http://ppdp-lopstr-18.cs.uni-frankfurt.de/ppdp18.html (co-located with LOPSTR 2018 and WFLP 2018) http://ppdp-lopstr-18.cs.uni-frankfurt.de ====================================================================== Registration ============ http://www.ppdp-lopstr-18.cs.uni-frankfurt.de/#registration Early registration ends on 15 August, 2018. Session in Honour of Martin Hofmann =================================== PPDP will include a session in honour of Martin Hofmann including a talk given by Nick Benton, Facebook on Semantic Equivalence Checking for HHVM Bytecode Invited Talks ============= - Philippa Gardner, Imperial College. Testing and Verification for JavaScript (joint with LOPSTR) - Jorge Navas, SRI International. Constrained Horn Clauses for Verification (joint with LOPSTR) - Chung-Chieh Shan, University of Indiana. Calculating Distributions Accepted Papers =============== - Maciej Bendkowski and Pierre Lescanne. Combinatorics of explicit substitutions - Manfred Schmidt-Schauss, David Sabel and Nils Dallmeyer. Sequential and Parallel Improvements in a Concurrent Functional Programming Language - Magnus Madsen and Ondrej Lhotak. Implicit Parameters for Logic Programming - Mistral Contrastin, Dominic Orchard and Andrew Rice. Automatic reordering for dataflow safety of Datalog - Danil Annenkov and Martin Elsman. Certified Compilation of Financial Contracts - José Fragoso Santos, Petar Maksimović, Théotime Grohens, Julian Dolby and Philippa Gardner. Cosette: Symbolic Execution for JavaScript - Michael Hanus. Verifying Fail-Free Declarative Programs - Dmitri Rozplokhas and Dmitry Boulytchev. Improving Refutational Completeness of Relational Search via Divergence Test - Martin Sulzmann and Kai Stadtmüller. Two-Phase Dynamic Analysis of Message-Passing Go Programs based on Vector Clocks - Sylvia Grewe, Sebastian Erdweg, André Pacak and Mira Mezini. An Infrastructure for Combining Domain Knowledge with Automated Theorem Provers - Gopalan Nadathur and Yuting Wang. Schematic Polymorphism in the Abella Proof Assistant - Stephan Adelsberger, Anton Setzer and Eric Walkingshaw. Declarative GUIs: Simple, Consistent, and Verified - Genki Sakanashi and Masahiko Sakai. Transformation of combinatorial optimization problems written in extended SQL into constraint problems - Yuki Nishida and Atsushi Igarashi. Nondeterministic Manifest Contracts - Alberto Pardo, Emmanuel Gunther, Miguel Pagano and Marcos Viera. An Internalist Approach to Correct-by-Construction Compilers - Falco Nogatz, Jona Kalkus and Dietmar Seipel. Web-based Visualisation for Definite Clause Grammars using Prolog Meta-Interpreters - Helmut Seidl and Ralf Vogler. Three improvements to the top-down solver - Flavien Breuvart and Ugo Dal Lago. On Intersection Types and Probabilistic Lambda Calculi - Taku Terao. Lazy Abstraction for Higher-Order Program Verification - Maximiliano Klemen, Nataliia Stulova, Pedro Lopez-Garcia, Jose F. Morales and Manuel V. Hermenegildo. Static Performance Guarantees for Programs with Run-time Checks - Abhishek Dang and Piyush Kurur. Verse: An EDSL for cryptographic primitives - Pablo Barenbaum, Eduardo Bonelli and Kareem Mohamed. Pattern Matching and Fixed Points: Resources Types and Strong Call-By-Need Sponsors ======== PPDP is financially supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) - 407531063, and by the Goethe-University Frankfurt am Main. Conference Organisers ===================== Program Committee See http://www.ppdp-lopstr-18.cs.uni-frankfurt.de/ppdp18.html#pc Program Chair Peter Thiemann, Universität Freiburg, Germany Organizing Committee (Goethe-University Frankfurt am Main, Germany) Ehud Cseresnyes Nils Dallmeyer Bircan Dölek Ronja Düffel Lars Huth Leonard Priester David Sabel (General Chair)

1 0

2nd Call for Talks -- Haskell Implementors' Workshop
by Michael Hanus 04 Jul '18

04 Jul '18

Call for Contributions ACM SIGPLAN Haskell Implementors’ Workshop https://icfp18.sigplan.org/track/hiw-2018-papers Co-located with ICFP 2018 St. Louis, Missouri, US https://conf.researchr.org/home/icfp-2018 Important dates --------------- Proposal Deadline: Friday, 20 July, 2018 Notification: Friday, 3 August, 2018 Workshop: Sunday, 23 September, 2018 Keynote speaker --------------- This year, the Haskell Implementors’ Workshop is proud to present Rahul Muttineni as the keynote speaker. Rahul brough the joys of Haskell to the realm of Java by creating the Eta programming language. Title: Let's Go Mainstream with Eta! Eta is a fork of GHC that focuses on three core principles: user experience, performance, and safety. We'll discuss how we used these principles to guide the re-implementation of the GHC runtime and code generator on the JVM. Moreover, will also cover the inner workings of the FFI and the typechecker support we added for subtyping to make it smooth to interact with Java libraries. Finally, we'll round out with a look at where Eta is headed and how Eta and GHC can collaborate in the future. About the Haskell Implementors’ Workshop ---------------------------------------- The 10th Haskell Implementors’ Workshop is to be held alongside ICFP 2018 this year in St. Louis. It is a forum for people involved in the design and development of Haskell implementations, tools, libraries, and supporting infrastructure, to share their work and discuss future directions and collaborations with others. Talks and/or demos are proposed by submitting an abstract, and selected by a small program committee. There will be no published proceedings. The workshop will be informal and interactive, with open spaces in the timetable and room for ad-hoc discussion, demos and lightning talks. Scope and Target Audience ------------------------- It is important to distinguish the Haskell Implementors’ Workshop from the Haskell Symposium which is also co-located with ICFP 2018. The Haskell Symposium is for the publication of Haskell-related research. In contrast, the Haskell Implementors’ Workshop will have no proceedings – although we will aim to make talk videos, slides and presented data available with the consent of the speakers. The Implementors’ Workshop is an ideal place to describe a Haskell extension, describe works-in-progress, demo a new Haskell-related tool, or even propose future lines of Haskell development. Members of the wider Haskell community encouraged to attend the workshop – we need your feedback to keep the Haskell ecosystem thriving. Students working with Haskell are specially encouraged to share their work. The scope covers any of the following topics. There may be some topics that people feel we’ve missed, so by all means submit a proposal even if it doesn’t fit exactly into one of these buckets: * Compilation techniques * Language features and extensions * Type system implementation * Concurrency and parallelism: language design and implementation * Performance, optimisation and benchmarking * Virtual machines and run-time systems * Libraries and tools for development or deployment Talks ----- We invite proposals from potential speakers for talks and demonstrations. We are aiming for 20-minute talks with 5 minutes for questions and changeovers. We want to hear from people writing compilers, tools, or libraries, people with cool ideas for directions in which we should take the platform, proposals for new features to be implemented, and half-baked crazy ideas. Please submit a talk title and abstract of no more than 300 words. Submissions can be made via HotCRP at https://icfp-hiw18.hotcrp.com/ until July 20th (anywhere on earth). We will also have lightning talks session. These have been very well received in recent years, and we aim to increase the time available to them. Lightning talks be ~7mins and are scheduled on the day of the workshop. Suggested topics for lightning talks are to present a single idea, a work-in-progress project, a problem to intrigue and perplex Haskell implementors, or simply to ask for feedback and collaborators. Program Committee ----------------- * Edwin Brady (University of St. Andrews, UK) * Joachim Breitner – chair (University of Pennsylvania) * Ben Gamari (Well-Typed LLP) * Michael Hanus (Kiel University) * Roman Leshchinsky (Facebook) * Niki Vazou (University of Maryland) Contact ------- * Joachim Breitner <joachim(a)cis.upenn.edu> -- Joachim Breitner mail(a)joachim-breitner.de http://www.joachim-breitner.de/

1 0