| Name | Summary | Author | Created | Modified |
|---|---|---|---|---|
| lastDouble | ilya.klyuchnikov | 25th August 2011 04:11 | 25th August 2011 04:11 | |
| Boolean algebra | serjpod | 24th November 2010 20:23 | 24th November 2010 20:23 | |
| Mogensen's example | ilya.klyuchnikov | 14th November 2010 13:13 | 14th November 2010 13:13 | |
| Ackermann2 | Partial application of Ackermann function | ilya.klyuchnikov | 5th July 2010 07:47 | 5th July 2010 07:53 |
| Paths in graphs | Over-generalization | sergei.romanenko | 6th March 2010 11:28 | 6th March 2010 11:51 |
| An example by Sands | Local and global control | sergei.romanenko | 18th February 2010 12:47 | 18th February 2010 12:56 |
| eq(half(double(n)), n) satisfied | alexander.slesarenko | 31st January 2010 15:21 | 31st January 2010 20:57 | |
| eq(double(half(n)), n) not satisfied | alexander.slesarenko | 31st January 2010 15:23 | 31st January 2010 20:56 | |
| x = S(x) | Tagging & infinite data | sergei.romanenko | 28th December 2009 12:41 | 28th December 2009 12:41 |
| append4 | ilya.klyuchnikov | 20th November 2009 16:00 | 20th November 2009 16:00 | |
| g(A(A(x)), y) = g(A(x), B(y)); | Nothing to say more | sergei.romanenko | 11th November 2009 00:08 | 11th November 2009 00:08 |
| f(S(x)) = id(S(f(x))) | A bad function... | sergei.romanenko | 9th September 2009 12:10 | 9th September 2009 12:10 |
| add(a, a) | Generalizing 2 configurations to a third configuration | sergei.romanenko | 18th May 2009 10:37 | 18th May 2009 10:39 |
| mult(a,b) | Multiplication | sergei.romanenko | 17th May 2009 20:31 | 17th May 2009 20:31 |
| addAcc(S(S(a)), b) | Dealing with static values | sergei.romanenko | 15th May 2009 16:54 | 15th May 2009 16:54 |
| rev-ins | Reverse by insertion | sergei.romanenko | 15th May 2009 14:09 | 15th May 2009 15:31 |
| ackermann | Ackermann's function | sergei.romanenko | 15th May 2009 14:46 | 15th May 2009 14:46 |
| Pair(even(m), odd(m)) | Over-generalization | sergei.romanenko | 30th April 2009 06:33 | 5th May 2009 13:43 |
| or(even(m), odd(m)) | Should be always True (failed) | sergei.romanenko | 23rd April 2009 20:55 | 5th May 2009 13:42 |
| add(add(a, b), c) | Transforming a 2-pass algorithm to a 1-pass one for binary functions | sergei.romanenko | 3rd May 2009 11:10 | 5th May 2009 13:40 |
| addAcc(a, Z) | Addition using an accumulator 2 | sergei.romanenko | 4th May 2009 18:00 | 4th May 2009 20:12 |
| addAcc(a, b) | Addition using an accumulator | sergei.romanenko | 4th May 2009 17:50 | 4th May 2009 20:11 |
| even(double(n)) | Always True | sergei.romanenko | 23rd April 2009 21:07 | 23rd April 2009 21:07 |
| CompareLength | Eliminating intermediate data structures | ilya.klyuchnikov | 3rd December 2008 20:28 | 4th December 2008 19:23 |
| Compose | Function composition | sergei.romanenko | 4th December 2008 18:19 | 4th December 2008 18:31 |
| Matcher1 | The Knuth-Morris-Pratt Example | ilya.klyuchnikov | 3rd December 2008 22:37 | 3rd December 2008 22:40 |
| ReverseABC | Supercompilation of a ground expression = interpretation | ilya.klyuchnikov | 3rd December 2008 19:00 | 3rd December 2008 19:00 |
| NotOrNot | Eliminating control structures. | ilya.klyuchnikov | 3rd December 2008 18:50 | 3rd December 2008 18:50 |
| Member | Supercompiled programs may be "flatter" than the original ones. | ilya.klyuchnikov | 3rd December 2008 18:47 | 3rd December 2008 18:47 |
| MemberSecondArg | The member function specialized with respect to the 2nd argument. | ilya.klyuchnikov | 3rd December 2008 18:44 | 3rd December 2008 18:44 |
| MemberFirstArg | The member function specialized with respect to the 1st argument. | ilya.klyuchnikov | 3rd December 2008 17:25 | 3rd December 2008 17:25 |
| Eq2 | Transforming a binary function into a unary one. | ilya.klyuchnikov | 3rd December 2008 17:22 | 3rd December 2008 17:22 |
| EqTheSame | SPSC "proves the theorem" that "X=X cannot be false". | spsc.admin | 2nd December 2008 16:54 | 3rd December 2008 17:19 |
| AbAb | Transforming a 2-pass algorithm to a 1-pass one | ilya.klyuchnikov | 2nd December 2008 16:15 | 3rd December 2008 11:35 |
| AppendAppend | Transforming a 2-pass algorithm to a 1-pass one for binary functions | spsc.admin | 2nd December 2008 16:47 | 3rd December 2008 11:35 |