- Haskell - Haskell.org

[EDI-2020] Call for workshop proposals: 3rd International Conference on Emerging Data and Industry 4.0. Warsaw, Poland (April 6-9, 2020)
by Wim Ectors 26 Sep '19

26 Sep '19

*************************************************************************** The 3rd International Conference on Emerging Data and Industry 4.0 (EDI40) Warsaw, Poland April 6-9, 2020 *************************************************************************** Conference Website: http://cs-conferences.acadiau.ca/EDI40-20/ Workshops: http://cs-conferences.acadiau.ca/EDI40-20/#workshop Important Dates - Workshops Proposals Due: October 15, 2019 - Paper Submission Due: November 15, 2019 - Acceptance Notification: January 13, 2020 - Camera-Ready Submission: February 10, 2020 EDI40 2020 accepted papers will be published by Elsevier Science in the open-access Procedia Computer Science series on-line. Procedia Computer Science is hosted by Elsevier on www.Elsevier.com and on Elsevier content platform ScienceDirect (www.sciencedirect.com) and will be freely available worldwide. All papers in Procedia will be indexed by Scopus ( www.scopus.com) and by Thomson Reuters' Conference Proceeding Citation Index (http://thomsonreuters.com/conference-proceedings-citation-index/) All papers in Procedia will also be indexed by Scopus (www.scopus.com) and Engineering Village (Ei) (www.engineeringvillage.com) This includes EI Compendex (www.ei.org/compendex) Moreover, all accepted papers will be indexed in DBLP (http://dblp.uni-trier.de/) The papers will contain linked references, XML versions and citable DOI numbers. You will be able to provide a hyperlink to all delegates and direct your conference website visitors to your proceedings. Selected papers will be invited for publication, in the special issues of: - International Journal of Ambient Intelligence and Humanized Computing (IF: 1.910), by Springer (http://www.springer.com/engineering/journal/12652) - International Journal of Computing and Informatics (IF: 0.524), by Computing and Informatics (http://www.cai.sk/ojs/index.php/cai/index) EDI40 2019 will be held in Warsaw, Poland. Warsaw is the capital and largest city of Poland. The metropolis stands on the Vistula River in east-central Poland and its population is officially estimated at 1.770 million residents within a greater metropolitan area of 3.1 million residents, which makes Warsaw the 8th most-populous capital city in the European Union. The city limits cover 516.9 square kilometres (199.6 sq mi), while the metropolitan area covers 6,100.43 square kilometres (2,355.39 sq mi). Warsaw is an alpha global city, a major international tourist destination, and a significant cultural, political and economic hub. Its historical Old Town was designated a UNESCO World Heritage Site. EDI40 2019 will be held in conjunction with the 11th International Conference on Ambient Systems, Networks and Technologies (ANT, http://cs-conferences.acadiau.ca/ant-20/) Conference Tracks - Benefits of Industry 4.0 - Big Data and Analytics - Cloud Computing - Cognitive Computing - Computational Intelligence - Cyber-Physical Systems (CPS) - Fog Computing and Edge Computing - Internet of Everything (IoE) - Standards for IoT Application Integration - The New Business Models in Industry 4.0 - General Track: Digitalization Startegies Committees General Chair Danny Hughes, CTO VeraSense NV, Belgium Program Chairs Jamal Bentahar, Concordia University, Canada Haroon Malik, Marshall University, USA Local Chair Nuno Varandas, F6S (Where Founders Grow Together), Portugal Workshops Chair Stephane Galland, UTBM, France Program Advisory Committee Reda Alhajj, University of Calgary, Canada Ladislav Hluchy, Institute of Informatics, Slovak Academy of Sciences, Slovakia Vincenzo Loia, University of Salerno, Italy Peter Sloot, Universiteit van Amsterdam, Netherlands Peter Thomas, Manifesto Research, Australia Mohamed Younis, University of Maryland Baltimore County, USA International Journals Chair Michael Sheng, Macquarie University, Australia Publicity Chairs Wim Ectors, Hasselt University, Belgium Faouzi Kammoun, Ecole SupÃ©rieure PrivÃ©e d'IngÃ©nierie et de Technologies, Tunis Aneta Poniszewska-MaraÅ„da, Lodz University of Technology, Poland Technical Program Committee http://cs-conferences.acadiau.ca/EDI40-20/#programCommittees International Liaison Chairs Soumaya Cherkaoui, Sherbrooke University, Canada Nik Bessis, Edge Hill University, UK David Taniar, Monash University, Australia Steering Committee Chair and Founder Elhadi Shakshuki, Acadia University, Canada Sent via Mail Merge <https://chrome.google.com/webstore/detail/mail-merge-with-attachmen/nifmcbj…>

