Popcorn, Indiana

Popcorn is an unincorporated community in Perry Township, Lawrence County, Indiana.

Photo from Small Town Indiana photo survey.
For the brand of popcorn, see Popcorn, Indiana (brand).
Popcorn, Indiana
Unincorporated community
Popcorn Christian Church
Popcorn
Popcorn
Coordinates: 38°58′33″N 86°39′25″W
CountryUnited States
StateIndiana
CountyLawrence
TownshipPerry
Elevation650 ft (200 m)
ZIP code
47462
FIPS code18-61056[2]
GNIS feature ID451354

History

Popcorn took its name from Popcorn Creek.[3] A local legend states a visitor from out of town compared the size of local farmers' corn to "popcorn" compared to their own.[4]

A post office called Popcorn was established in 1891, and remained in operation until it was discontinued in 1905.[5]

The town is also known for a brand of kettle corn popcorn that takes the name of the town, but the company is not headquartered in the town.[6]

Geography

Popcorn is located at 38°58′33″N 86°39′25″W.

Notes
  1. "US Board on Geographic Names". United States Geological Survey. 2007-10-25. Retrieved 2008-01-31.
  2. "U.S. Census website". United States Census Bureau. Retrieved 2008-01-31.
  3. Baker, Ronald L. (October 1995). From Needmore to Prosperity: Hoosier Place Names in Folklore and History. Indiana University Press. p. 269. ISBN 978-0-253-32866-3. ...named for a nearby stream, Popcorn Creek.
  4. Indianapolis Monthly. Emmis Communications. September 2006. p. 138. ISSN 0899-0328.
  5. "Lawrence County". Jim Forte Postal History. Retrieved 23 March 2015.
  6. "Our Story | Popcorn, Indiana". www.popcornindiana.com. Retrieved 2018-08-13.



gollark: Doesn't it just segfault at some point?
gollark: It was more elegance™ to just make it able to do tail-call optimization.
gollark: I actually stole this particular quicksort from a r/haskell post talking about it.
gollark: ```lisp (let (partition_rec xs pred acc) (cond ((= xs '()) acc) (true (partition_rec (tail xs) pred (cond ((pred (head xs)) (list (cons (head xs) (head acc)) (snd acc))) (true (list (head acc) (cons (head xs) (snd acc)))) ))) )) (let (qsort xs cont) (cond ((= xs '()) (cont '())) (true (do (let h (head xs)) (let t (tail xs)) (let part_result (partition_rec t (lambda (x) (< x h)) '(() ()))) (qsort (head part_result) (lambda (ls) (qsort (snd part_result) (lambda (rs) (cont (+ ls (list h) rs)))))) )) ))```These all have to be done tail recursively or it could overflow.
gollark: Continuation passing style quicksort in a hilariously slow interpreter.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.