User loginNavigation 
Total Functional Programming
Here's an interesting paper recently mention in another thread: Total Functional Programming...
Abstract: The driving idea of functional programming is to make programming more closely related to mathematics. A program in a functional language such as Haskell or Miranda consists of equations which are both computation rules and a basis for simple algebraic reasoning about the functions and data structures they define. The existing model of functional programming, although elegant and powerful, is compromised to a greater extent than is commonly recognized by the presence of partial functions. We consider a simple discipline of total functional programming designed to exclude the possibility of nontermination. Among other things this requires a type distinction between data, which is finite, and codata, which is potentially infinite.I presume that the bogus definiton of " fib " is a subtle reminder of the importance of eliminating bottom. By Greg Buchholz at 20070123 16:35  LtU Forum  previous forum topic  next forum topic  other blogs  72921 reads

Browse archivesActive forum topics 
Recent comments
1 hour 8 min ago
1 hour 55 min ago
2 hours 50 sec ago
2 hours 53 min ago
4 hours 19 min ago
4 hours 48 min ago
5 hours 18 min ago
5 hours 23 min ago
5 hours 44 min ago
6 hours 20 min ago