1 0

[ABMTRANS-2020] 9th International Workshop on Agent-based Mobility, Traffic and Transportation Models, Methodologies and Applications. Warsaw, Poland (April 6-9, 2020)
by Wim Ectors 26 Sep '19

26 Sep '19

The 11th International Conference on Ambient Systems, Networks and Technologies (ANT) Warsaw, Poland April 6-9, 2020 Conference Website: http://cs-conferences.acadiau.ca/ant-20/ Workshops: http://cs-conferences.acadiau.ca/ant-20/#workshop Tutorials: http://cs-conferences.acadiau.ca/ant-20/#tutorial Important Dates - Workshops Proposals Due: October 15, 2019 - Paper Submission Due: November 15, 2019 - Acceptance Notification: January 13, 2020 - Camera-Ready Submission: February 10, 2020 ANT 2020 accepted papers will be published by Elsevier Science in the open-access Procedia Computer Science series on-line. Procedia Computer Science is hosted by Elsevier on www.Elsevier.com and on Elsevier content platform ScienceDirect (www.sciencedirect.com) and will be freely available worldwide. All papers in Procedia will be indexed by Scopus ( www.scopus.com) and by Thomson Reuters' Conference Proceeding Citation Index (http://thomsonreuters.com/conference-proceedings-citation-index/) All papers in Procedia will also be indexed by Scopus (www.scopus.com) and Engineering Village (Ei) (www.engineeringvillage.com) This includes EI Compendex (www.ei.org/compendex) Moreover, all accepted papers will be indexed in DBLP (http://dblp.uni-trier.de/) The papers will contain linked references, XML versions and citable DOI numbers. You will be able to provide a hyperlink to all delegates and direct your conference website visitors to your proceedings. Selected papers will be invited for publication, in the special issues of: - Journal of Ambient Intelligence and Humanized Computing (IF: 1.910), by Springer (http://www.springer.com/engineering/journal/12652) - International Journal of Computing and Informatics (IF: 0.524), by Computing and Informatics (http://www.cai.sk/ojs/index.php/cai/index) ANT 2020 will be held in Warsaw, Poland. Warsaw is the capital and largest city of Poland. The metropolis stands on the Vistula River in east-central Poland and its population is officially estimated at 1.770 million residents within a greater metropolitan area of 3.1 million residents, which makes Warsaw the 8th most-populous capital city in the European Union. The city limits cover 516.9 square kilometres (199.6 sq mi), while the metropolitan area covers 6,100.43 square kilometres (2,355.39 sq mi). Warsaw is an alpha global city, a major international tourist destination, and a significant cultural, political and economic hub. Its historical Old Town was designated a UNESCO World Heritage Site. ANT 2020 will be held in conjunction with the 3rd International Conference on Emerging Data and Industry 4.0 (EDI40, http://cs-conferences.acadiau.ca/edi40-20/) Conference Tracks - Agent Systems, Intelligent Computing and Applications - Big Data and Analytics - Cloud Computing - Context-awareness and Multimodal Interfaces - Emerging Networking, Tracking and Sensing Technologies - Human Computer Interaction - Internet of Things - Mobile Networks, Protocols and Applications - Modelling and Simulation in Transportation Sciences - Multimedia and Social Computing - Service Oriented Computing for Systems & Applications - Smart, Sustainable Cities and Climate Change Management - Smart Environments and Applications - Systems Security and Privacy - Systems Software Engineering - Vehicular Networks and Applications - General Track Committees General Chairs Atta Badii, University of Reading, UK Albert Zomaya, The University of Sydney, Australia Program Chairs Hossam Hassanein, Queen's University, Canada Ansar-Ul-Haque Yasar, IMOB â€“ Hasselt University, Belgium Local Chair Nuno Varandas, F6S (Where Founders Grow Together), Portugal Workshops Chair Stephane Galland, UTBM, France Program Vice Chairs Boulmakoul Azedine, Hassan II University, Morocco Nik Bessis, Edge Hill University, UK Kechar Bouabdellah, Oran 1 Ahmed BenBella University, Algeria Samia Bouzefrane,CEDRIC Lab Conservatoire National des Arts et MÃ©tiers, France Robertas Damasevicius, Kaunas University of Technology, Lithuania Roberto Di Pietro, Hamad Bin Khalifa University, Qatar Salem Gharbia, University College Dublin, Ireland Jason Jaskolka, Carleton University, Canada Faouzi Kammoun, Ecole SupÃ©rieure PrivÃ©e d'IngÃ©nierie et de Technologies, Tunis Natalia Kryvinska, University of Vienna, Austria Flavio Lombardi, Roma Tre University of Rome, Italy Vuk Marojevic, Mississippi State University, USA Haroon Malik, Marshall University, USA Ahmed Nait Sidi Moh, University of Picardie Jules Verne, France Aneta Poniszewska-MaraÅ„da, Lodz University of Technology, Poland Stefan Schulte, TU Wien, Austria Miguel Sepulcre, Miguel Hernandez University of Elche, Spain Khaled Shaaban, Qatar University, Qatar Yves Vanrompay, Hasselt University, Belgium Publicity Chairs Wim Ectors, Hasselt University, Belgium Joanna Ochelska-Mierzejewska, Lodz University of Technology, Poland Josep-Maria Salanova, CERTH, Greece International Journals Chair Michael Sheng, Macquarie University, Australia Advisory Committee Reda Alhajj, University of Calgary, Canada Sajal K. Das, The University of Texas at Arlington, USA Erol Gelenbe, Imperial College, UK Ibad Kureshi, Inlecomm Systems, Belgium Vincenzo Loia, University of Salerno, Italy Peter Sloot, Universiteit van Amsterdam, Netherlands Ralf Steinmetz, Technische Universitaet Darmstadt, Germany Katia Sycara, Carnegie Mellon University, USA Peter Thomas, Manifesto Research, Australia International Liaison Chairs Soumaya Cherkaoui, Sherbrooke University, Canada Paul Davidsson, Malmo University, Sweden David Taniar, Monash University, Australia Technical Program Committee http://cs-conferences.acadiau.ca/ant-20/#programCommittees Steering Committee Chair and Founder of ANT Elhadi Shakshuki, Acadia University, Canada Sent via Mail Merge <https://chrome.google.com/webstore/detail/mail-merge-with-attachmen/nifmcbj…>

