2002 Proceeding- Conference Chair:
- Manuel Chakravarty
- Sponsor:
- sigplan
The purpose of the Haskell Workshop is to discuss experience with Haskell and to explore possible future developments for the language. The scope of the workshop includes all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell.The 2002 Haskell Workshop takes place on October 3, 2002 and is co-located with the International Conference on Functional Programming (ICFP'02) at Principles, Logics, and Implementations of High-Level Programming Languages (PLI'02), which is a confederation of conferences and workshops aimed at the advancement of high-level programming languages. These proceedings are distributed at the workshop and are published in an issue of SIGPLAN Notices. The nine papers were selected from 24 submissions in a careful selection process. Each paper was read in full and evaluated by at least three international referees. Based on the referee reports, the Programme Committee selected papers for presentation in a four day electronic PC meeting. In addition to formal paper presentations, the 2002 edition of the workshop includes two tool demonstrations, a couple of 10 minute talks, and the annual "The Future of Haskell" discussion.
Template meta-programming for Haskell
We propose a new extension to the purely functional programming language Haskell that supports compile-time meta-programming. The purpose of the system is to support the algorithmic construction of programs at compile-time.The ability to generate code ...
A formal specification of the Haskell 98 module system
Many programming languages provide means to split large programs into smaller modules. The module system of a language specifies what constitutes a module and how modules interact.This paper presents a formal specification of the module system for the ...
A recursive do for Haskell
Certain programs making use of monads need to perform recursion over the values of monadic actions. Although the do-notation of Haskell provides a convenient framework for monadic programming, it lacks the generality to support such recursive bindings. ...
Eager Haskell: resource-bounded execution yields efficient iteration
The advantages of the Haskell programming language are rooted in its clean equational semantics. Those advantages evaporate as soon as programmers try to write simple iterative computations and discover that their code must be annotated with calls to ...
Functional reactive programming, continued
Functional Reactive Programming (FRP) extends a host programming language with a notion of time flow. Arrowized FRP (AFRP) is a version of FRP embedded in Haskell based on the arrow combinators. AFRP is a powerful synchronous dataflow programming ...
Testing monadic code with QuickCheck
QuickCheck is a previously published random testing tool for Haskell programs. In this paper we show how to use it for testing monadic code, and in particular imperative code written using the ST monad. QuickCheck tests a program against a specification:...
Haddock, a Haskell documentation tool
This paper describes Haddock, a tool for automatically generating documentation from Haskell source code. Haddock's unique approach to source code annotations provides a useful separation between the implementation of a library and the interface (and ...
A lightweight implementation of generics and dynamics
The recent years have seen a number of proposals for extending statically typed languages by dynamics or generics. Most proposals --- if not all --- require significant extensions to the underlying language. In this paper we show that this need not be ...
Techniques for embedding postfix languages in Haskell
One popular use for Haskell in recent years has been as a host language for domain-specific embedded languages. But how can one embed a postfix language in Haskell, given that Haskell only supports prefix and infix syntax? This paper describes several ...
Recommendations
Acceptance Rates
| Year | Submitted | Accepted | Rate |
|---|---|---|---|
| Haskell '14 | 28 | 12 | 43% |
| Haskell '13 | 33 | 13 | 39% |
| Haskell '08 | 28 | 13 | 46% |
| Haskell '03 | 30 | 10 | 33% |
| Haskell '02 | 24 | 9 | 38% |
| Overall | 143 | 57 | 40% |