Timeline for What's new in purely functional data structures since Okasaki?
Current License: CC BY-SA 3.0
55 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 4, 2020 at 7:03 | history | wiki removed | Bjørn Kjos-Hanssen | ||
| Jul 29, 2018 at 12:01 | comment | added | Qqwy | I'd like to propose to potentially add cs.ox.ac.uk/people/jeremy.gibbons/publications/aplicative.pdf ('APLicative programming with Naperian Functors') to this list. | |
| May 23, 2017 at 11:33 | history | edited | CommunityBot |
replaced http://stackoverflow.com/ with https://stackoverflow.com/
|
|
| Sep 27, 2014 at 21:04 | history | edited | jbapple | CC BY-SA 3.0 |
uniquely represented dictionaries
|
| Jan 9, 2014 at 15:56 | history | edited | Rob Simmons | CC BY-SA 3.0 |
Remove duplicate word
|
| S Nov 13, 2013 at 20:14 | history | suggested | CommunityBot | CC BY-SA 3.0 |
Add reference to Bagwell's RRB-Trees (2012).
|
| Nov 13, 2013 at 17:10 | review | Suggested edits | |||
| S Nov 13, 2013 at 20:14 | |||||
| Mar 4, 2013 at 11:34 | comment | added | Makarius | The terminology of "programm extraction" is one of Coq: you take a constructive proof and make an executable program from it, stripping away some things. In Isabelle this is called "code generation" and works differently, using the HOL specifications as pseudo-code, not the proofs. Proof extraction in Isabelle/HOL according to Berghofer does work like Coq, but is rarely used these days. | |
| Mar 4, 2013 at 11:31 | comment | added | Makarius | Note that Isabelle/HOL can generate code for SML, OCaml, Haskell, Scala. The Haskabelle tool can also import Haskell into Isabelle/HOL. | |
| Jul 19, 2012 at 10:35 | history | tweeted | twitter.com/#!/StackCSTheory/status/225901630019743744 | ||
| Jun 17, 2012 at 2:21 | comment | added | jbapple | After Googling for this name, I think "Radu Mihaescu" is correct. | |
| Jun 15, 2012 at 19:56 | comment | added | Zsbán Ambrus | Hmm, is your spelling of the author's name “Radu Mihaescu” right, or is it “Radu Mihaesau” as it appears in the article you linked to? | |
| Jun 15, 2012 at 2:55 | history | edited | jbapple | CC BY-SA 3.0 |
fix two links
|
| Dec 6, 2011 at 14:03 | history | edited | Rob Simmons | CC BY-SA 3.0 |
talk about Minamide's work on hole abstraction: a better functional programming representation of difference lists
|
| Dec 6, 2011 at 6:29 | history | edited | edwardw | CC BY-SA 3.0 |
added 3 characters in body
|
| Sep 8, 2011 at 11:55 | comment | added | jbapple | @Diego: If you think they should be included, I hope you will post them in an answer. I didn't include them only because I had forgotten about them, but I forgot about them because they aren't very functional -- they degrade to simple cons lists under heavy persistent usage. | |
| Sep 8, 2011 at 3:52 | comment | added | didest | Why Bagwell's VList isn't considered? there is even a Wikipedia article: secure.wikimedia.org/wikipedia/en/wiki/VList | |
| Jan 28, 2011 at 19:07 | history | edited | Alessandro Cosentino | CC BY-SA 2.5 |
corrected spelling of an author
|
| Jan 20, 2011 at 6:01 | history | edited | jbapple | CC BY-SA 2.5 |
spelling, grammar
|
| Jan 20, 2011 at 5:45 | history | edited | jbapple | CC BY-SA 2.5 |
isabelle formalization, more details from Demaine et al
|
| Dec 1, 2010 at 5:48 | history | edited | jbapple | CC BY-SA 2.5 |
http://matt.might.net/articles/red-black-delete/
|
| Sep 30, 2010 at 10:33 | comment | added | Radu GRIGore | Great list! Which makes me wish Okasaki would publish a second edition. | |
| Sep 29, 2010 at 11:10 | history | edited | jkff | CC BY-SA 2.5 |
Added "priority search queues" by Hinze
|
| Sep 22, 2010 at 20:00 | comment | added | jbapple | Edward Kmett: Boostrapped Skew Binomial Heaps are described in the bootstrapping chapter of Okasaki's book. | |
| Sep 22, 2010 at 19:39 | comment | added | Edward Kmett | And Brodal/Okasaki's Boostrapped Skew Binomial Heaps, unless I missed it in there. | |
| Sep 22, 2010 at 18:50 | history | edited | jbapple | CC BY-SA 2.5 |
better titile for last section
|
| Sep 22, 2010 at 18:09 | history | edited | jbapple | CC BY-SA 2.5 |
made nesteds into bullets, removed "under construction"
|
| Sep 22, 2010 at 16:53 | history | edited | jbapple | CC BY-SA 2.5 |
spelling, minor corrections, string b-trees
|
| Sep 22, 2010 at 16:36 | history | edited | jbapple | CC BY-SA 2.5 |
links for lightweght verification
|
| Sep 22, 2010 at 16:14 | history | edited | jbapple | CC BY-SA 2.5 |
more lightweight verification
|
| Sep 22, 2010 at 4:02 | vote | accept | jkff | ||
| Sep 22, 2010 at 1:27 | history | edited | jbapple | CC BY-SA 2.5 |
more persistent structures
|
| Sep 22, 2010 at 1:13 | history | edited | jbapple | CC BY-SA 2.5 |
difference lists
|
| Sep 22, 2010 at 0:57 | history | edited | jbapple | CC BY-SA 2.5 |
dates, extraction
|
| Sep 21, 2010 at 23:54 | history | edited | jbapple | CC BY-SA 2.5 |
coq containers
|
| Sep 21, 2010 at 23:20 | history | edited | jbapple | CC BY-SA 2.5 |
more on skip lists
|
| Sep 21, 2010 at 22:53 | history | edited | jbapple | CC BY-SA 2.5 |
pairing heaps
|
| Sep 21, 2010 at 21:48 | history | edited | jbapple | CC BY-SA 2.5 |
moved skip lists
|
| Sep 21, 2010 at 21:28 | history | edited | jbapple | CC BY-SA 2.5 |
double negative
|
| Sep 21, 2010 at 20:58 | history | edited | jbapple | CC BY-SA 2.5 |
grammar/spelling
|
| Sep 21, 2010 at 20:53 | history | edited | jbapple | CC BY-SA 2.5 |
search trees in general
|
| Sep 21, 2010 at 20:46 | history | edited | jbapple | CC BY-SA 2.5 |
under construction, balanced search trees
|
| Sep 21, 2010 at 20:30 | history | edited | jbapple | CC BY-SA 2.5 |
kaplan, okasaki, & tarjan paper, laziness & memoization
|
| Sep 21, 2010 at 20:00 | history | edited | jbapple | CC BY-SA 2.5 |
treaps; Post Made Community Wiki
|
| Sep 21, 2010 at 19:08 | history | edited | jbapple | CC BY-SA 2.5 |
soft heap
|
| Sep 21, 2010 at 18:10 | history | edited | jbapple | CC BY-SA 2.5 |
verification start, the zipper
|
| Sep 21, 2010 at 17:48 | history | edited | jbapple | CC BY-SA 2.5 |
biased search trees
|
| Sep 21, 2010 at 17:41 | history | edited | jbapple | CC BY-SA 2.5 |
added some comments on kd heaps
|
| Sep 21, 2010 at 17:34 | history | edited | jbapple | CC BY-SA 2.5 |
2d and kd heaps
|
| Sep 21, 2010 at 17:23 | history | edited | jbapple | CC BY-SA 2.5 |
Braun trees and skip trees
|
| Sep 21, 2010 at 17:04 | history | edited | jbapple | CC BY-SA 2.5 |
italics for per se
|
| Sep 21, 2010 at 16:40 | history | edited | jbapple | CC BY-SA 2.5 |
added M&T deques
|
| Sep 21, 2010 at 16:32 | history | edited | jbapple | CC BY-SA 2.5 |
added dates, another "structure" known earlier
|
| Sep 21, 2010 at 16:21 | history | edited | jbapple | CC BY-SA 2.5 |
catenable lists, tries for VC
|
| Sep 21, 2010 at 16:13 | history | answered | jbapple | CC BY-SA 2.5 |