1 0

FM'19 - 2nd Call for Participation
by Renato Neves 25 Sep '19

25 Sep '19

3rd World Congress on Formal Methods Porto, October 7-11, 2019 http://formalmethods2019.inesctec.pt/ @formalmethods19 ______________________________________________________________ *** Apologies for cross-posting *** ______________________________________________________________ *** FM Week News: Tony Hoare's keynote (Oct 8) jointly organized by UTP'19, LOPSTR'19, MPC'19, PPDP'19 and RV'19 will mark the 50th anniversary (October 1969) of the publication of "An Axiomatic Basis for Computer Programming”. ______________________________________________________________ The FM'19 World Congress on Formal Methods will take place at the Alfandega do Porto Congress Center, Porto, October 7-11, 2019, under the motto "The Next 30 Years". Registration is open at https://bit.ly/2JfdBjO as follows: . Early – until Sep 10 (AoE) . Late – from Sep 11 until Oct 5 (AoE) . On site – from Oct 6 to Oct 11 (AoE) Further to the Industry day, Tool Exhibition, Doctoral Symposium (and a social event on Oct 10), FM'19 involves more than 30 parallel events (symposia, conferences, workshops and tutorials) spreading over several FM related areas: . FM 2019 – 23rd International Symposium on Formal Methods . LOPSTR 2019 – 29th International Symposium on Logic-Based Program Synthesis and Transformation . MPC 2019 – 13th International Conference on Mathematics of Program Construction . PPDP 2019 – 21st International Symposium on Principles and Practice of Declarative Programming . RV 2019 – 19th International Conference on Runtime Verification . SAS 2019 – 26th International Static Analysis Symposium . TAP 2019 – 13th International Conference on Tests and Proofs . UTP 2019 – 7th International Symposium on Unifying Theories of Programming . VECoS 2019 – 13th International Conference on Verification and Evaluation of Computer and Communication Systems . AFFORD 2019 – Practical Formal Verification for Software Dependability . DALI 2019 – 2nd Workshop on Dynamic Logic: New Trends and Applications . DataMod 2019 – 8th International Symposium “From Data to Models and Back (DataMod)” . FMAS 2019 – Formal Methods for Autonomous Systems . FMBC 2019 – Workshop on Formal Methods for Blockchains . FMIS 2019 – 8th Formal Methods for Interactive Systems Workshop . FMTea 2019 – Formal Methods Teaching Workshop and Tutorial . F-IDE 2019 – 5th Workshop on Formal Integrated Development Environment . HFM 2019 – History of Formal Methods . NSAD 2019 – 8th International Workshop on Numerical and Symbolic Abstract Domains . OpenCERT 2019 – 9th Int. Workshop on Open Community approaches to Education, Research and Technology . OVT 2019 – 17th Overture Workshop . REFINE 2019 – 19th Refinement Workshop . RPLA 2019 – Reversibility in Programming, Languages, and Automata . SASB 2019 – 10th International Workshop on Static Analysis and Systems Biology . TAPAS 2019 – 10th Workshop on Tools for Automatic Program Analysis . ALLOY – Formal software design with Alloy and Electrum (Tutorial) . CbC – The Correctness by Construction Approach to Programming (Tutorial) . FM4BioMed – Formal Methods for BioMedicine (Tutorial) . FRAMA-C-IoT – Formal Verification of IoT Software with Frama-C (Tutorial) . KEYMAERA X – Modular Formal Verification of Cyber-Physical Systems with KeYmaera X (Tutorial) . MLFV – ML + FV = ♥? A Gentle Introduction to the use of Machine Learning within Formal Verification Tools (Tutorial) . SRV – Stream-based Runtime Verification (Tutorial) As a whole, the FM'19 congress will bring together a distinguished group of 40+ world-top guest speakers whose short bios can be found at https://bit.ly/2Io2Lsh. The FM'19 organizers thank all corporations that have been so kind to sponsor the Congress – please see the 'Sponsor FM'19' gallery at https://bit.ly/2CrKnMA. For more information, please visit the following pages of the FM'19 website: . FM Week - https://bit.ly/2zsyCUu . Accepted papers - https://bit.ly/2YtIp9Y (updated as data arrive from event chairs; currently: 344 papers involving 750 authors) . Call for participation - https://bit.ly/2JfdBjO . Registration page - https://bit.ly/2NTR9SR . Venue - https://bit.ly/2MdNCMu . Accommodation - https://bit.ly/2OuHXEu . Getting to Porto - https://bit.ly/2ykguKN . Social program - https://bit.ly/2JfdBjO . Weather forecast - https://bit.ly/2SLOKZ5 (or https://bit.ly/2YjeEo3 for more details) Contact: contactfm2019(a)inesctec.pt We are also on Twitter: @formalmethods19 _____________________________________________________________ *** Welcome to FM'19 *** *** Welcome to PORTO *** *** Welcome to Portugal *** ______________________________________________________________

