Haskell uses a lazy evaluation system which allows you define as many terms as you like, safe in the knowledge that the compiler will only allocate the ones you use in an expression. In this article we use simple sequences as lists of infinite length in a number of different ways to demonstrate how you can use this approach.

Following up from last week's article on reading zip archives, we show you how you can create your own archives using Python.

If you've worked in the terminal, it's likely you're in some way proficient with the command history features of your shell. There's a lot more functionality than many realise however, and learning it can help you eliminate a lot of duplicate typing.

Updating all the software on your system can be a pain, but with Linux it doesn't have to be that way. We'll show you how to combine the apt package management system with a task scheduler to automatically update your system.

A quick run down on how you can use regular expressions in your own programs to give you more power over searching and substituting text.