mirror of
				https://github.com/papers-we-love/papers-we-love.git
				synced 2025-06-13 12:54:28 +00:00 
			
		
		
		
	Merge pull request #84 from newsomc/master
Adding core.rrb-vector paper and a Clojure cross reference README.
This commit is contained in:
		
						commit
						d45ec75400
					
				
							
								
								
									
										19
									
								
								clojure/README.md
									
									
									
									
									
										Normal file
									
								
							
							
						
						
									
										19
									
								
								clojure/README.md
									
									
									
									
									
										Normal file
									
								
							| @ -0,0 +1,19 @@ | |||||||
|  | # Clojure | ||||||
|  | 
 | ||||||
|  | This is a cross-listing of papers related to Clojure, it's core, contrib and popular libraries. Papers noted at at Clojure talks, meetups, and conferences can be found here as well. | ||||||
|  | ## Data Structures | ||||||
|  | * core.rrb-vector | ||||||
|  |   * [RRB-Trees: Efficient Immutable Vectors](http://infoscience.epfl.ch/record/169879/files/RMTrees.pdf) | ||||||
|  | ## Pattern Matching | ||||||
|  | * core.match | ||||||
|  |   * [Compiling Pattern Matching to good Decision Trees](http://www.cs.tufts.edu/~nr/cs257/archive/luc-maranget/jun08.pdf) | ||||||
|  | 
 | ||||||
|  | ## Clojure/West 2014 | ||||||
|  | * Applicative Functional Programming  | ||||||
|  |   * [Backtracking Iterators](https://www.lri.fr/~filliatr/publis/enum2.pdf) | ||||||
|  |   * [Breadth-First Numbering: Lessons from a Small Exercise in Algorithm Design](http://www.cs.tufts.edu/~nr/cs257/archive/chris-okasaki/breadth-first.pdf) | ||||||
|  | * Testing | ||||||
|  |   * QuickCheck | ||||||
|  |     * [QuickCheck: A Lightweight Tool for Random Testing of Haskell Programs](http://www.cs.tufts.edu/~nr/cs257/archive/john-hughes/quick.pdf) | ||||||
|  |     * [QuickCheck Testing for Fun and Profit](http://people.inf.elte.hu/center/fulltext.pdf) | ||||||
|  |     * Property-Based Testing, best explained in John Hughes own talk at [ClojureWest 2014](https://www.youtube.com/watch?v=zi0rHwfiX1Q&list=PLZdCLR02grLp__wRg5OTavVj4wefg69hM). | ||||||
| @ -1,2 +1,3 @@ | |||||||
| * [Dynamic Hash Tables](http://www.csd.uoc.gr/~hy460/pdf/Dynamic%20Hash%20Tables.pdf) | * [Dynamic Hash Tables](http://www.csd.uoc.gr/~hy460/pdf/Dynamic%20Hash%20Tables.pdf) | ||||||
| * [Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms](http://www.research.ibm.com/people/m/michael/podc-1996.pdf) | * [Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms](http://www.research.ibm.com/people/m/michael/podc-1996.pdf) | ||||||
|  | * [RRB-Trees: Efficient Immutable Vectors](http://infoscience.epfl.ch/record/169879/files/RMTrees.pdf) | ||||||
|  | |||||||
		Loading…
	
		Reference in New Issue
	
	Block a user