| Name | Summary | Author | Created | Modified |
|---|---|---|---|---|
| Ackermann ho | sergei.romanenko | 19th January 2011 11:26 | 19th January 2011 11:26 | |
| Ackermann fo | sergei.romanenko | 19th January 2011 09:45 | 19th January 2011 09:45 | |
| example | ilya.klyuchnikov | 22nd November 2010 07:08 | 22nd November 2010 07:08 | |
| fibonacci | simply compile fib (w/Nat) | johnicholas@johnicholas.com | 12th November 2010 04:18 | 12th November 2010 04:18 |
| testing2 | ilya.klyuchnikov | 19th September 2010 09:37 | 19th September 2010 10:13 | |
| Ackermann function | Partial application of Ackermann function | ilya.klyuchnikov | 5th July 2010 07:52 | 5th July 2010 08:03 |
| map inc ones | ilya.klyuchnikov | 25th June 2010 18:06 | 25th June 2010 18:06 | |
| CEK machine (eval) | sergei.romanenko | 16th June 2010 13:48 | 16th June 2010 14:04 | |
| CEK machine (drive move) | sergei.romanenko | 16th June 2010 12:44 | 16th June 2010 13:47 | |
| Arithm expr iterate | sergei.romanenko | 11th June 2010 21:20 | 14th June 2010 17:55 | |
| Refocusing | sergei.romanenko | 11th June 2010 20:27 | 11th June 2010 21:18 | |
| Lightweight Fusion 4 | ilya.klyuchnikov | 9th June 2010 11:44 | 9th June 2010 12:19 | |
| Lightweight Fusion 7 | ilya.klyuchnikov | 9th June 2010 12:11 | 9th June 2010 12:11 | |
| Lightweight Fusion 6 | ilya.klyuchnikov | 9th June 2010 11:54 | 9th June 2010 11:54 | |
| Lightweight Fusion 5 | ilya.klyuchnikov | 9th June 2010 11:52 | 9th June 2010 11:52 | |
| Lightweight Fusion 3 | ilya.klyuchnikov | 9th June 2010 11:37 | 9th June 2010 11:37 | |
| Lightweight Fusion 2 | ilya.klyuchnikov | 9th June 2010 11:29 | 9th June 2010 11:29 | |
| Lightweight Fusion 1 | The first example from Ohori's paper | ilya.klyuchnikov | 9th June 2010 11:21 | 9th June 2010 11:21 |
| case via fold | ilya.klyuchnikov | 5th June 2010 12:29 | 5th June 2010 12:29 | |
| one more russel | ilya.klyuchnikov | 18th May 2010 08:38 | 18th May 2010 08:38 | |
| with supercombinator | ilya.klyuchnikov | 12th May 2010 09:46 | 12th May 2010 09:46 | |
| no supercombinator | ilya.klyuchnikov | 12th May 2010 09:39 | 12th May 2010 09:39 | |
| Smart parsers 3 | ilya.klyuchnikov | 30th April 2010 12:42 | 30th April 2010 12:42 | |
| Smart parsers 2 | ilya.klyuchnikov | 30th April 2010 09:08 | 30th April 2010 12:35 | |
| Smart parsers 1 | ilya.klyuchnikov | 30th April 2010 09:01 | 30th April 2010 12:13 | |
| Naive parsers 3 | ilya.klyuchnikov | 30th April 2010 11:45 | 30th April 2010 11:45 | |
| Naive parsers 2 | ilya.klyuchnikov | 30th April 2010 09:01 | 30th April 2010 09:01 | |
| Naive parsers 1 | ilya.klyuchnikov | 30th April 2010 08:41 | 30th April 2010 08:58 | |
| recursion without explicit fix | ilya.klyuchnikov | 29th April 2010 16:29 | 29th April 2010 16:29 | |
| RecY | sergei.romanenko | 29th April 2010 15:57 | 29th April 2010 16:07 | |
| bottom instantiation | ilya.klyuchnikov | 27th April 2010 08:37 | 27th April 2010 08:37 | |
| russel2 | ilya.klyuchnikov | 27th April 2010 06:13 | 27th April 2010 06:13 | |
| russel1 | ilya.klyuchnikov | 27th April 2010 06:08 | 27th April 2010 06:08 | |
| fix-point via data constructors | ilya.klyuchnikov | 27th April 2010 06:05 | 27th April 2010 06:05 | |
| Tree: flatten by appending | sergei.romanenko | 20th February 2010 09:57 | 22nd February 2010 18:42 | |
| Tree: eqTree | sergei.romanenko | 22nd February 2010 15:38 | 22nd February 2010 15:58 | |
| Tree: eq leaves | sergei.romanenko | 22nd February 2010 14:32 | 22nd February 2010 15:37 | |
| map-join | (map f) (join xs) | sergei.romanenko | 10th January 2010 19:59 | 18th February 2010 19:15 |
| Paths in a graph | Over-generalization | sergei.romanenko | 29th January 2010 19:36 | 18th February 2010 19:08 |
| An example by Sands | f x = if x then f x else True | sergei.romanenko | 5th June 2009 13:16 | 18th February 2010 19:07 |
| eq(add(a b))(add(b a)) | Failed to prove that ... | sergei.romanenko | 15th February 2010 22:44 | 15th February 2010 22:55 |
| Reachability, choice, CPS | reachable A | sergei.romanenko | 14th February 2010 10:24 | 14th February 2010 10:24 |
| Reachability, choice | reachable A | sergei.romanenko | 14th February 2010 10:02 | 14th February 2010 10:13 |
| Lambda: non-determinism (HOAS, CPS k c, CBV) | \x, CPS k c | sergei.romanenko | 12th January 2010 22:34 | 12th February 2010 15:47 |
| Lambda: HOAS, CPS, CBV | \x, CPS, CBV | sergei.romanenko | 11th January 2010 12:58 | 12th February 2010 11:34 |
| acc0 | ilya.klyuchnikov | 12th February 2010 05:58 | 12th February 2010 05:58 | |
| acc1 | ilya.klyuchnikov | 12th February 2010 05:52 | 12th February 2010 05:52 | |
| acc2 | ilya.klyuchnikov | 12th February 2010 05:51 | 12th February 2010 05:51 | |
| Lambda: higher-order syntax (HOAS, CPS,CBV) | \x, CPS | sergei.romanenko | 25th December 2009 12:30 | 11th February 2010 21:03 |
| or odd 1 | more unfolding steps | ilya.klyuchnikov | 9th February 2010 15:57 | 9th February 2010 15:57 |
| or odd | less unfolding steps | ilya.klyuchnikov | 9th February 2010 15:56 | 9th February 2010 15:56 |
| eq (add (unchurch x) (unchurch 0)) (unchurch (churchAdd 0 x)) | lack of information propagation | ilya.klyuchnikov | 8th February 2010 09:12 | 8th February 2010 09:12 |
| Lambda: non-determinism (HOAS, CPS c k, CBV, opt) | Optimized | sergei.romanenko | 31st January 2010 21:59 | 31st January 2010 23:56 |
| Tree: combinators (2-passes) | A 2-pass algorithm by means of combinators | sergei.romanenko | 27th January 2010 10:43 | 31st January 2010 14:14 |
| P (even n) (odd n) | Over-generalization | sergei.romanenko | 31st January 2010 10:42 | 31st January 2010 10:56 |
| or (even n) (odd n) | Over-generalization | sergei.romanenko | 23rd April 2009 20:29 | 31st January 2010 10:44 |
| Primitive functions via data constructors | functorbox | 30th January 2010 18:59 | 30th January 2010 18:59 | |
| Lambda: higher-order syntax (transparent) | \x, transparent | sergei.romanenko | 25th December 2009 12:23 | 28th January 2010 22:35 |
| Lambda: first-order syntax (FOCLO, pair) | First-order closures, a pair of results | sergei.romanenko | 2nd January 2010 12:49 | 28th January 2010 22:22 |
| fix -> recursion | Fixpoint combinator -> explicit recursion | sergei.romanenko | 25th April 2009 13:06 | 28th January 2010 18:32 |
| apply omega omega | Function self-application | sergei.romanenko | 24th April 2009 13:57 | 28th January 2010 18:12 |
| Lambda: first-order syntax (FOCL, without Error) | First-order closures | sergei.romanenko | 4th January 2010 11:10 | 28th January 2010 13:16 |
| Lambda: first-order syntax (FOCL, pair, inexhaustive matches) | First-order closures, a pair of results | sergei.romanenko | 4th January 2010 11:18 | 28th January 2010 13:15 |
| Lambda: first-order syntax (HOCL) | Higher-order closures | sergei.romanenko | 27th December 2009 09:04 | 28th January 2010 13:13 |
| Lambda: first-order syntax (FOCL) | First-order closures | sergei.romanenko | 30th December 2009 14:13 | 28th January 2010 13:11 |
| Tree: combinators (2-passes, HO pairs) | A 2-pass algorithm by means of combinators | sergei.romanenko | 27th January 2010 13:26 | 27th January 2010 20:55 |
| Lambda: non-determinism (direct) | \x, direct style | sergei.romanenko | 5th January 2010 11:46 | 23rd January 2010 15:35 |
| Lambda: higher-order syntax (HONAT) | \x, transparent, ho nats | sergei.romanenko | 23rd January 2010 12:14 | 23rd January 2010 15:30 |
| Lambda: non-determinism (direct, appn) | \x, direct style | sergei.romanenko | 17th January 2010 09:34 | 17th January 2010 12:14 |
| Lambda: non-determinism (direct, tag) | \x, direct style | sergei.romanenko | 16th January 2010 09:28 | 16th January 2010 11:10 |
| Lambda: non-determinism (direct, Maybe) | \x, direct style | sergei.romanenko | 15th January 2010 19:56 | 16th January 2010 09:27 |
| ordered | ilya.klyuchnikov | 15th January 2010 22:05 | 15th January 2010 22:05 | |
| p = A q; q = B p; | Generating an inifinite data structure | sergei.romanenko | 6th May 2009 14:42 | 13th January 2010 18:41 |
| a = X a | a = X a could be written directly! | sergei.romanenko | 5th May 2009 15:32 | 13th January 2010 18:39 |
| repeat [True, False] | Recurion -> a cyclic list | sergei.romanenko | 5th May 2009 14:59 | 13th January 2010 18:36 |
| comparing infinite data | ilya.klyuchnikov | 12th January 2010 15:33 | 12th January 2010 15:33 | |
| Synapse | Verification of synapse protocol | sergei.romanenko | 10th January 2010 15:04 | 11th January 2010 12:10 |
| Non-determinism: anyNatFrom n | double (anyNatFrom Z) | sergei.romanenko | 7th January 2010 12:28 | 11th January 2010 10:56 |
| trivial non-determinism | ilya.klyuchnikov | 6th January 2010 10:51 | 11th January 2010 10:13 | |
| twice random number | non-determinism in square | ilya.klyuchnikov | 6th January 2010 10:50 | 11th January 2010 10:02 |
| random again | ilya.klyuchnikov | 6th January 2010 11:17 | 11th January 2010 10:00 | |
| Church numbers: churchPred | church (pred (unchurch n)) | sergei.romanenko | 8th January 2010 09:42 | 8th January 2010 09:55 |
| Map of Map fusion | Simple example of the fusion of data structures | jason@swiftorific.co.uk | 5th January 2010 11:25 | 5th January 2010 11:25 |
| self-application of id | ilya.klyuchnikov | 4th January 2010 12:11 | 4th January 2010 12:11 | |
| Lambda: first-order syntax 1 (3 continuations) | First-order closures, ho env | sergei.romanenko | 31st December 2009 15:35 | 4th January 2010 11:40 |
| self-application (tagged) | ilya.klyuchnikov | 4th January 2010 10:19 | 4th January 2010 10:19 | |
| non-exhaustive patterns | ilya.klyuchnikov | 4th January 2010 09:26 | 4th January 2010 09:26 | |
| options 4 | addOpt (Some x) None | ilya.klyuchnikov | 3rd January 2010 20:42 | 3rd January 2010 20:42 |
| options 3 | multIsZero (Some x) None | ilya.klyuchnikov | 3rd January 2010 20:20 | 3rd January 2010 20:20 |
| options 2 | multIsZero (Some x) (Some x) | ilya.klyuchnikov | 3rd January 2010 20:01 | 3rd January 2010 20:01 |
| options 1 | multIsZero (Some x) (Some y) | ilya.klyuchnikov | 3rd January 2010 20:00 | 3rd January 2010 20:00 |
| Lambda: higher-order syntax | de Bruijn | sergei.romanenko | 23rd December 2009 18:08 | 3rd January 2010 17:14 |
| map even (map double (iterate next Z)) | ilya.klyuchnikov | 19th December 2009 08:17 | 19th December 2009 08:17 | |
| map even to even numbers | ilya.klyuchnikov | 21st November 2009 13:00 | 21st November 2009 13:00 | |
| encodings | ilya.klyuchnikov | 15th July 2009 08:32 | 20th July 2009 13:18 | |
| odd and even via fix | ilya.klyuchnikov | 14th July 2009 12:50 | 14th July 2009 12:50 | |
| rev | ilya.klyuchnikov | 10th July 2009 17:30 | 10th July 2009 17:30 | |
| Parsing (higher order = combinators) | A (A | B)* | sergei.romanenko | 25th April 2009 14:35 | 29th June 2009 10:57 |
| Parsing (first order) | A (A | B)* | sergei.romanenko | 28th June 2009 14:06 | 29th June 2009 10:56 |
| add a b | Just addition | sergei.romanenko | 18th June 2009 11:18 | 18th June 2009 11:18 |
| accum. param. | ilya.klyuchnikov | 18th June 2009 08:08 | 18th June 2009 08:08 | |
| PSI_2 | a generalized test | ilya.klyuchnikov | 16th June 2009 19:50 | 16th June 2009 19:53 |
| PSI_1 | a simple testing | ilya.klyuchnikov | 16th June 2009 19:45 | 16th June 2009 19:51 |
| PSI_3 | church addition | ilya.klyuchnikov | 16th June 2009 16:55 | 16th June 2009 18:56 |
| mapN n f xs | mapN (S(S(S Z))) f xs | sergei.romanenko | 14th June 2009 15:07 | 14th June 2009 15:09 |
| ordered | ilya.klyuchnikov | 22nd May 2009 21:09 | 22nd May 2009 21:28 | |
| app_xyz_1 | app (app x y) z | ilya.klyuchnikov | 15th February 2009 09:30 | 18th May 2009 07:11 |
| Mutual recursion via fix (higher-order) | fix (\r -> t2 (A (snd r)) (B (fst r))) | sergei.romanenko | 6th May 2009 14:02 | 6th May 2009 14:04 |
| Mutual recursion via fix | fix (\r -> P (A (snd r)) (B (fst r))) | sergei.romanenko | 6th May 2009 07:49 | 6th May 2009 08:50 |
| fix (\a -> A a) | Generating explicit letrec f=(A f) in f | sergei.romanenko | 6th May 2009 07:30 | 6th May 2009 07:30 |
| Synapse | Verification of synapse protocol | ilya.klyuchnikov | 22nd April 2009 18:37 | 22nd April 2009 18:37 |
| app_xyz_3 | Repeated supercompilation | ilya.klyuchnikov | 25th February 2009 10:25 | 25th February 2009 10:25 |
| Inlining a function | iterate (\n -> S n) z | sergei.romanenko | 25th February 2009 09:13 | 25th February 2009 09:15 |
| app_xyz_2 | app x (app y z) | ilya.klyuchnikov | 15th February 2009 09:30 | 23rd February 2009 08:33 |