Affiliation:
1. Radboud University Nijmegen, Nijmegen, Netherlands
Abstract
The functional programming languages Clean and Haskell have been around for over two decades. Over time, both languages have developed a large body of useful libraries and come with interesting language features. It is our primary goal to benefit from each other's evolutionary results by facilitating the exchange of sources between Clean and Haskell and study the forthcoming interactions between their distinct languages features. This is achieved by using the existing Clean compiler as starting point, and implementing a double-edged front end for this compiler: it supports both standard Clean 2.1 and (currently a large part of) standard Haskell 98. Moreover, it allows both languages to seamlessly use many of each other's language features that were alien to each other before. For instance, Haskell can now use uniqueness typing anywhere, and Clean can use newtypes efficiently. This has given birth to two new dialects of Clean and Haskell, dubbed Clean* and Haskell*. Additionally, measurements of the performance of the new compiler indicate that it is on par with the flagship Haskell compiler GHC.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference26 articles.
1. }}Peter Achten. Clean for Haskell 98 programmers - A quick reference guide. http://www.st.cs.ru.nl/papers/2007/achp2007-CleanHaskellQuickGuide.pdf 2007. }}Peter Achten. Clean for Haskell 98 programmers - A quick reference guide. http://www.st.cs.ru.nl/papers/2007/achp2007-CleanHaskellQuickGuide.pdf 2007.
2. The ins and outs of Clean I/O
3. }} Artem Alimarine and Rinus Plasmeijer . A generic programming extension for Clean. In Thomas Arts and Markus Mohnen editors Selected Papers of the 13th International Workshop on the Implementation of Functional Languages IFL '01 Stockholm Sweden volume 2312 of Lecture Notes in Computer Science pages 168 -- 186 . Springer-Verlag 2002 . }}Artem Alimarine and Rinus Plasmeijer. A generic programming extension for Clean. In Thomas Arts and Markus Mohnen editors Selected Papers of the 13th International Workshop on the Implementation of Functional Languages IFL '01 Stockholm Sweden volume 2312 of Lecture Notes in Computer Science pages 168--186. Springer-Verlag 2002.
4. }} Erik Barendsen and Sjaak Smetsers . Conventional and uniqueness typing in graph rewrite systems (extended abstract). In Rudrapatna Shyamasundar editor Proceedings of 13th Conference on the Foundations of Software Technology and Theoretical Computer Science FSTTCS '93 Bombay India volume 761 of Lecture Notes in Computer Science pages 41 -- 51 . Springer 1993 . }}Erik Barendsen and Sjaak Smetsers. Conventional and uniqueness typing in graph rewrite systems (extended abstract). In Rudrapatna Shyamasundar editor Proceedings of 13th Conference on the Foundations of Software Technology and Theoretical Computer Science FSTTCS '93 Bombay India volume 761 of Lecture Notes in Computer Science pages 41--51. Springer 1993.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献