User loginNavigation 
Fixpoint theory, induction and recursionI have always looked at recursion very pragmatically. A well formed recursive function is a function which calls itself during its execution. In order to avoid infinite loops, some of its arguments have to be constantly decreasing on each recursive call and there has to be a branch where no recursive calls are made. Certainly in theoretic computer science fixpoints are introduced and from a mathematical point of view a recursive function is the solution of a fixpoint equation. But diving into the subject deeper there are a lot of interesting aspects in this connection between recursive functions and fixpoints. There is a connection to closures, to induction etc. I have tried to write down some of these interesting aspects into the little paper Closures and fixpoints. All needed math is expressed within a programming language in a manner that the compiler can verify all derived facts. Maybe some of you are interesting in reading this. By hbrandl at 20121217 16:45  LtU Forum  previous forum topic  next forum topic  other blogs  8662 reads

Browse archivesActive forum topics 
Recent comments
1 hour 2 min ago
1 hour 5 min ago
1 hour 12 min ago
5 hours 22 min ago
6 hours 51 min ago
7 hours 47 min ago
8 hours 49 min ago
8 hours 52 min ago
8 hours 55 min ago
9 hours 1 min ago