Haskell 98 Libraries: Maybe Utilities
18.1 Library Maybe 192
916 papers · page 31 of 46
Haskell 98 Libraries: Character Utilities
19.1 Library Char 195
Haskell 98 Libraries: Monad Utilities
20.1 Naming Conventions 200 20.2 Class MonadPlus 200 20.3 Functions 201 20.4 Library Monad 202
Haskell 98 Libraries: Input/Output
21.1 I/O Errors 207 21.2 Files and Handles 208 21.3 Opening and Closing Files 210 21.4 Determining the Size of a File 211 21.5 Detecting the End of Input 211 21.6 Buffering Operations 211 21.7 Repositioning Handles 213 21.8 Handle Properties 213 21.9 Text Input and Output 214 21.…
Haskell 98 Libraries: Directory Functions
Directory Functions 219
Haskell 98 Libraries: System Functions
System Functions 223
Haskell 98 Libraries: Dates and Times
24.1 Library Time 227
Haskell 98 Libraries: Locales
25.1 Library Locale 231
Haskell 98 Libraries: CPU Time
CPU Time 233
Haskell 98 Libraries: Random Numbers
27.1 The RandomGen class, and the StdGen generator 236 27.2 The Random class 239 27.3 The global random number generator 240
Haskell 98 Libraries: Bibliography
Bibliography 241 Index 243
The Educational Pearls column
"Structure and Interpretation of Classical Mechanics" by Gerald Jay Sussman and Jack Wisdom with Meinhard E. Mayer, The MIT Press; 2001, ISBN 0262194554
Having been out of academia for a number of years, I jumped at the chance to review these volumes, seeing this as an opportunity to get back up to speed with what was happening with the functional programming community.To give you some background, the point where I left to join i…
"The World of Scripting Languages" by David W. Barron, John Wiley & Sons, 2000, ISBN 0-471-99886-9
Having been out of academia for a number of years, I jumped at the chance to review these volumes, seeing this as an opportunity to get back up to speed with what was happening with the functional programming community.To give you some background, the point where I left to join i…
TinkerType: a language for playing with formal systems
TinkerType is a pragmatic framework for compact and modular description of formal systems (type systems, operational semantics, logics, etc.). A family of related systems is broken down into a set of clauses – individual inference rules – and a set of features controlling the inc…
PAL+: a lambda-free logical framework
A lambda-free logical framework takes parameterisation and definitions as the basic notions to provide schematic mechanisms for specification of type theories and their use in practice. The framework presented here, PAL + , is a logical framework for specification and implementat…
Haskell in Space
This paper describes a practical exercise set to an introductory functional programming course. The exercise is to implement a small game involving a space ship in an asteroids belt, after the fashion of the classic Asteroids arcade game. The positive experience suggests that int…
First-order unification by structural recursion
First-order unification algorithms (Robinson, 1965) are traditionally implemented via general recursion, with separate proofs for partial correctness and termination. The latter tends to involve counting the number of unsolved variables and showing that this total decreases each …
Inlining as staged computation
Inlining and specialization appear in various forms throughout the implementation of modern programming languages. From mere compiler optimizations to sophisticated techniques in partial evaluation, they are omnipresent, yet each application is treated differently. This paper is …
Stack-based typed assembly language
The following three figures (figures 10, 11 and 12) were not shown in the original published version of the article. These figures constitute the entire static semantics of the STAL type system.