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 2012-12-17 16:45 | LtU Forum | previous forum topic | next forum topic | other blogs | 15374 reads
|
Browse archives
Active forum topics |
Recent comments
6 weeks 14 hours ago
6 weeks 18 hours ago
6 weeks 18 hours ago
28 weeks 1 day ago
32 weeks 3 days ago
34 weeks 1 day ago
34 weeks 1 day ago
36 weeks 5 days ago
41 weeks 3 days ago
41 weeks 3 days ago