1 1

ANNOUNCE: mmsyn2 -- a new library instead of deprecated mm2
by olexandr543＠yahoo.com 24 Sep '19

24 Sep '19

Hello! I made mm2 deprecated because of collision with other names (see e. g.: MM2 | | | | MM2 Mm2 is a short form for square megameter, also an international unit of area. | | | ). Now its successor is named mmsyn2 (mmsyn2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations | | | | mmsyn2: The library that can be used for optimization of multiple (Ord a... Install via `cabal install mmsyn2`. | | | ). I made some optimization improvements while benchmark testing, but the last one is not yet complete and ready at the moment. Therefore, I left the documentation (except some minor corrections) and work on testing. Best regards,Oleksandr Zhabenko. вівторок, 24 вересня 2019 р., 22:37:03 GMT+3, Олександр Жабенко <olexandr576(a)yahoo.com> написав: Hello! I made mm2 deprecated because of collision with other names (see e. g.: MM2 | | | | MM2 Mm2 is a short form for square megameter, also an international unit of area. | | | ). Now its successor is named mmsyn2 (mmsyn2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations | | | | mmsyn2: The library that can be used for optimization of multiple (Ord a... Install via `cabal install mmsyn2`. | | | ). I made some optimization improvements while benchmark testing, but the last one is not yet complete and ready at the moment. Therefore, I left the documentation (except some minor corrections) and work on testing. Best regards,Oleksandr Zhabenko.

1 0

Re: [Haskell] ANNOUNCE: mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations
by olexandr543＠yahoo.com 21 Sep '19

21 Sep '19

I did not check the code for 'case ... of ...' constuction in GHC, my intention comes from the explanations how this construction works in Haskell in some teaching materials.So, definitely I should do more exploratory work. Nevertheless, the type signatures and sorting is realized for rather general situation and can be therefore preferable for some situations. Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 21:07:25 GMT+2, Олександр Жабенко <olexandr576(a)yahoo.com> написав: I did not check the code for 'case ... of ...' constuction in GHC, my intention comes from the explanations how this construction works in Haskell in some teaching materials.So, definitely I should do more exploratory work. Nevertheless, the type signatures and sorting is realized for rather general situation and can be therefore preferable for some situations. Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 20:59:03 GMT+2, olexandr543(a)yahoo.com <olexandr543(a)yahoo.com> написав: Yes, you can use IntMap. It needs another dependency and the complexity choice as O(log (min (n, W))) where W is a number of bits in a representing key, used for mapping. For me, it is rather hard to solve whether it can be better, because it raises another problem of efficient binary representation of the keys. While working on the topic, I found out that may be the most efficient will be hashing (for lookup it can be used e. g. Cuckoo hashing) and there is a library in Haskell for it.Data.HashTable.IO Using it, you can write something like: {-# LANGUAGE ScopedTypeVariables #-} module Main where import qualified Data.HashTable.IO as I import Data.Maybe (fromJust,isJust) import System.Environment (getArgs) main :: IO () main = do args <- getArgs let a = [([z,t],x) | x <- ['a'..'d'], z <- ['f'..'t'], t <- ['a'..'p'], [x,z,t] <= "fnf"] b :: I.CuckooHashTable String Char <- I.fromList a c <- I.lookup b ("kn") let d1 u = do d <- I.lookup b u print c if isJust d then putStrLn . show . fromJust $ d else putStrLn "Nothing" return () if null args then d1 "fa" else d1 (head $ args) | | | | Data.HashTable.IO | | | so it works. And the library documentation says that a complexity of Cuckoo hash lookup is about O(1), but with hashing there are questions of ratio of fulfilling the buckets and collisions. So, my library having the very generic constraints can be used instead. Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 21:52:18 GMT+3, olexandr543(a)yahoo.com <olexandr543(a)yahoo.com> написав: Yes, you can. It needs another dependency and the complexity choice as O(log (min (n, W))) where W is a number of bits in a representing key, used for mapping. For me, it is rather hard to solve whether it can be better, because it raises another problem of efficient binary representation of the keys. While working on the topic, I found out that may be the most efficient will be hashing (for lookup it can be used e. g. Cuckoo hashing) and there is a library in Haskell for it.Data.HashTable.IO Using it, you can write something like: {-# LANGUAGE ScopedTypeVariables #-} module Main where import qualified Data.HashTable.IO as I import Data.Maybe (fromJust,isJust) import System.Environment (getArgs) main :: IO () main = do args <- getArgs let a = [([z,t],x) | x <- ['a'..'d'], z <- ['f'..'t'], t <- ['a'..'p'], [x,z,t] <= "fnf"] b :: I.CuckooHashTable String Char <- I.fromList a c <- I.lookup b ("kn") let d1 u = do d <- I.lookup b u print c if isJust d then putStrLn . show . fromJust $ d else putStrLn "Nothing" return () if null args then d1 "fa" else d1 (head $ args) | | | | Data.HashTable.IO | | | so it works. And the library documentation says that a complexity of Cuckoo hash lookup is about O(1), but with hashing there are questions of ratio of fulfilling the buckets and collisions. So, my library having the very generic constraints can be used instead. Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 21:34:38 GMT+3, Henning Thielemann <lemming(a)henning-thielemann.de> написав: On Sat, 21 Sep 2019, olexandr543--- via Haskell wrote: > My library that can help to optimize using 'case ... of ...' construction if there are multiple (more than at > least 5) variants. > mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations Isn't this a problem you would solve using Data.Map?

1 0

Re: [Haskell] ANNOUNCE: mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations
by olexandr543＠yahoo.com 21 Sep '19

21 Sep '19

Yes, you can use IntMap. It needs another dependency and the complexity choice as O(log (min (n, W))) where W is a number of bits in a representing key, used for mapping. For me, it is rather hard to solve whether it can be better, because it raises another problem of efficient binary representation of the keys. While working on the topic, I found out that may be the most efficient will be hashing (for lookup it can be used e. g. Cuckoo hashing) and there is a library in Haskell for it.Data.HashTable.IO Using it, you can write something like: {-# LANGUAGE ScopedTypeVariables #-} module Main where import qualified Data.HashTable.IO as I import Data.Maybe (fromJust,isJust) import System.Environment (getArgs) main :: IO () main = do args <- getArgs let a = [([z,t],x) | x <- ['a'..'d'], z <- ['f'..'t'], t <- ['a'..'p'], [x,z,t] <= "fnf"] b :: I.CuckooHashTable String Char <- I.fromList a c <- I.lookup b ("kn") let d1 u = do d <- I.lookup b u print c if isJust d then putStrLn . show . fromJust $ d else putStrLn "Nothing" return () if null args then d1 "fa" else d1 (head $ args) | | | | Data.HashTable.IO | | | so it works. And the library documentation says that a complexity of Cuckoo hash lookup is about O(1), but with hashing there are questions of ratio of fulfilling the buckets and collisions. So, my library having the very generic constraints can be used instead. Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 21:52:18 GMT+3, olexandr543(a)yahoo.com <olexandr543(a)yahoo.com> написав: Yes, you can. It needs another dependency and the complexity choice as O(log (min (n, W))) where W is a number of bits in a representing key, used for mapping. For me, it is rather hard to solve whether it can be better, because it raises another problem of efficient binary representation of the keys. While working on the topic, I found out that may be the most efficient will be hashing (for lookup it can be used e. g. Cuckoo hashing) and there is a library in Haskell for it.Data.HashTable.IO Using it, you can write something like: {-# LANGUAGE ScopedTypeVariables #-} module Main where import qualified Data.HashTable.IO as I import Data.Maybe (fromJust,isJust) import System.Environment (getArgs) main :: IO () main = do args <- getArgs let a = [([z,t],x) | x <- ['a'..'d'], z <- ['f'..'t'], t <- ['a'..'p'], [x,z,t] <= "fnf"] b :: I.CuckooHashTable String Char <- I.fromList a c <- I.lookup b ("kn") let d1 u = do d <- I.lookup b u print c if isJust d then putStrLn . show . fromJust $ d else putStrLn "Nothing" return () if null args then d1 "fa" else d1 (head $ args) | | | | Data.HashTable.IO | | | so it works. And the library documentation says that a complexity of Cuckoo hash lookup is about O(1), but with hashing there are questions of ratio of fulfilling the buckets and collisions. So, my library having the very generic constraints can be used instead. Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 21:34:38 GMT+3, Henning Thielemann <lemming(a)henning-thielemann.de> написав: On Sat, 21 Sep 2019, olexandr543--- via Haskell wrote: > My library that can help to optimize using 'case ... of ...' construction if there are multiple (more than at > least 5) variants. > mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations Isn't this a problem you would solve using Data.Map?

1 0

ANNOUNCE: mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations
by olexandr543＠yahoo.com 21 Sep '19

21 Sep '19

Hello! My library that can help to optimize using 'case ... of ...' construction if there are multiple (more than at least 5) variants.mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations Best regards,Oleksandr Zhabenko.

4 3

Re: [Haskell] ANNOUNCE: mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations
by olexandr543＠yahoo.com 21 Sep '19

21 Sep '19

Hello! Matthew, no, I don't benchmark this library, it should be more sufficient theoretically because it uses binary search rather than linear, and the first one is known to be more efficient. I used the similar technique for writing code for my project mm1. There I firstly used case but then manually made optimization using case and guards and if-then-else. You can see it for different releases for mm1. The manually optimized program being added additional functionality after optimizing were a little more efficient, but it should be mentioned that most time while it is running the espeak and sox being worked, so I think it should be more efficient for such situations. | | | | | | | | | | | OleksandrZhabenko/mm1 Program that reads Ukrainian text using eSpeak and SoX. - OleksandrZhabenko/mm1 | | | I can try to do benchmarking, but it needs some time in advance. Thank you for your advice! Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 21:26:35 GMT+3, Олександр Жабенко <olexandr576(a)yahoo.com> написав: Hello! Matthew, no, I don't benchmark this library, it should be more sufficient theoretically because it uses binary search rather than linear, and the first one is known to be more efficient. I used the similar technique for writing code for my project mm1. There I firstly used case but then manually made optimization using case and guards and if-then-else. You can see it for different releases for mm1. The manually optimized program being added additional functionality after optimizing were a little more efficient, but it should be mentioned that most time while it is running the espeak and sox being worked, so I think it should be more efficient for such situations. | | | | | | | | | | | OleksandrZhabenko/mm1 Program that reads Ukrainian text using eSpeak and SoX. - OleksandrZhabenko/mm1 | | | I can try to do benchmarking, but it needs some time in advance. Thank you for your advice! Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 20:04:32 GMT+2, olexandr543(a)yahoo.com <olexandr543(a)yahoo.com> написав: Hello! Matthew, no, I don't benchmark this library, it should be more sufficient theoretically because it uses binary search rather than linear, and the first one is known to be more efficient. I used the similar technique for writing code for my project mm1. There I firstly used case but then manually made optimization using case and guards and if-then-else. You can see it for different releases for mm1. The manually optimized program being added additional functionality after optimizing were a little more efficient, but it should be mentioned that most time while it is running the espeak and sox being worked, so I think it should be more efficient for such situations. | | | | | | | | | | | OleksandrZhabenko/mm1 Program that reads Ukrainian text using eSpeak and SoX. - OleksandrZhabenko/mm1 | | | I can try to do benchmarking, but it needs some time in advance. Thank you for your advice! Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 15:46:38 GMT+2, Matthew Pickering <matthewtpickering(a)gmail.com> написав: Have you benchmarked this library? I don't see how using a vector can be any faster than using a case. On Sat, 21 Sep 2019, 14:00 olexandr543--- via Haskell, <haskell(a)haskell.org> wrote: Hello! My library that can help to optimize using 'case ... of ...' construction if there are multiple (more than at least 5) variants.mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations Best regards,Oleksandr Zhabenko. _______________________________________________ Haskell mailing list Haskell(a)haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell

2 1

ANNOUNCE: mm2 -- the library that can be used for optimization of multiple (Ord a) => a -> b transformations
by olexandr543＠yahoo.com 21 Sep '19

21 Sep '19

Hello! My library that can help to optimize usage of the 'case ... of ...' construction if there are multiple (more than at least 5) variants is published on Hackage.mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 14:20:02 GMT+2, Олександр Жабенко <olexandr576(a)yahoo.com> написав: Hello! My library that can help to optimize using 'case ... of ...' construction if there are multiple (more than at least 5) variants.mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations Best regards,Oleksandr Zhabenko. | | | | mm2: The library that can be used for optimization of multiple (Ord a) =... Install via `cabal install mm2`. | | |

1 0

Call for Contributions: BOB 2020 [Feb 28, Deadline Nov 8]
by Stefan Wehr 17 Sep '19

17 Sep '19

BOB Conference 2020 "What happens when we use what's best for a change?" http://bobkonf.de/2020/cfc.html Berlin, February 28 Call for Contributions Deadline: November 8, 2019 You are actively engaged in advanced software engineering methods, implement ambitious architectures and are open to cutting-edge innovation? Attend this conference, meet people that share your goals, and get to know the best software tools and technologies available today. We strive to offer a day full of new experiences and impressions that you can use to immediately improve your daily life as a software developer. If you share our vision and want to contribute, submit a proposal for a talk or tutorial! NOTE: The conference fee will be waived for presenters. Travel expenses will not be covered (for exceptions see "Speaker Grants"). Speaker Grants BOB has Speaker Grants available to support speakers from groups under-represented in technology. We specifically seek women speakers and speakers who are not be able to attend the conference for financial reasons. Shepherding ----------- The program committee offers shepherding to all speakers. Shepherding provides speakers assistance with preparing their sessions, as well as a review of the talk slides. Topics ------ We are looking for talks about best-of-breed software technology, e.g.: - functional programming - persistent data structures and database - event-based modelling and architectures - types - formal methods for correctness and robustness - abstractions for concurrency and parallelism - metaprogramming - probabilistic programming - math and programming - controlled side effects - beyond REST and SOAP - effective abstractions for data analytics - ... everything really that isn’t mainstream, but you think should be. Presenters should provide the audience with information that is practically useful for software developers. We're especially interested in experience reports. Other topics are also relevant, e.g.: - introductory talks on technical background - overviews of a given field - demos and how-tos Requirements ------------- We accept proposals for presentations of 45 minutes (40 minutes talk + 5 minutes questions), as well as 90 minute tutorials for beginners. The language of presentation should be either English or German. Your proposal should include (in your presentation language of choice): - An abstract of max. 1500 characters. - A short bio/cv - Contact information (including at least email address) - A list of 3-5 concrete ideas of how your work can be applied in a developer's daily life - additional material (websites, blogs, slides, videos of past presentations, …) Submit here: https://bobcfc.active-group.de/en/bob2020/cfp Organisation ------------ - Direct questions to contact at bobkonf dot de - Proposal deadline: November 8, 2019 - Notification: November 22, 2019 - Program: December 6, 2019 Program Committee ----------------- (more information here: https://bobkonf.de/2020/programmkomitee.html) - Matthias Fischmann, Wire - Matthias Neubauer, SICK AG - Nicole Rauch, Softwareentwicklung und Entwicklungscoaching - Michael Sperber, Active Group - Stefan Wehr, factis research Scientific Advisory Board - Annette Bieniusa, TU Kaiserslautern - Torsten Grust, Uni Tübingen - Peter Thiemann, Uni Freiburg

1 0