Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Welcome to the 13th ACM SIGPLAN Haskell Symposium! The focus of the Symposium is to present original research on Haskell and to discuss the practical experience of working with the language. Due to the COVID-19 pandemic, the Symposium is held online on 27-28 August 2020, co-located with ICFP 2020.

Haskell (Computer program language)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Build powerful software solutions and develop proficiency in Haskell, from understanding the foundational principles through to mastering advanced functional programming concepts Key Features Learn from an expert lecturer and researcher who knows all the ins and outs of Haskell Develop a clear understanding of Haskell, from the basics through to advanced concepts Get to grips with all the key functional programming techniques Purchase of the print or Kindle book includes a free PDF eBook Book Description With software systems reaching new levels of complexity and programmers aiming for the highest productivity levels, software developers and language designers are turning toward functional programming because of its powerful and mature abstraction mechanisms. This book will help you tap into this approach with Haskell, the programming language that has been leading the way in pure functional programming for over three decades. The book begins by helping you get to grips with basic functions and algebraic datatypes, and gradually adds abstraction mechanisms and other powerful language features. Next, you'll explore recursion, formulate higher-order functions as reusable templates, and get the job done with laziness. As you advance, you'll learn how Haskell reconciliates its purity with the practical need for side effects and comes out stronger with a rich hierarchy of abstractions, such as functors, applicative functors, and monads. Finally, you'll understand how all these elements are combined in the design and implementation of custom domain-specific languages for tackling practical problems such as parsing, as well as the revolutionary functional technique of property-based testing. By the end of this book, you'll have mastered the key concepts of functional programming and be able to develop idiomatic Haskell solutions. What you will learn Write pure functions in all their forms - that is basic, recursive, and higher-order functions Model your data using algebraic datatypes Master Haskell's powerful type-class mechanism for ad hoc overloading Find out how Haskell's laziness gets the job done Reconcile Haskell's functional purity with side effects Familiarize yourself with the functor, applicative functor, monad hierarchy Discover how to solve problems with domain-specific languages Find more bugs with Haskell's property-based testing approach Who this book is for If you are a programmer looking to gain knowledge of Haskell who's never been properly introduced to functional programming, this book is for you. Basic experience with programming in a non-functional language is a prerequisite. This book also serves as an excellent guide for programmers with limited exposure to Haskell who want to deepen their understanding and foray further into the language.

Haskell (Computer program language) --- Functional programming (Computer science)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Mathematical logic --- Logic --- Computer science --- Programming --- Artificial intelligence. Robotics. Simulation. Graphics --- Computer. Automation --- ontwerpen --- programmeren (informatica) --- programmeertalen --- wiskunde --- software engineering --- KI (kunstmatige intelligentie) --- robots

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Constraint Handling Rules (CHR) is een programmeertaal gebaseerd op regels die ingebed wordt in een andere taal. CHR combineert elementen van Constraint Logic Programming en termherschrijfsystemen. Er bestaan verschillende implementaties van CHR in Prolog, Haskell, Java en HAL. Typische toepassingen van CHR liggen in het domein van constraint solving, maar CHR wordt tegenwoordig ook gebruikt voor een brede waaier aan toepassingen gaande van type checking over verwerking van natuurlijke taal tot multi-agentsystemen. In dit werk leveren we bijdragen op het gebied van programma-analyses, programma-optimalisaties en uitbreidingen van de CHR-taal. We stellen verschillende nieuwe optimalisaties voor de geoptimaliseerde compilatie van CHR voor: codespecialisatie voor ground constraints, anti-monotonic delay avoidance, hashtabllen voor constraint stores en een nieuwe late storage-optimalisatie. Deze en andere optimalisaties zijn opgenomen in een nieuw state-of-the-art CHR-systeem: het K.U.Leuven CHR-systeem. Abstracte interpretatie is een alegemene techniek voor programma-anlyse. We stellen een raamwerk voor om programma-analyse met behulp van abstracte interpretatie te doen, in het bijzonder om programma-optimalisaties aan te sturen. Dit raamwerk maakt het mogelijk om analyes op een uniforme wijze te formuleren en gemakklijk verbeteringen en combinaties van bestaande analyses te maken. We evalueren ook het nut van analyses voor theoretische eigenschappen, confluentie en tijdscomplexiteit, bij een praktisch programma om hun relevantie te bepalen. We leveren twee bijdragen op het gebied van verbeterde expressiviteit van CHR. De eerste uitbreidingbetreft de integratie van CHR met getabuleerde uitvoering. Getabuleerde uitvoering voorkomt vele vormen van non-terminatie en is nuttig voor automatische optimalisatie door hergebruik van eerdere berekeningen. De tweede uitbreiding voegt automatisch functionaliteit toe om implicaties na te gaan aan constraint solvers geschreven in CHR. Deze functionaliteit is essentieel om complexe constraints op te bouwen uit eenvoudige en om verschillende constraint solvers te combineren. Constraint Handling Rules (CHR) is a rule-based language commonly embedded in a host language. It combines elements of Constraint Logic Programming and term rewriting. Several implementations of CHR exist: in Prolog, Haskell, Java and HAL. Typical applications of CHR are in the area of constraint solving, but currently CHR is also used in a wider range of applications, such as type checking, natural language processing and multi-agent systems. In this work we contribute program analyses, program optimizations and extensions of the CHR language. For the optimized compilation of CHR we present several new optimizations: code specialization for ground constraints, anti-monotonic delay avoidance, hashtable constraint stores and a new late storage optimization. These and other optimizations have been implemented in a new state-of-the-art CHR system: the K.U.Leuven CHR system. Abstract interpretation is a general technique for program analysis. We propose a framework of abstract interpretation for the CHR language, in particular for the formulation of analyses that drive program optimization. This frameworks allows for the uniform formulation of program analyses as well as easier improvements and combinations of existing analyses. We also evaluate analyses for theoretical properties, confluence and time complexity, on a practical case study to investigate their relevance. We contribute two extensions to the expressivity of CHR. The first extension comprises the integration of CHR with tabled execution. Tabled execution avoids many forms of non-termination and is useful for automatic program optimization through the dynamic reuse of previous computations. The second extension automatically provides implication checking functionality to constraint solvers written in CHR. Implication checking is an essential building block for formulating complex constraints in terms of basic constraints andfor composing constraint solvers. Constraint Handling Rules (CHR) is een programmeertaal gebaseerd op regels die ingebed wordt in een andere taal. CHR combineert elementen van Constraint Logic Programming en termherschrijfsystemen. In deze thesis leveren we bijdragen tot deautomatische analyse en de geoptimaliseerde compilatie van CHR-programma's. Daarnaast verhogen we de expressiviteit van de taal met twee uitbreidingen: de integratie met getabuleerde uitvoering en automatische functionaliteit voor het nagaan van implicaties bij constraint solvers geschreven in CHR. Constraint Handling Rules (CHR) is a rule-based language commonly embedded in a host language. It combines elements of Constraint Logic Programming and term rewriting. In this thesis we contribute to the analysis and optimized compilation of CHR programs. In addition we extend the expressivity of the language in two ways: integration of CHR with tabled execution and automatic functionality for implication checking in constraint solvers implemented in CHR.

681.3*I23 <043> --- Academic collection --- Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence)--Dissertaties --- Theses --- 681.3*I23 <043> Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence)--Dissertaties