summaryrefslogtreecommitdiff
path: root/lore
diff options
context:
space:
mode:
Diffstat (limited to 'lore')
-rw-r--r--lore/Alpha.hs24
-rw-r--r--lore/Biz/Ibb.hs9
-rw-r--r--lore/Biz/Ibb/Core.hs129
-rw-r--r--lore/Biz/Ibb/Influencers.hs407
-rw-r--r--lore/Biz/Ibb/Keep.hs124
-rw-r--r--lore/Biz/Ibb/Look.hs27
-rw-r--r--lore/Biz/Ibb/Move.hs43
-rw-r--r--lore/Control/Concurrent/Go.hs100
-rw-r--r--lore/Control/Concurrent/Sima.hs12
-rw-r--r--lore/Language/Bs.hs12
-rw-r--r--lore/Language/Bs/Cli.hs52
-rw-r--r--lore/Language/Bs/Eval.hs241
-rw-r--r--lore/Language/Bs/Expr.hs154
-rw-r--r--lore/Language/Bs/Parser.hs121
-rw-r--r--lore/Language/Bs/Primitives.hs183
-rw-r--r--lore/Language/Bs/Repl.hs33
-rw-r--r--lore/Language/Bs/Test.hs2
-rw-r--r--lore/Network/RemoteData.hs31
-rw-r--r--lore/System/Random/Shuffle.hs122
-rw-r--r--lore/bild.nix56
-rw-r--r--lore/core.scm59
-rw-r--r--lore/sicp/meta.scm20
-rw-r--r--lore/sicp/set.scm42
23 files changed, 0 insertions, 2003 deletions
diff --git a/lore/Alpha.hs b/lore/Alpha.hs
deleted file mode 100644
index bae7fa5..0000000
--- a/lore/Alpha.hs
+++ /dev/null
@@ -1,24 +0,0 @@
-{-# LANGUAGE NoImplicitPrelude #-}
--- | Commonly useful functions, a Prelude replacement.
-module Alpha (
- -- * Re-export Protolude
- module X
- -- * General functions
- , (/@)
- -- * Debugging tools
- , say
- -- * TODO: remove this
- , Prelude.read
- ) where
-
-import qualified Prelude
-import Protolude as X
-import Data.String
-
--- | Debugging printf
-say :: String -> IO ()
-say msg = putStrLn msg
-
--- | Alias for map, fmap, <$>
-(/@) :: Functor f => (a -> b) -> f a -> f b
-(/@) = fmap
diff --git a/lore/Biz/Ibb.hs b/lore/Biz/Ibb.hs
deleted file mode 100644
index dd99654..0000000
--- a/lore/Biz/Ibb.hs
+++ /dev/null
@@ -1,9 +0,0 @@
-{-# LANGUAGE OverloadedStrings #-}
-
--- | Main app logic
-module Biz.Ibb (
- module X
- ) where
-
-import Biz.Ibb.Core as X
-import Biz.Ibb.Influencers as X
diff --git a/lore/Biz/Ibb/Core.hs b/lore/Biz/Ibb/Core.hs
deleted file mode 100644
index ff00060..0000000
--- a/lore/Biz/Ibb/Core.hs
+++ /dev/null
@@ -1,129 +0,0 @@
-{-# LANGUAGE DeriveDataTypeable #-}
-{-# LANGUAGE DeriveGeneric #-}
-{-# LANGUAGE NoImplicitPrelude #-}
-{-# LANGUAGE OverloadedStrings #-}
-{-# LANGUAGE OverloadedStrings #-}
-
--- | Main app logic
-module Biz.Ibb.Core where
-
-import Alpha
-import Data.Aeson hiding (Success)
-import Data.Data (Data, Typeable)
-import Data.Text (Text)
-import GHC.Generics (Generic)
-import Miso
-import Miso.String
-import Network.RemoteData
-import Servant.API
-import Servant.Links
-
--- * entity data types
-
-data Person = Person
- { _name :: Text
- -- ^ Their full name.
- , _pic :: Text
- -- ^ A link to their picture.
- , _twitter :: Text
- -- ^ Their twitter handle, without the `@` prefix.
- , _website :: Text
- -- ^ Their main website, fully formed: `https://example.com`
- , _books :: [Book]
- -- ^ A short list of the books they recommend.
- , _blurb :: Text
- -- ^ A short "about" section, like you would see on the jacket flap of a book.
- } deriving (Generic, Show, Eq, Typeable, Data, Ord)
-
-instance FromJSON Person
-instance ToJSON Person
-
-data Book = Book
- { _title :: Text
- , _author :: Text
- , _amznref :: Text
- -- ^ Amazon REF number, for creating affiliate links.
- } deriving (Generic, Show, Eq, Typeable, Data, Ord)
-
-instance FromJSON Book
-instance ToJSON Book
-
--- * app data types
-
-type AppRoutes = Home
-
-type Home = View Action
-
-data Model = Model
- { uri :: URI
- , people :: WebData [Person]
- } deriving (Show, Eq)
-
-type WebData a = RemoteData MisoString a
-
-init :: URI -> Model
-init u = Model u Loading
-
-data Action
- = Nop
- | ChangeRoute URI
- | HandleRoute URI
- | FetchPeople
- | SetPeople (WebData [Person])
- deriving (Show, Eq)
-
-home :: Model -> View Action
-home m = see m
-
-handlers :: Model -> View Action
-handlers = home
-
-notfound :: View Action
-notfound = div_ [] [ text "404" ]
-
-goHome :: URI
-goHome = linkURI $ safeLink
- (Proxy :: Proxy AppRoutes)
- (Proxy :: Proxy Home)
-
-see :: Model -> View Action
-see m = div_ [ class_ "container mt-5" ]
- [ div_ [ class_ "jumbotron" ]
- [ h1_ [ class_ "display-4" ] [ text "Influenced by books" ]
- , p_ [ class_ "lead" ] [ text "Influential people and the books that made them." ]
- , p_ [ class_ "lead" ]
- [ a_ [ href_ "http://eepurl.com/ghBFjv" ]
- [ text "Get new book recommendations from the world's influencers in your email." ]
- ]
- ]
- , div_ [ class_ "card-columns" ] $ case people m of
- NotAsked -> [ text "Initializing..." ]
- Loading -> [ text "Loading..." ]
- Failure err -> [ text err ]
- Success ps -> seePerson /@ ps
- ]
-
-seePerson :: Person -> View Action
-seePerson person = div_ [ class_ "card" ]
- [ div_ [ class_ "card-img" ]
- [ img_ [ class_ "card-img img-fluid", src_ $ ms $ _pic person ]]
- , div_ [ class_ "card-body" ]
- [ h4_ [ class_ "card-title" ] [ text $ ms $ _name person ]
- , h6_ [] [ a_ [ class_ "fab fa-twitter"
- , href_ $ "https://twitter.com/" <> (ms $ _twitter person) ] []
- , a_ [ class_ "fas fa-globe", href_ $ ms $ _website person ] []
- ]
- , p_ [ class_ "card-text" ]
- [ text $ ms $ _blurb person
- , ul_ [] $ seeBook /@ _books person
- ]
- ]
- ]
-
-seeBook :: Book -> View Action
-seeBook book = li_ []
- [ a_ [ class_ "text-dark"
- , href_ $ "https://www.amazon.com/dp/" <> (ms $ _amznref book)
- ]
- [ text $ ms $ _title book ]
- ]
diff --git a/lore/Biz/Ibb/Influencers.hs b/lore/Biz/Ibb/Influencers.hs
deleted file mode 100644
index c31e962..0000000
--- a/lore/Biz/Ibb/Influencers.hs
+++ /dev/null
@@ -1,407 +0,0 @@
-{-# LANGUAGE OverloadedStrings #-}
-{-# LANGUAGE DeriveGeneric #-}
-{-# LANGUAGE DeriveDataTypeable #-}
-
-module Biz.Ibb.Influencers where
-
-import Biz.Ibb.Core
-
-allPeople :: [Person]
-allPeople =
- [ Person { _name = "Joe Rogan"
- , _pic = "https://pbs.twimg.com/profile_images/552307347851210752/vrXDcTFC_400x400.jpeg"
- , _twitter = "joerogan"
- , _blurb = "Stand up comic/mixed martial arts fanatic/psychedelic adventurer Host of The Joe Rogan Experience"
- , _website = "http://joerogan.com"
- , _books = [ Book {_title = "Food of the Gods"
- , _author = "Terence McKenna"
- , _amznref = "0553371304"
- }
- , Book { _title = "The War of Art"
- , _author ="Steven Pressfield"
- , _amznref ="B007A4SDCG"
- }
- ]
- }
- , Person { _name = "Beyoncé"
- , _pic = "https://encrypted-tbn0.gstatic.com/images?q=tbn:ANd9GcTxT84sF19lxdnSiblIXAp-Y4wAigpQn8sZ2GtAerIR_ApiiEJfFQ"
- , _twitter = "Beyonce"
- , _blurb = "American singer, songwriter, actress, record producer and dancer"
- , _website = "http://beyonce.com"
- , _books = [ Book { _title = "What Will It Take To Make A Woman President?"
- , _author = "Marianne Schnall"
- , _amznref = "B00E257Y7G"}
- ]
- }
- , Person { _name = "Barrack Obama"
- , _pic = "https://encrypted-tbn0.gstatic.com/images?q=tbn:ANd9GcQeLzftR36p0hYI-EKNa5fm7CYDuN-vyz23_R48ocqa8X1nPr6C"
- , _twitter = "BarackObama"
- , _blurb = "Dad, husband, President, citizen. 44th POTUS"
- , _website = "http://barackobama.com"
- , _books = [ Book { _title = "An American Marriage"
- , _author = "Tayari Jones"
- , _amznref = "B01NCUXEFR"}
- , Book { _title = "Americanah"
- , _author = "Chimamanda Ngozi Adichie"
- , _amznref = "B00A9ET4MC"}
- ]
- }
- , Person { _name = "Warren Buffet"
- , _pic = "https://encrypted-tbn0.gstatic.com/images?q=tbn:ANd9GcQQbmnUykS6zqgzaf44tsq1RAsnHe6H7fapEoSqUwAoJGSFKbAPSw"
- , _twitter = "WarrenBuffett"
- , _blurb = "Chairman and CEO of Berkshire Hathaway"
- , _website = "http://berkshirehathaway.com"
- , _books = [ Book { _title = "The Intelligent Investor"
- , _author = "Benjamin Graham"
- , _amznref = "B000FC12C8"}
- , Book { _title = "Security Analysis"
- , _author = "Benjamin Graham"
- , _amznref = "B0037JO5J8"}
- ]
- }
- , Person { _name = "Bill Gates"
- , _pic = "https://pbs.twimg.com/profile_images/988775660163252226/XpgonN0X_400x400.jpg"
- , _twitter = "BillGates"
- , _blurb = "Sharing things I'm learning through my foundation work and other interests. Founder of Microsoft and Bill & Melinda Gates Foundation"
- , _website = "https://www.gatesnotes.com"
- , _books = [ Book { _title = "Leonardo da Vinci"
- , _author = "Walter Isaacson"
- , _amznref = "1501139169"
- }
- , Book { _title = "Educated"
- , _author = "Tara Wetsover"
- , _amznref = "B072BLVM83"
- }
- ]
- }
- , Person { _name = "Stephen King"
- , _pic = "https://pbs.twimg.com/profile_images/378800000836981162/b683f7509ec792c3e481ead332940cdc_400x400.jpeg"
- , _twitter = "StephenKing"
- , _blurb = "World renowned Author"
- , _website = "https://stephenking.com/"
- , _books = [ Book { _title = "Red Moon"
- , _author = "Benjamin Percy"
- , _amznref = "B008TU2592"
- }
- , Book { _title = "The Marauders"
- , _author = "Tom Cooper"
- , _amznref = "B00MKZBVTM"
- }
- ]
- }
- , Person { _name = "Tobi Lütke"
- , _pic = "https://pbs.twimg.com/profile_images/551403375141457920/28EOlhnM_400x400.jpeg"
- , _twitter = "tobi"
- , _blurb = "Shopify CEO by day, Dad in the evening, hacker at night. - Rails Core alumni; Author of ActiveMerchant, Liquid. Comprehensivist"
- , _website = "https://www.shopify.com"
- , _books = [ Book { _title = "Influence"
- , _author ="Robert B. Cialdini"
- , _amznref = "006124189X"
- }
- , Book { _title = "High Output Management"
- , _author ="Andrew S. Grove"
- , _amznref = "B015VACHOK"
- }
- ]
- }
- , Person { _name = "Susan Cain"
- , _pic = "https://pbs.twimg.com/profile_images/1474290079/SusanCain5smaller-1_400x400.jpg"
- , _twitter = "susancain"
- , _blurb = "Bestselling author, award-winning speaker, http://Quietrev.com curator. Lover of bittersweet music & bittersweet chocolate, in equal measure."
- , _website = "https://www.quietrev.com"
- , _books = [ Book { _title = "Bird by Bird"
- , _author ="Anne Lamott"
- , _amznref = "0385480016"
- }
- , Book { _title = "Waking Up"
- , _author ="Sam Harris"
- , _amznref = "1451636024"
- }
- ]
- }
- , Person { _name = "Oprah Winfrey"
- , _pic = "https://pbs.twimg.com/profile_images/1013835283698049025/q5ZN4yv3_400x400.jpg"
- , _twitter = "Oprah"
- , _blurb = "Oprah Winfrey is an American media executive, actress, talk show host, television producer and philanthropis"
- , _website = "http://www.oprah.com/index.html"
- , _books = [ Book { _title = "A New Earth"
- , _author ="Eckhart Tolle"
- , _amznref = "B000PC0S5K"
- }
- , Book { _title = "The Poisonwood Bible"
- , _author ="Barbara Kingsolver"
- , _amznref = "B000QTE9WU"
- }
- ]
- }
- , Person { _name = "Patrick Collison"
- , _pic = "https://pbs.twimg.com/profile_images/825622525342199809/_iAaSUQf_400x400.jpg"
- , _twitter = "patrickc"
- , _blurb = "Fallibilist, optimist. Stripe CEO"
- , _website = "https://patrickcollison.com"
- , _books = [ Book { _title = "How Judges Think"
- , _author ="Richard A. Posner"
- , _amznref = "0674048067"
- }
- , Book { _title = "Programmers at Work"
- , _author ="Susan Lammers"
- , _amznref = "1556152116"
- }
- ]
- }
- , Person { _name = "Luis Von Ahn"
- , _pic = "https://pbs.twimg.com/profile_images/1020343581087678464/NIXD5MdC_400x400.jpg"
- , _twitter = "LuisvonAhn"
- , _blurb = "CEO & co-founder of duolingo. Invented reCAPTCHA. Computer science professor at Carnegie Mellon. Proud Guatemalan"
- , _website = "https://www.duolingo.com/"
- , _books = [ Book { _title = "Zero to One"
- , _author ="Peter Thiel"
- , _amznref = "B00J6YBOFQ"
- }
- , Book { _title = "The Hard Thing About Hard Things"
- , _author ="Ben Horowitz"
- , _amznref = "B00DQ845EA"
- }
- ]
- }
- , Person { _name = "Bryan Johnson"
- , _pic = "https://pbs.twimg.com/profile_images/1055165076372475904/vNp60sSl_400x400.jpg"
- , _twitter = "bryan_johnson"
- , _blurb = "Founder of Kernel, OS Fund and Braintree. Trying to go where there is no destination"
- , _website = "https://bryanjohnson.co"
- , _books = [ Book { _title = "A Good Man"
- , _author ="Mark Shriver"
- , _amznref = "B007CLBH0M"
- }
- , Book { _title = "Shackleton"
- , _author ="Nick Bertozzi"
- , _amznref = "1596434511"
- }
- ]
- }
- , Person { _name = "Peter Thiel"
- , _pic = "https://pbs.twimg.com/profile_images/1121220551/Peter_Thiel_400x400.jpg"
- , _twitter = "peterthiel"
- , _blurb = "Technology entrepreneur, investor, philanthropist."
- , _website = "http://zerotoonebook.com"
- , _books = [ Book { _title = "Deceit, Desire, and the Novel"
- , _author ="René Girard"
- , _amznref = "0801818303"
- }
- , Book { _title = "Violence and the Sacred"
- , _author ="René Girard"
- , _amznref = "0801822181"
- }
- ]
- }
- , Person { _name = "Tim Ferris"
- , _pic = "https://pbs.twimg.com/profile_images/49918572/half-face-ice_400x400.jpg"
- , _twitter = "tferriss"
- , _blurb = "Author of 5 #1 NYT/WSJ bestsellers, investor (FB, Uber, Twitter, 50+ more: http://angel.co/tim ), host of The Tim Ferriss Show podcast (300M+ downloads)"
- , _website = "http://tim.blog"
- , _books = [ Book { _title = "10% Happier"
- , _author ="Dan Harris"
- , _amznref = "0062265431"
- }
- , Book { _title = "A Guide to the Good Life"
- , _author ="William Irvine"
- , _amznref = "B0040JHNQG"
- }
- ]
- }
- , Person { _name = "Allen Walton"
- , _pic = "https://pbs.twimg.com/profile_images/1038905908678545409/yUbF9Ruc_400x400.jpg"
- , _twitter = "allenthird"
- , _blurb = "Created http://SpyGuy.com and blogs about stuff at http://AllenWalton.com . All things ecommerce, personal dev, and Simpsons."
- , _website = "https://www.allenwalton.com"
- , _books = [ Book { _title = "4 Hour Work Week"
- , _author ="Tim Ferris"
- , _amznref = "B002WE46UW"
- }
- , Book { _title = "Choose Yourself"
- , _author ="James Altucher"
- , _amznref = "B00CO8D3G4"
- }
- ]
- }
- , Person { _name = "Peter Mallouk"
- , _pic = "https://pbs.twimg.com/profile_images/713172266968715264/KsyDYghf_400x400.jpg"
- , _twitter = "PeterMallouk"
- , _blurb = "President of Creative Planning. Author “5 Mistakes Every Investor Makes & How to Avoid Them”. Radically moderate."
- , _website = "https://creativeplanning.com"
- , _books = [ Book { _title = "Awareness"
- , _author ="Anthony de Mello SJ"
- , _amznref = "B005GFBP6W"
- }
- , Book { _title = "The Prophet"
- , _author ="Kahlil Gibran"
- , _amznref = "B07NDJ3LMW"
- }
- ]
- }
- , Person { _name = "Adam Robinson"
- , _pic = "https://pbs.twimg.com/profile_images/822708907051077632/y5KyboMV_400x400.jpg"
- , _twitter = "IAmAdamRobinson"
- , _blurb = "Entrepreneur. Systems builder. Wizard. Shaman of global financial markets. Manifester. Didact. Do-gooder. Alchemist. Aphorist. Seeker. Embracer of possibility."
- , _website = "http://robinsonglobalstrategies.com"
- , _books = [ Book { _title = "Wishcraft"
- , _author ="Barbara Sher"
- , _amznref = "0345465180"
- }
- , Book { _title = "You Can Be a Stock Market Genius"
- , _author ="Joel Greenblatt"
- , _amznref = "0684832135"
- }
- ]
- }
- , Person { _name = "Andrew Weil"
- , _pic = "https://pbs.twimg.com/profile_images/987461787422359553/mpoZAmPH_400x400.jpg"
- , _twitter = "DrWeil"
- , _blurb = "A world-renowned leader and pioneer in the field of integrative medicine, a healing oriented approach to health care which encompasses body, mind, and spirit."
- , _website = "https://www.drweil.com"
- , _books = [ Book { _title = "The Way Of Life According To Lao Tzu"
- , _author = "Witter Byner"
- , _amznref = "0399512985"
- }
- , Book { _title = "The Psychology of Romantic Love"
- , _author ="Nathaniel Branden"
- , _amznref = "B0012RMVJI"
- }
- ]
- }
- , Person { _name = "Hubert Joly"
- , _pic = "https://scontent-ort2-2.xx.fbcdn.net/v/t1.0-1/c1.0.193.193a/38444401_2156120597936470_9028564067043770368_n.jpg?_nc_cat=104&_nc_ht=scontent-ort2-2.xx&oh=162142edb167f389a5b585a329e4993a&oe=5CE1D578"
- , _twitter = "BBYCEO"
- , _blurb = "CEO of Best Buy"
- , _website = "https://www.bestbuy.com"
- , _books = [ Book { _title = "Who Says Elephants Can't Dance"
- , _author = "Louis. V. Gerstner"
- , _amznref = "0060523808"
- }
- , Book { _title = "Onward"
- , _author ="Howard Schultz"
- , _amznref = "1609613821"
- }
- ]
- }
- , Person { _name = "Esther Perel"
- , _pic = "https://pbs.twimg.com/profile_images/1091062675151319040/MzxCcgdU_400x400.jpg"
- , _twitter = "EstherPerel"
- , _blurb = "Exploring modern relationships. Author of MatingInCaptivity and TheStateOfAffairsBook. Podcast: WhereShouldWeBegin. Psychotherapist in NYC."
- , _website = "https://www.estherperel.com"
- , _books = [ Book { _title = "Crime And Punishment"
- , _author = "Fyodor Dostoyevsky"
- , _amznref = "B07NL94DFD"
- }
- , Book { _title = "If This Is a Man and The Truce"
- , _author ="Primo Levi"
- , _amznref = "0349100136"
- }
- ]
- }
- , Person { _name ="Neil deGrasse Tyson"
- , _pic = "https://pbs.twimg.com/profile_images/74188698/NeilTysonOriginsA-Crop_400x400.jpg"
- , _twitter = "neiltyson"
- , _blurb = "Astrophysicistthe. Fifth head since 1935 of the world-renowned Hayden Planetarium in New York City and the first occupant of its Frederick P. Rose Directorship. Research associate of the Department of Astrophysics at the American Museum of Natural History."
- , _website = "https://www.haydenplanetarium.org/tyson/"
- , _books = [ Book { _title = "The Prince"
- , _author = "Machiavelli"
- , _amznref = "B07ND3CM16"
- }
- , Book { _title = "The Art of War"
- , _author ="Sun Tzu"
- , _amznref = "1545211957"
- }
- ]
- }
- , Person { _name = "Mark Cuban"
- , _pic = "https://pbs.twimg.com/profile_images/1422637130/mccigartrophy_400x400.jpg"
- , _twitter = "mcuban"
- , _blurb = "Owner of Dallas Mavericks, Shark on ABC’s Shark Tank, chairman and CEO of AXS tv, and investor in an ever-growing portfolio of businesses"
- , _website = "http://markcubancompanies.com/"
- , _books = [ Book { _title = "The Fountainhead"
- , _author = "Ayn Rend"
- , _amznref = "0452273331"
- }
- , Book { _title = "The Gospel of Wealth "
- , _author ="Andrew Carnegie"
- , _amznref = "1409942171"
- }
- ]
- }
- , Person { _name = "Robert Herjavec"
- , _pic = "https://pbs.twimg.com/profile_images/608643660876423170/DgxUW3eZ_400x400.jpg"
- , _twitter = "robertherjavec"
- , _blurb = "Dad, Husband, Founder & CEO of global cybersecurity firm HerjavecGroup, Shark on ABC’s Shark Tank, Former Dragon, Author"
- , _website = "https://www.robertherjavec.com/"
- , _books = [ Book { _title = "Why I Run"
- , _author = "Mark Sutcliffe"
- , _amznref = "B007OC9P3A"
- }
- , Book { _title = "Swim with the Sharks Without Being Eaten Alive"
- , _author ="Harvey B. Mackay"
- , _amznref = "006074281X"
- }
- ]
- }
- , Person { _name = "Caterina Fake"
- , _pic = "https://pbs.twimg.com/profile_images/378800000509318185/d968d62d1bc39f2c82d3fa44db478525_400x400.jpeg"
- , _twitter = "Caterina"
- , _blurb = "Host, Should this Exist? Investor, Yes VC. Cofounder: Flickr, Hunch, Sesat School. Etsy. Sundance. Homeschooling, film, literature. Dogs."
- , _website = "https://caterina.net"
- , _books = [ Book { _title = "Growth of the Soil"
- , _author = "Knut Hamsun"
- , _amznref = "0343181967"
- }
- , Book { _title = "The Thousand Autumns of Jacob de Zoet"
- , _author ="David Mitchell"
- , _amznref = "0812976363"
- }
- ]
- }
- , Person { _name = "Daymond John"
- , _pic = "https://pbs.twimg.com/profile_images/1048022980863954944/eZvGANn0_400x400.jpg"
- , _twitter = "TheSharkDaymond"
- , _blurb = "CEO of FUBU, Shark on ABC’s Shark Tank, Author."
- , _website = "https://daymondjohn.com/"
- , _books = [ Book { _title = "Think and Grow Rich"
- , _author = "Napoleon Hill"
- , _amznref = "1585424331"
- }
- , Book { _title = "How to Win Friends & Influence People"
- , _author ="Dale Carnegie"
- , _amznref = "0671027034"
- }
- ]
- }
- , Person { _name = "Kevin O'Leary"
- , _pic = "https://pbs.twimg.com/profile_images/1067383195597889536/cP6tNEt0_400x400.jpg"
- , _twitter = "kevinolearytv"
- , _blurb = "Chairman O'Shares ETFs, 4 time Emmy Award winning Shark Tank's Mr. Wonderful, bestselling author, CNBC contributor, wine maker, guitar dude and photographer."
- , _website = "http://askmrwonderful.eone.libsynpro.com/"
- , _books = [ Book { _title = "Competitive Advantage"
- , _author = "Michael Porter"
- , _amznref = "0684841460"
- }
- , Book { _title = "Secrets of Closing the Sale"
- , _author ="Zig Ziglar"
- , _amznref = "0425081028"
- }
- ]
- }
- , Person { _name = "Alex Rodriguez"
- , _pic = "https://pbs.twimg.com/profile_images/796405335388848128/LbvsjCA3_400x400.jpg"
- , _twitter = "AROD"
- , _blurb = "3-time MVP • 14-time All Star • World Series Champ • CEO of @_ARodCorp• @FoxSports Commentator/Analyst • Special Advisor to the Yankees, @ABCSharkTank and ESPN"
- , _website = "http://www.arodcorp.com/"
- , _books = [ Book { _title = "Blitzscaling"
- , _author = "Reid Hoffman"
- , _amznref = "1524761419"
- }
- , Book { _title = "Measure What Matters"
- , _author ="John Doerr"
- , _amznref = "0525536221"
- }
- ]
- }
- ]
diff --git a/lore/Biz/Ibb/Keep.hs b/lore/Biz/Ibb/Keep.hs
deleted file mode 100644
index ad7dcbc..0000000
--- a/lore/Biz/Ibb/Keep.hs
+++ /dev/null
@@ -1,124 +0,0 @@
-{-# LANGUAGE TemplateHaskell #-}
-{-# LANGUAGE GeneralizedNewtypeDeriving #-}
-{-# LANGUAGE DeriveDataTypeable #-}
-{-# LANGUAGE TypeFamilies #-}
-{-# OPTIONS_GHC -fno-warn-orphans #-}
-
--- | Keep is a database built on Data.Acid.
---
--- If this proves useful, maybe we could make it a more general thing. Like
--- `Biz.Keep`. I could wrap all the safecopy stuff in my own template haskell
--- like `$(keep ''MyType)`.
---
-module Biz.Ibb.Keep where
-
-import Biz.Ibb.Core (Person(..), Book(..))
-import Control.Monad.State (get, put)
-import Control.Monad.Reader (ask)
-import Data.Acid (Update, makeAcidic)
-import qualified Data.Acid as Acid
-import Data.Data (Data, Typeable)
-import Data.IxSet (Indexable(..), IxSet, ixFun, ixSet)
-import qualified Data.IxSet as IxSet
-import Data.SafeCopy
-import Data.Text (Text)
-import qualified Data.Text as Text
-
-import qualified Biz.Ibb.Influencers as Influencers
-
--- * Keep
-
--- | Main database. Need to think of a better name for this.
-data IbbKeep = IbbKeep
- { _people :: IxSet Person
- }
- deriving (Data, Typeable)
-
-$(deriveSafeCopy 0 'base ''IbbKeep)
-
--- * Index @Person@
-
-$(deriveSafeCopy 0 'base ''Person)
-
-newtype PersonName =
- PersonName Text deriving (Eq, Ord, Data, Typeable)
-
-newtype PersonBlurb =
- PersonBlurb Text deriving (Eq, Ord, Data, Typeable)
-
-instance Indexable Person where
- empty = ixSet
- [ ixFun $ \p -> [ PersonName $ _name p ]
- , ixFun $ \p -> [ _pic p ]
- , ixFun $ \p -> [ _twitter p ]
- , ixFun $ \p -> [ _website p ]
- , ixFun $ \p -> [ _books p ]
- , ixFun $ \p -> [ PersonBlurb $ _blurb p ]
- ]
-
--- | updates the `IbbKeep` with a new `Person`
-newPerson :: Text -> Text -> Update IbbKeep Person
-newPerson name blurb = do
- k <- get
- put $ k { _people = IxSet.insert p (_people k)
- }
- return p
- where
- p = Person
- { _name = name
- , _pic = Text.empty
- , _twitter = Text.empty
- , _website = Text.empty
- , _books = []
- , _blurb = blurb
- }
-
-getPeople :: Int -> Acid.Query IbbKeep [Person]
-getPeople n = do
- keep <- ask
- return $ take n $ IxSet.toList $ _people keep
-
--- * Index @Book@
-
-$(deriveSafeCopy 0 'base ''Book)
-
-newtype BookTitle =
- BookTitle Text deriving (Eq, Ord, Data, Typeable)
-
-newtype BookAuthor =
- BookAuthor Text deriving (Eq, Ord, Data, Typeable)
-
-instance Indexable Book where
- empty = ixSet
- [ ixFun $ \b -> [ BookTitle $ _title b ]
- , ixFun $ \b -> [ BookAuthor $ _author b ]
- , ixFun $ \b -> [ _amznref b ]
- ]
-
--- | updates the `IbbKeep` with a new `Book`
---newBook :: Text -> Text -> Text -> Update IbbKeep Book
---newBook title author amznref = do
--- ibbKeep <- get
--- put $ ibbKeep { _books = IxSet.insert b (_books ibbKeep)
--- , _people = _people ibbKeep
--- }
--- return b
--- where
--- b = Book { _title = title
--- , _author = author
--- , _amznref = amznref
--- }
-
--- * Opening the keep
-
--- defines @NewPerson@ for us.
-$(makeAcidic ''IbbKeep ['newPerson, 'getPeople])
-
-initialIbbKeep :: IbbKeep
-initialIbbKeep = IbbKeep
- { _people = IxSet.fromList Influencers.allPeople
- }
-
-openLocal :: String -> IO (Acid.AcidState IbbKeep)
-openLocal dir =
- Acid.openLocalStateFrom dir initialIbbKeep
diff --git a/lore/Biz/Ibb/Look.hs b/lore/Biz/Ibb/Look.hs
deleted file mode 100644
index 9017ba2..0000000
--- a/lore/Biz/Ibb/Look.hs
+++ /dev/null
@@ -1,27 +0,0 @@
-{-# LANGUAGE OverloadedStrings #-}
-{-# LANGUAGE NoImplicitPrelude #-}
-
--- | The look and feel of Ibb
-module Biz.Ibb.Look where
-
-import Alpha
-import Clay
-import qualified Clay.Stylesheet as Stylesheet
-import qualified Clay.Render as Clay
-import qualified Clay.Flexbox as Flexbox
-import qualified Clay.Media as Media
-
-main :: Css
-main = do
- "html" <> "body" ? do
- width (pc 100)
- display flex
- flexDirection column
- alignItems center
- alignContent center
- justifyContent center
- ".container" ? do
- width (px 900)
- display flex
- justifyContent center
- flexDirection column
diff --git a/lore/Biz/Ibb/Move.hs b/lore/Biz/Ibb/Move.hs
deleted file mode 100644
index 0d83e8a..0000000
--- a/lore/Biz/Ibb/Move.hs
+++ /dev/null
@@ -1,43 +0,0 @@
-{-# LANGUAGE NoImplicitPrelude #-}
-{-# LANGUAGE OverloadedStrings #-}
-
--- | App update logic
-module Biz.Ibb.Move (
- move
- -- * Server interactions
- , fetchPeople
- ) where
-
-import Alpha
-import Data.Aeson
-import Biz.Ibb.Core as Core
-import JavaScript.Web.XMLHttpRequest (Request(..), Method(GET), RequestData(NoData), contents, xhrByteString)
-import Miso
-import Miso.String
-import Network.RemoteData
-
-move :: Action -> Model -> Effect Action Model
-move Nop m = noEff m
-move (HandleRoute u) m = m { uri = u } <# pure Nop
-move (ChangeRoute u) m = m <# do pushURI u >> pure Nop
-move FetchPeople m = m <# (SetPeople /@ fetchPeople)
-move (SetPeople ps) m = noEff m { people = ps }
-
-fetchPeople :: IO (WebData [Core.Person])
-fetchPeople = do
- mjson <- contents /@ xhrByteString req
- case mjson of
- Nothing -> pure $ Failure "could not read from server"
- Just a -> pure
- $ fromEither
- $ either (Left . ms) pure
- $ eitherDecodeStrict a
- where
- req = Request { reqMethod = GET
- -- FIXME: can replace this hardcoding with a function?
- , reqURI = "/api/people"
- , reqLogin = Nothing
- , reqHeaders = []
- , reqWithCredentials = False
- , reqData = NoData
- }
diff --git a/lore/Control/Concurrent/Go.hs b/lore/Control/Concurrent/Go.hs
deleted file mode 100644
index 711611f..0000000
--- a/lore/Control/Concurrent/Go.hs
+++ /dev/null
@@ -1,100 +0,0 @@
--- based on
--- https://stackoverflow.com/questions/4522387/how-can-i-emulate-gos-channels-with-haskell
--- but this version encodes end-of-stream on the communication channel, as a Nothing
-
-module Control.Concurrent.Go
- ( chan
- , readCh
- , (-<-)
- , writeCh
- , (->-)
- , go
- )
-where
-
-import Control.Concurrent ( forkIO
- , ThreadId
- , threadDelay
- )
-import Control.Concurrent.STM.TChan ( newTChan
- , readTChan
- , writeTChan
- , isEmptyTChan
- , TChan
- )
-import Control.Monad ( forM_ )
-import GHC.Conc ( atomically )
-
--- | Make a new channel.
-chan :: _
-chan = atomically . newTChan
-
--- | Take from a channel.
-readCh :: TChan a -> IO a
-readCh = atomically . readTChan
-
--- | Alias for 'readCh'.
---
--- >>> c <- chan
--- >>> writeCh c "val"
--- >>> -<- c
--- "val"
---
--- I don't think this looks terrible with do-notation:
---
--- >>> c <- chan
--- >>> writeCh c "val"
--- >>> result <- -<- c
--- >>> print result
--- "val"
-(-<-) :: TChan a -> IO a
-(-<-) = readCh
-
--- | Write to a channel.
-writeCh :: TChan a -> a -> IO ()
-writeCh ch v = atomically $ writeTChan ch v
-
--- | Alias for 'writeCh', but flipped to make it read better.
---
--- >>> c <- chan
--- >>> "val" ->- c
--- >>> readCh c
--- "val"
-(->-) :: TChan a -> a -> IO ()
-(->-) = flip writeCh
-
--- | Starts a background process.
-go :: IO () -> IO ThreadId
-go = forkIO
-
-
-{- Example: (TODO: move to module-level docs)
-
--- can I just implement forM/Traversable over the channel?
-forRange :: TChan (Maybe a) -> (a -> IO b) -> IO [b]
-forRange ch fn = helper fn [] where
- -- helper :: (a -> IO b) -> [b] -> IO [b]
- helper fn acc = do
- jv <- readCh ch
- case jv of
- Nothing -> return $ reverse acc
- Just v -> do
- b <- fn v
- helper fn (b : acc)
-
-feedData :: (Num a, Enum a) => TChan (Maybe a) -> IO ()
-feedData ch = do
- forM_ [1 .. 9999] (\x -> writeCh ch (Just x))
- writeQ ch Nothing -- EOF value
-
-printData :: TChan (Maybe Int) -> IO ()
-printData c = do
- forRange c (print :: Int -> IO ())
- return ()
-
-main :: IO ()
-main = do
- ch <- chan
- go $ feedData ch
- printData ch
--}
diff --git a/lore/Control/Concurrent/Sima.hs b/lore/Control/Concurrent/Sima.hs
deleted file mode 100644
index b69c0bb..0000000
--- a/lore/Control/Concurrent/Sima.hs
+++ /dev/null
@@ -1,12 +0,0 @@
-module Control.Concurrent.Sima
- ( mapPool
- )
-where
-
-import qualified Control.Concurrent.MSem as Sem
-
--- | Simaphore-based throttled 'mapConcurrently'.
-mapPool :: Traversable t => Int -> (a -> IO b) -> t a -> IO (t b)
-mapPool n f xs = do
- sima <- Sem.new n
- mapConcurrently (Sem.with sima . f) xs
diff --git a/lore/Language/Bs.hs b/lore/Language/Bs.hs
deleted file mode 100644
index a810706..0000000
--- a/lore/Language/Bs.hs
+++ /dev/null
@@ -1,12 +0,0 @@
--- https://github.com/write-you-a-scheme-v2/scheme
--- https://github.com/justinethier/husk-scheme
-module Language.Bs
- ( module X
- ) where
-
-import Language.Bs.Cli as X
-import Language.Bs.Eval as X
-import Language.Bs.Expr as X
-import Language.Bs.Parser as X
-import Language.Bs.Primitives as X
-import Language.Bs.Repl as X
diff --git a/lore/Language/Bs/Cli.hs b/lore/Language/Bs/Cli.hs
deleted file mode 100644
index 4c48c86..0000000
--- a/lore/Language/Bs/Cli.hs
+++ /dev/null
@@ -1,52 +0,0 @@
-{-# LANGUAGE OverloadedStrings #-}
-{-# LANGUAGE NoImplicitPrelude #-}
-module Language.Bs.Cli (
- run
-) where
-
-import Data.String
-import Data.Text.IO as TIO
-import Language.Bs.Eval -- evalFile :: T.Text -> IO ()
-import Language.Bs.Repl -- Repl.mainLoop :: IO ()
-import Options.Applicative
-import Protolude
-import System.Directory
-
--- SOURCES
---http://book.realworldhaskell.org/read/io.html
--- https://github.com/pcapriotti/optparse-applicative
--- https://hackage.haskell.org/package/optparse-applicative
-
-runScript :: FilePath -> IO ()
-runScript fname = do
- exists <- doesFileExist fname
- if exists
- then TIO.readFile fname >>= evalFile fname
- else TIO.putStrLn "File does not exist."
-
-data LineOpts = UseReplLineOpts | RunScriptLineOpts String
-
-parseLineOpts :: Parser LineOpts
-parseLineOpts = runScriptOpt <|> runReplOpt
- where
- runScriptOpt =
- RunScriptLineOpts <$> strOption (long "script"
- <> short 's'
- <> metavar "SCRIPT"
- <> help "File containing the script you want to run")
- runReplOpt =
- UseReplLineOpts <$ flag' () (long "repl"
- <> short 'r'
- <> help "Run as interavtive read/evaluate/print/loop")
-
-schemeEntryPoint :: LineOpts -> IO ()
-schemeEntryPoint UseReplLineOpts = mainLoop --repl
-schemeEntryPoint (RunScriptLineOpts script) = runScript script
-
-run :: IO ()
-run = execParser opts >>= schemeEntryPoint
- where
- opts = info (helper <*> parseLineOpts)
- ( fullDesc
- <> header "Executable binary for Write You A Scheme v2.0"
- <> progDesc "contains an entry point for both running scripts and repl" )
diff --git a/lore/Language/Bs/Eval.hs b/lore/Language/Bs/Eval.hs
deleted file mode 100644
index 290170b..0000000
--- a/lore/Language/Bs/Eval.hs
+++ /dev/null
@@ -1,241 +0,0 @@
-{-# LANGUAGE FlexibleContexts #-}
-{-# LANGUAGE ScopedTypeVariables #-}
-{-# LANGUAGE RecordWildCards #-}
-{-# LANGUAGE OverloadedStrings #-}
-{-# LANGUAGE NoImplicitPrelude #-}
-module Language.Bs.Eval (
- evalText
-, evalFile
-, runParseTest
-, safeExec
-, runASTinEnv
-, basicEnv
-, fileToEvalForm
-, textToEvalForm
-, getFileContents
-) where
-
-import Control.Exception
-import Control.Monad.Reader
-import qualified Data.Map as Map
-import Data.String
-import qualified Data.Text as T
-import qualified Data.Text.IO as TIO
-import Language.Bs.Expr
-import Language.Bs.Parser
-import Language.Bs.Primitives
-import Protolude
-import System.Directory
-
-funcEnv :: Map.Map T.Text Expr
-funcEnv = Map.fromList $ primEnv
- <> [ ("read" , IFun $ IFunc $ unop readFn)
- , ("parse", IFun $ IFunc $ unop parseFn)
- , ("eval", IFun $ IFunc $ unop eval)
- , ("show", IFun $ IFunc $ unop (return . Tape . ppexpr))
- ]
-
-basicEnv :: Env
-basicEnv = Env Map.empty funcEnv
-
-readFn :: Expr -> Eval Expr
-readFn (Tape txt) = lineToEvalForm txt
-readFn val = throw $ TypeMismatch "read expects string, instead got:" val
-
-parseFn :: Expr -> Eval Expr
-parseFn (Tape txt) = either (throw . ParseError . show) return $ readExpr txt
-parseFn val = throw $ TypeMismatch "parse expects string, instead got:" val
-
-safeExec :: IO a -> IO (Either String a)
-safeExec m = do
- result <- Control.Exception.try m
- case result of
- Left (eTop :: SomeException) ->
- case fromException eTop of
- Just (enclosed :: LispError) ->
- return $ Left (show enclosed)
- Nothing ->
- return $ Left (show eTop)
- Right val ->
- return $ Right val
-
-runASTinEnv :: Env -> Eval b -> IO b
-runASTinEnv code action = runReaderT (unEval action) code
-
-lineToEvalForm :: T.Text -> Eval Expr
-lineToEvalForm input = either (throw . ParseError . show ) eval $ readExpr input
-
-evalFile :: FilePath -> T.Text -> IO () -- program file
-evalFile filePath fileExpr = (runASTinEnv basicEnv $ fileToEvalForm filePath fileExpr) >>= print
-
-fileToEvalForm :: FilePath -> T.Text -> Eval Expr
-fileToEvalForm filePath input = either (throw . ParseError . show ) evalBody $ readExprFile filePath input
-
-runParseTest :: T.Text -> T.Text -- for view AST
-runParseTest input = either (T.pack . show) (T.pack . show) $ readExpr input
-
-getFileContents :: FilePath -> IO T.Text
-getFileContents fname = do
- exists <- doesFileExist fname
- if exists then TIO.readFile fname else return "File does not exist."
-
-textToEvalForm :: T.Text -> Eval Expr
-textToEvalForm input = either (throw . ParseError . show ) evalBody $ readExpr input
-
-evalText :: T.Text -> IO () --REPL
-evalText textExpr = do
- res <- runASTinEnv basicEnv $ textToEvalForm textExpr
- print res
-
-getVar :: Expr -> Eval Expr
-getVar (Atom atom) = do
- Env{..} <- ask
- case Map.lookup atom (Map.union fenv env) of -- lookup, but prefer functions
- Just x -> return x
- Nothing -> throw $ UnboundVar atom
-getVar n = throw $ TypeMismatch "failure to get variable: " n
-
-ensureAtom :: Expr -> Eval Expr
-ensureAtom n@(Atom _) = return n
-ensureAtom n@(List _) = throw $ TypeMismatch "got list" n
-ensureAtom n = throw $ TypeMismatch "expected an atomic value" n
-
-extractVar :: Expr -> T.Text
-extractVar (Atom atom) = atom
-extractVar n = throw $ TypeMismatch "expected an atomic value" n
-
-getEven :: [t] -> [t]
-getEven [] = []
-getEven (x:xs) = x : getOdd xs
-
-getOdd :: [t] -> [t]
-getOdd [] = []
-getOdd (_:xs) = getEven xs
-
-applyFunc :: Expr -> [Expr] -> [Expr] -> Eval Expr
-applyFunc expr params args = bindArgsEval params args expr
-
-bindArgsEval :: [Expr] -> [Expr] -> Expr -> Eval Expr
-bindArgsEval params args expr = do
- Env{..} <- ask
- let newVars = zipWith (\a b -> (extractVar a,b)) params args
- let (newEnv, newFenv) = Map.partition (not . isFunc) $ Map.fromList newVars
- local (const $ Env (newEnv <> env) (newFenv <> fenv)) $ eval expr
-
-isFunc :: Expr -> Bool
-isFunc (List ((Atom "lambda"):_)) = True
-isFunc _ = False
-
-eval :: Expr -> Eval Expr
-eval (List [Atom "dumpEnv", x]) = do
- Env{..} <- ask
- liftIO $ print $ toList env
- liftIO $ print $ toList fenv
- eval x
-
-eval (Numb i) = return $ Numb i
-eval (Tape s) = return $ Tape s
-eval (Bool b) = return $ Bool b
-eval (List []) = return Nil
-eval Nil = return Nil
-eval n@(Atom _) = getVar n
-
-eval (List [Atom "showSF", rest]) = return . Tape . T.pack $ show rest
-eval (List ((:) (Atom "showSF") rest)) = return . Tape . T.pack . show $ List rest
-
-eval (List [Atom "quote", val]) = return val
-
-eval (List [Atom "if", pred_, then_, else_]) = do
- ifRes <- eval pred_
- case ifRes of
- (Bool True) -> eval then_
- (Bool False) -> eval else_
- _ ->
- throw $ BadSpecialForm "if's first arg must eval into a boolean"
-eval (List ( (:) (Atom "if") _)) =
- throw $ BadSpecialForm "(if <bool> <s-expr> <s-expr>)"
-
-eval (List [Atom "begin", rest]) = evalBody rest
-eval (List ((:) (Atom "begin") rest )) = evalBody $ List rest
-
--- top-level define
--- TODO: how to make this eval correctly?
-eval (List [Atom "define", List (name:args), body]) = do
- Env{..} <- ask
- _ <- eval body
- bindArgsEval (name:args) [body] name
-
-eval (List [Atom "define", name, body]) = do
- Env{..} <- ask
- _ <- eval body
- bindArgsEval [name] [body] name
-
-eval (List [Atom "let", List pairs, expr]) = do
- Env{..} <- ask
- atoms <- mapM ensureAtom $ getEven pairs
- vals <- mapM eval $ getOdd pairs
- bindArgsEval atoms vals expr
-
-eval (List (Atom "let":_) ) =
- throw $ BadSpecialForm "let function expects list of parameters and S-Expression body\n(let <pairs> <s-expr>)"
-
-
-eval (List [Atom "lambda", List params, expr]) = do
- ctx <- ask
- return $ Func (IFunc $ applyFunc expr params) ctx
-eval (List (Atom "lambda":_) ) = throw $ BadSpecialForm "lambda function expects list of parameters and S-Expression body\n(lambda <params> <s-expr>)"
-
-
--- needed to get cadr, etc to work
-eval (List [Atom "cdr", List [Atom "quote", List (_:xs)]]) =
- return $ List xs
-eval (List [Atom "cdr", arg@(List (x:xs))]) =
- case x of
- -- proxy for if the list can be evaluated
- Atom _ -> do
- val <- eval arg
- eval $ List [Atom "cdr", val]
- _ -> return $ List xs
-
-
-eval (List [Atom "car", List [Atom "quote", List (x:_)]]) =
- return $ x
-eval (List [Atom "car", arg@(List (x:_))]) =
- case x of
- Atom _ -> do
- val <- eval arg
- eval $ List [Atom "car", val]
- _ -> return $ x
-
-
-eval (List ((:) x xs)) = do
- Env{..} <- ask
- funVar <- eval x
- xVal <- mapM eval xs
- case funVar of
- (IFun (IFunc internalFn)) ->
- internalFn xVal
-
- (Func (IFunc definedFn) (Env benv _)) ->
- local (const $ Env benv fenv) $ definedFn xVal
-
- _ ->
- throw $ NotFunction funVar
-
-updateEnv :: T.Text -> Expr -> Env -> Env
-updateEnv var e@(IFun _) Env{..} = Env env $ Map.insert var e fenv
-updateEnv var e@(Func _ _) Env{..} = Env env $ Map.insert var e fenv
-updateEnv var e Env{..} = Env (Map.insert var e env) fenv
-
-evalBody :: Expr -> Eval Expr
-evalBody (List [List ((:) (Atom "define") [Atom var, defExpr]), rest]) = do
- evalVal <- eval defExpr
- ctx <- ask
- local (const $ updateEnv var evalVal ctx) $ eval rest
-
-evalBody (List ((:) (List ((:) (Atom "define") [Atom var, defExpr])) rest)) = do
- evalVal <- eval defExpr
- ctx <- ask
- local (const $ updateEnv var evalVal ctx) $ evalBody $ List rest
-
-evalBody x = eval x
diff --git a/lore/Language/Bs/Expr.hs b/lore/Language/Bs/Expr.hs
deleted file mode 100644
index a39c7b6..0000000
--- a/lore/Language/Bs/Expr.hs
+++ /dev/null
@@ -1,154 +0,0 @@
-{-# LANGUAGE OverloadedStrings #-}
-{-# LANGUAGE NoImplicitPrelude #-}
-{-# LANGUAGE DeriveDataTypeable #-}
-{-# LANGUAGE GeneralizedNewtypeDeriving #-}
-module Language.Bs.Expr where
-
-import Data.String (String)
-import Data.Text (Text)
-import qualified Data.Text as T
-import GHC.Show
-import Protolude hiding (show)
-import qualified Text.PrettyPrint.Leijen.Text as PP
-import Text.PrettyPrint.Leijen.Text hiding ((<$>))
-
-type Ctx = Map Text Expr
-data Env = Env { env :: Ctx, fenv :: Ctx }
- deriving (Eq)
-
-newtype Eval a = Eval { unEval :: ReaderT Env IO a }
- deriving (Monad, Functor, Applicative, MonadReader Env, MonadIO)
-
-data IFunc = IFunc { fn :: [Expr] -> Eval Expr }
- deriving (Typeable)
-
-instance Eq IFunc where
- (==) _ _ = False
-
-data Expr
- = Atom Text
- | List [Expr]
- | Numb Integer
- | Tape Text
- | IFun IFunc -- TODO: call this Kern
- | Func IFunc Env
- | Bool Bool
- | Nil
- deriving (Typeable, Eq)
-
-instance Show Expr where
- show = T.unpack . ppexpr
-
-data LispErrorType
- = NumArgs Integer [Expr]
- | LengthOfList Text Int
- | ExpectedList Text
- | ParseError String
- | TypeMismatch Text Expr
- | BadSpecialForm Text
- | NotFunction Expr
- | UnboundVar Text
- | Default Expr
- | ReadFileError Text
- deriving (Typeable)
-
-data LispError = LispError Expr LispErrorType
-
-instance Show LispErrorType where
- show = T.unpack . ppexpr
-
-instance Show LispError where
- show = T.unpack . ppexpr
-
-instance Exception LispErrorType
-instance Exception LispError
-
-ppexpr :: Pretty a => a -> Text
-ppexpr x = PP.displayTStrict (PP.renderPretty 1.0 70 (pretty x))
-
---prettyList :: [Doc] -> Doc
---prettyList = encloseSep lparen rparen PP.space
-
-instance Pretty Expr where
- pretty v =
- case v of
- Atom a ->
- textStrict a
-
- List ls ->
- prettyList $ fmap pretty ls
-
- Numb n ->
- integer n
-
- Tape t ->
- textStrict "\"" <> textStrict t <> textStrict "\""
-
- IFun _ ->
- textStrict "<internal function>"
-
- Func _ _ ->
- textStrict "<lambda function>"
-
- Bool True ->
- textStrict "#t"
-
- Bool False ->
- textStrict "#f"
-
- Nil ->
- textStrict "'()"
-
-instance Pretty LispErrorType where
- pretty err = case err of
- NumArgs i args ->
- textStrict "number of arguments"
- <$$> textStrict "expected"
- <+> textStrict (T.pack $ show i)
- <$$> textStrict "received"
- <+> textStrict (T.pack $ show $ length args)
-
-
- LengthOfList txt i ->
- textStrict "length of list in:"
- <+> textStrict txt
- <$$> textStrict "length:"
- <+> textStrict (T.pack $ show i)
-
- ParseError txt ->
- textStrict "cannot parse expr:"
- <+> textStrict (T.pack txt)
-
- TypeMismatch txt expr ->
- textStrict "type mismatch:"
- <$$> textStrict txt
- <$$> pretty expr
-
- BadSpecialForm txt ->
- textStrict "bad special form:"
- <$$> textStrict txt
-
- NotFunction expr ->
- textStrict "not a function"
- <$$> pretty expr
-
- UnboundVar txt ->
- textStrict "unbound variable:"
- <$$> textStrict txt
-
- Default _ ->
- textStrict "default error"
-
- ReadFileError txt ->
- textStrict "error reading file:"
- <$$> textStrict txt
-
- ExpectedList txt ->
- textStrict "expected list:"
- <$$> textStrict txt
-
-instance Pretty LispError where
- pretty (LispError expr typ) =
- textStrict "error evaluating:"
- <$$> indent 4 (pretty expr)
- <$$> pretty typ
diff --git a/lore/Language/Bs/Parser.hs b/lore/Language/Bs/Parser.hs
deleted file mode 100644
index 3044a60..0000000
--- a/lore/Language/Bs/Parser.hs
+++ /dev/null
@@ -1,121 +0,0 @@
-{-# LANGUAGE FlexibleContexts #-}
-{-# LANGUAGE OverloadedStrings #-}
-{-# LANGUAGE NoImplicitPrelude #-}
-module Language.Bs.Parser (
- readExpr
-, readExprFile
-) where
-
-import Control.Monad (fail)
-import Control.Monad (mzero)
-import Data.Char (digitToInt)
-import Data.Functor.Identity (Identity)
-import Data.String
-import qualified Data.Text as T
-import Language.Bs.Expr
-import Protolude hiding ((<|>), try)
-import Text.Parsec
-import qualified Text.Parsec.Language as Lang
-import Text.Parsec.Text
-import qualified Text.Parsec.Token as Tok
-
-lexer :: Tok.GenTokenParser T.Text () Identity
-lexer = Tok.makeTokenParser style
-
-style :: Tok.GenLanguageDef T.Text () Identity
-style = Lang.emptyDef {
- Tok.commentStart = "#|"
- , Tok.commentEnd = "|#"
- , Tok.commentLine = ";"
- , Tok.opStart = mzero
- , Tok.opLetter = mzero
- , Tok.identStart = letter <|> oneOf "!$%&*/:<=>?^_~"
- , Tok.identLetter = digit <|> letter <|> oneOf "!$%&*/:<=>?^_~+-.@"
- }
-
-parens :: Parser a -> Parser a
-parens = Tok.parens lexer
-
-whitespace :: Parser ()
-whitespace = Tok.whiteSpace lexer
-
-lexeme :: Parser a -> Parser a
-lexeme = Tok.lexeme lexer
-
-quoted :: Parser a -> Parser a
-quoted p = try (char '\'') *> p
-
-identifier :: Parser T.Text
-identifier = T.pack <$> (Tok.identifier lexer <|> specialIdentifier) <?> "identifier"
- where
- specialIdentifier :: Parser String
- specialIdentifier = lexeme $ try $
- string "-" <|> string "+" <|> string "..."
-
--- | The @Radix@ type consists of a base integer (e.g. @10@) and a parser for
--- digits in that base (e.g. @digit@).
-type Radix = (Integer, Parser Char)
-
--- | Parse an integer, given a radix as output by @radix@.
--- Copied from Text.Parsec.Token
-numberWithRadix :: Radix -> Parser Integer
-numberWithRadix (base, baseDigit) = do
- digits <- many1 baseDigit
- let n = foldl (\x d -> base*x + toInteger (digitToInt d)) 0 digits
- seq n (return n)
-
-decimal :: Parser Integer
-decimal = Tok.decimal lexer
-
--- | Parse a sign, return either @id@ or @negate@ based on the sign parsed.
--- Copied from Text.Parsec.Token
-sign :: Parser (Integer -> Integer)
-sign = char '-' *> return negate
- <|> char '+' *> return identity
- <|> return identity
-
-intRadix :: Radix -> Parser Integer
-intRadix r = sign <*> numberWithRadix r
-
-textLiteral :: Parser T.Text
-textLiteral = T.pack <$> Tok.stringLiteral lexer
-
-nil :: Parser ()
-nil = try ((char '\'') *> string "()") *> return () <?> "nil"
-
-hashVal :: Parser Expr
-hashVal = lexeme $ char '#'
- *> (char 't' *> return (Bool True)
- <|> char 'f' *> return (Bool False)
- <|> char 'b' *> (Numb <$> intRadix (2, oneOf "01"))
- <|> char 'o' *> (Numb <$> intRadix (8, octDigit))
- <|> char 'd' *> (Numb <$> intRadix (10, digit))
- <|> char 'x' *> (Numb <$> intRadix (16, hexDigit))
- <|> oneOf "ei" *> fail "Unsupported: exactness"
- <|> char '(' *> fail "Unsupported: vector"
- <|> char '\\' *> fail "Unsupported: char")
-
-
-lispVal :: Parser Expr
-lispVal = hashVal
- <|> Nil <$ nil
- <|> Numb <$> try (sign <*> decimal)
- <|> Atom <$> identifier
- <|> Tape <$> textLiteral
- <|> _Quote <$> quoted lispVal
- <|> List <$> parens manyExpr
-
-manyExpr :: Parser [Expr]
-manyExpr = lispVal `sepBy` whitespace
-
-_Quote :: Expr -> Expr
-_Quote x = List [Atom "quote", x]
-
-contents :: Parser a -> ParsecT T.Text () Identity a
-contents p = whitespace *> lexeme p <* eof
-
-readExpr :: T.Text -> Either ParseError Expr
-readExpr = parse (contents lispVal) "<stdin>"
-
-readExprFile :: SourceName -> T.Text -> Either ParseError Expr
-readExprFile = parse (contents (List <$> manyExpr))
diff --git a/lore/Language/Bs/Primitives.hs b/lore/Language/Bs/Primitives.hs
deleted file mode 100644
index c074c59..0000000
--- a/lore/Language/Bs/Primitives.hs
+++ /dev/null
@@ -1,183 +0,0 @@
-{-# LANGUAGE OverloadedStrings #-}
-{-# LANGUAGE NoImplicitPrelude #-}
--- | bs primitives
---
--- I would like to reduce the number of primitives in the language to some
--- minimal number, like SKI combinator or Nock instructions. I'm not sure what
--- the minimal number is. The idea is to move primitives from here into core.scm
--- over time.
-module Language.Bs.Primitives where
-
-import Control.Exception
-import Control.Monad.Except
-import Data.Text as T
-import Data.Text.IO as TIO
-import Language.Bs.Expr
-import Network.HTTP
-import Protolude
-import System.Directory
-import System.IO
-
-type Prim = [(T.Text, Expr)]
-type Unary = Expr -> Eval Expr
-type Binary = Expr -> Expr -> Eval Expr
-
-mkF :: ([Expr] -> Eval Expr) -> Expr
-mkF = IFun . IFunc
-
-primEnv :: Prim
-primEnv = [
- ("+" , mkF $ binopFold (numOp (+)) (Numb 0) )
- , ("*" , mkF $ binopFold (numOp (*)) (Numb 1) )
- , ("string-append", mkF $ binopFold (strOp (<>)) (Tape "") )
- , ("-" , mkF $ binop $ numOp (-))
- , ("<" , mkF $ binop $ numCmp (<))
- , ("<=" , mkF $ binop $ numCmp (<=))
- , (">" , mkF $ binop $ numCmp (>))
- , (">=" , mkF $ binop $ numCmp (>=))
- , ("==" , mkF $ binop $ numCmp (==))
- , ("even?" , mkF $ unop $ numBool even)
- , ("odd?" , mkF $ unop $ numBool odd)
- , ("neg?" , mkF $ unop $ numBool (< 0))
- , ("pos?" , mkF $ unop $ numBool (> 0))
- , ("eq?" , mkF $ binop eqCmd )
- , ("null?" , mkF $ unop (eqCmd Nil) )
- , ("bl-eq?" , mkF $ binop $ eqOp (==))
- , ("and" , mkF $ binopFold (eqOp (&&)) (Bool True))
- , ("or" , mkF $ binopFold (eqOp (||)) (Bool False))
- , ("not" , mkF $ unop $ notOp)
- , ("cons" , mkF $ Language.Bs.Primitives.cons)
- , ("cdr" , mkF $ Language.Bs.Primitives.cdr)
- , ("car" , mkF $ Language.Bs.Primitives.car)
- , ("quote" , mkF $ quote)
- , ("file?" , mkF $ unop fileExists)
- , ("slurp" , mkF $ unop slurp)
- , ("wslurp" , mkF $ unop wSlurp)
- , ("put" , mkF $ binop put_)
- ]
-
-unop :: Unary -> [Expr] -> Eval Expr
-unop op [x] = op x
-unop _ args = throw $ NumArgs 1 args
-
-binop :: Binary -> [Expr] -> Eval Expr
-binop op [x,y] = op x y
-binop _ args = throw $ NumArgs 2 args
-
-fileExists :: Expr -> Eval Expr
-fileExists (Tape txt) = Bool <$> liftIO (doesFileExist $ T.unpack txt)
-fileExists val = throw $ TypeMismatch "read expects string, instead got: " val
-
-slurp :: Expr -> Eval Expr
-slurp (Tape txt) = liftIO $ wFileSlurp txt
-slurp val = throw $ TypeMismatch "read expects string, instead got: " val
-
-wFileSlurp :: T.Text -> IO Expr
-wFileSlurp fileName = withFile (T.unpack fileName) ReadMode go
- where go = readTextFile fileName
-
-openURL :: T.Text -> IO Expr
-openURL x = do
- req <- simpleHTTP (getRequest $ T.unpack x)
- body <- getResponseBody req
- return $ Tape $ T.pack body
-
-wSlurp :: Expr -> Eval Expr
-wSlurp (Tape txt) = liftIO $ openURL txt
-wSlurp val = throw $ TypeMismatch "wSlurp expects a string, instead got: " val
-
-readTextFile :: T.Text -> Handle -> IO Expr
-readTextFile fileName h = do
- exists <- doesFileExist $ T.unpack fileName
- if exists
- then (TIO.hGetContents h) >>= (return . Tape)
- else throw $ ReadFileError $ T.concat [" file does not exist: ", fileName]
-
-put_ :: Expr -> Expr -> Eval Expr
-put_ (Tape file) (Tape msg) = liftIO $ wFilePut file msg
-put_ (Tape _) val = throw $ TypeMismatch "put expects string in the second argument (try using show), instead got: " val
-put_ val _ = throw $ TypeMismatch "put expects string, instead got: " val
-
-wFilePut :: T.Text -> T.Text -> IO Expr
-wFilePut fileName msg = withFile (T.unpack fileName) WriteMode go
- where go = putTextFile fileName msg
-
-putTextFile :: T.Text -> T.Text -> Handle -> IO Expr
-putTextFile fileName msg h = do
- canWrite <- hIsWritable h
- if canWrite
- then (TIO.hPutStr h msg) >> (return $ Tape msg)
- else throw $ ReadFileError $ T.concat [" file does not exist: ", fileName]
-
-binopFold :: Binary -> Expr -> [Expr] -> Eval Expr
-binopFold op farg args = case args of
- []-> throw $ NumArgs 2 args
- [a,b] -> op a b
- _ -> foldM op farg args
-
-numBool :: (Integer -> Bool) -> Expr -> Eval Expr
-numBool op (Numb x) = return $ Bool $ op x
-numBool _ x = throw $ TypeMismatch "numeric op " x
-
-numOp :: (Integer -> Integer -> Integer) -> Expr -> Expr -> Eval Expr
-numOp op (Numb x) (Numb y) = return $ Numb $ op x y
-numOp _ Nil (Numb y) = return $ Numb y
-numOp _ (Numb x) Nil = return $ Numb x
-numOp _ x (Numb _) = throw $ TypeMismatch "numeric op" x
-numOp _ (Numb _) y = throw $ TypeMismatch "numeric op" y
-numOp _ x _ = throw $ TypeMismatch "numeric op" x
-
-strOp :: (T.Text -> T.Text -> T.Text) -> Expr -> Expr -> Eval Expr
-strOp op (Tape x) (Tape y) = return $ Tape $ op x y
-strOp _ Nil (Tape y) = return $ Tape y
-strOp _ (Tape x) Nil = return $ Tape x
-strOp _ x (Tape _) = throw $ TypeMismatch "string op" x
-strOp _ (Tape _) y = throw $ TypeMismatch "string op" y
-strOp _ x _ = throw $ TypeMismatch "string op" x
-
-eqOp :: (Bool -> Bool -> Bool) -> Expr -> Expr -> Eval Expr
-eqOp op (Bool x) (Bool y) = return $ Bool $ op x y
-eqOp _ x (Bool _) = throw $ TypeMismatch "bool op" x
-eqOp _ (Bool _) y = throw $ TypeMismatch "bool op" y
-eqOp _ x _ = throw $ TypeMismatch "bool op" x
-
-numCmp :: (Integer -> Integer -> Bool) -> Expr -> Expr -> Eval Expr
-numCmp op (Numb x) (Numb y) = return . Bool $ op x y
-numCmp _ x (Numb _) = throw $ TypeMismatch "numeric op" x
-numCmp _ (Numb _) y = throw $ TypeMismatch "numeric op" y
-numCmp _ x _ = throw $ TypeMismatch "numeric op" x
-
-notOp :: Expr -> Eval Expr
-notOp (Bool True) = return $ Bool False
-notOp (Bool False) = return $ Bool True
-notOp x = throw $ TypeMismatch " not expects Bool" x
-
-eqCmd :: Expr -> Expr -> Eval Expr
-eqCmd (Atom x) (Atom y) = return . Bool $ x == y
-eqCmd (Numb x) (Numb y) = return . Bool $ x == y
-eqCmd (Tape x) (Tape y) = return . Bool $ x == y
-eqCmd (Bool x) (Bool y) = return . Bool $ x == y
-eqCmd Nil Nil = return $ Bool True
-eqCmd _ _ = return $ Bool False
-
-cons :: [Expr] -> Eval Expr
-cons [x,(List ys)] = return $ List $ x:ys
-cons [x,y] = return $ List [x,y]
-cons _ = throw $ ExpectedList "cons, in second argument"
-
-car :: [Expr] -> Eval Expr
-car [List [] ] = return Nil
-car [List (x:_)] = return x
-car [] = return Nil
-car _ = throw $ ExpectedList "car"
-
-cdr :: [Expr] -> Eval Expr
-cdr [List (_:xs)] = return $ List xs
-cdr [List []] = return Nil
-cdr [] = return Nil
-cdr _ = throw $ ExpectedList "cdr"
-
-quote :: [Expr] -> Eval Expr
-quote [List xs] = return $ List $ Atom "quote" : xs
-quote [expr] = return $ List $ Atom "quote" : [expr]
-quote args = throw $ NumArgs 1 args
diff --git a/lore/Language/Bs/Repl.hs b/lore/Language/Bs/Repl.hs
deleted file mode 100644
index 64ffaa2..0000000
--- a/lore/Language/Bs/Repl.hs
+++ /dev/null
@@ -1,33 +0,0 @@
-{-# LANGUAGE OverloadedStrings #-}
-{-# LANGUAGE NoImplicitPrelude #-}
-module Language.Bs.Repl (
-mainLoop
-) where
-
-import Control.Monad.Trans
-import Data.String
-import Data.Text as T
-import Language.Bs.Eval
-import Protolude
-import System.Console.Haskeline
-
-type Repl a = InputT IO a
-
-mainLoop :: IO ()
-mainLoop = runInputT defaultSettings repl
-
-repl :: Repl ()
-repl = do
- minput <- getInputLine "bs> "
- case minput of
- Nothing -> outputStrLn "bye."
- Just input -> (liftIO $ process input) >> repl
- --Just input -> (liftIO $ processToAST input) >> repl
-
-process :: String -> IO ()
-process str = do
- res <- safeExec $ evalText $ T.pack str
- either putStrLn return res
-
-processToAST :: String -> IO ()
-processToAST str = print $ runParseTest $ T.pack str
diff --git a/lore/Language/Bs/Test.hs b/lore/Language/Bs/Test.hs
deleted file mode 100644
index 4a40036..0000000
--- a/lore/Language/Bs/Test.hs
+++ /dev/null
@@ -1,2 +0,0 @@
--- TODO
-module Language.Bs.Test where
diff --git a/lore/Network/RemoteData.hs b/lore/Network/RemoteData.hs
deleted file mode 100644
index 2fe6557..0000000
--- a/lore/Network/RemoteData.hs
+++ /dev/null
@@ -1,31 +0,0 @@
--- | A port of Kris Jenkins' RemoteData Elm module
--- <https://github.com/krisajenkins/remotedata>.
---
-module Network.RemoteData where
-
-data RemoteData a b
- = NotAsked
- | Loading
- | Failure a
- | Success b
- deriving (Eq, Show)
-
--- TODO figure out Http.Error
--- type WebData a = RemoteData Http.Error a
-
-instance Functor (RemoteData a) where
- fmap _ NotAsked = NotAsked
- fmap _ Loading = Loading
- fmap _ (Failure a) = Failure a
- fmap f (Success a) = Success (f a)
-
-instance Applicative (RemoteData e) where
- pure = Success
- NotAsked <*> _ = NotAsked
- Loading <*> _ = Loading
- Failure a <*> _ = Failure a
- Success a <*> b = fmap a b
-
-fromEither :: Either a b -> RemoteData a b
-fromEither (Left a) = Failure a
-fromEither (Right a) = Success a
diff --git a/lore/System/Random/Shuffle.hs b/lore/System/Random/Shuffle.hs
deleted file mode 100644
index 02cd3e0..0000000
--- a/lore/System/Random/Shuffle.hs
+++ /dev/null
@@ -1,122 +0,0 @@
-{- |
-Module : System.Random.Shuffle
-Copyright : (c) 2009 Oleg Kiselyov, Manlio Perillo
-License : BSD3 (see LICENSE file)
-
-<http://okmij.org/ftp/Haskell/perfect-shuffle.txt>
-
-
-Example:
-
- import System.Random (newStdGen)
- import System.Random.Shuffle (shuffle')
-
- main = do
- rng <- newStdGen
- let xs = [1,2,3,4,5]
- print $ shuffle' xs (length xs) rng
--}
-{-# OPTIONS_GHC -funbox-strict-fields #-}
-
-module System.Random.Shuffle
- ( shuffle
- , shuffle'
- , shuffleM
- )
-where
-
-import Data.Function ( fix )
-import System.Random ( RandomGen
- , randomR
- )
-import Control.Monad ( liftM
- , liftM2
- )
-import Control.Monad.Random ( MonadRandom
- , getRandomR
- )
-
-
--- | A complete binary tree, of leaves and internal nodes.
--- Internal node: Node card l r
--- where card is the number of leaves under the node.
--- Invariant: card >=2. All internal tree nodes are always full.
-data Tree a = Leaf !a
- | Node !Int !(Tree a) !(Tree a)
- deriving Show
-
-
--- | Convert a sequence (e1...en) to a complete binary tree
-buildTree :: [a] -> Tree a
-buildTree = (fix growLevel) . (map Leaf)
- where
- growLevel _ [node] = node
- growLevel self l = self $ inner l
-
- inner [] = []
- inner [e ] = [e]
- inner (e1 : e2 : es) = e1 `seq` e2 `seq` (join e1 e2) : inner es
-
- join l@(Leaf _ ) r@(Leaf _ ) = Node 2 l r
- join l@(Node ct _ _ ) r@(Leaf _ ) = Node (ct + 1) l r
- join l@(Leaf _ ) r@(Node ct _ _) = Node (ct + 1) l r
- join l@(Node ctl _ _) r@(Node ctr _ _) = Node (ctl + ctr) l r
-
-
--- |Given a sequence (e1,...en) to shuffle, and a sequence
--- (r1,...r[n-1]) of numbers such that r[i] is an independent sample
--- from a uniform random distribution [0..n-i], compute the
--- corresponding permutation of the input sequence.
-shuffle :: [a] -> [Int] -> [a]
-shuffle elements = shuffleTree (buildTree elements)
- where
- shuffleTree (Leaf e) [] = [e]
- shuffleTree tree (r : rs) =
- let (b, rest) = extractTree r tree in b : (shuffleTree rest rs)
- shuffleTree _ _ = error "[shuffle] called with lists of different lengths"
-
- -- Extracts the n-th element from the tree and returns
- -- that element, paired with a tree with the element
- -- deleted.
- -- The function maintains the invariant of the completeness
- -- of the tree: all internal nodes are always full.
- extractTree 0 (Node _ (Leaf e) r ) = (e, r)
- extractTree 1 (Node 2 (Leaf l) (Leaf r)) = (r, Leaf l)
- extractTree n (Node c (Leaf l) r) =
- let (e, r') = extractTree (n - 1) r in (e, Node (c - 1) (Leaf l) r')
-
- extractTree n (Node n' l (Leaf e)) | n + 1 == n' = (e, l)
-
- extractTree n (Node c l@(Node cl _ _) r)
- | n < cl
- = let (e, l') = extractTree n l in (e, Node (c - 1) l' r)
- | otherwise
- = let (e, r') = extractTree (n - cl) r in (e, Node (c - 1) l r')
- extractTree _ _ = error "[extractTree] impossible"
-
--- |Given a sequence (e1,...en) to shuffle, its length, and a random
--- generator, compute the corresponding permutation of the input
--- sequence.
-shuffle' :: RandomGen gen => [a] -> Int -> gen -> [a]
-shuffle' elements len = shuffle elements . rseq len
- where
- -- The sequence (r1,...r[n-1]) of numbers such that r[i] is an
- -- independent sample from a uniform random distribution
- -- [0..n-i]
- rseq :: RandomGen gen => Int -> gen -> [Int]
- rseq n = fst . unzip . rseq' (n - 1)
- where
- rseq' :: RandomGen gen => Int -> gen -> [(Int, gen)]
- rseq' 0 _ = []
- rseq' i gen = (j, gen) : rseq' (i - 1) gen'
- where (j, gen') = randomR (0, i) gen
-
--- |shuffle' wrapped in a random monad
-shuffleM :: (MonadRandom m) => [a] -> m [a]
-shuffleM elements
- | null elements = return []
- | otherwise = liftM (shuffle elements) (rseqM (length elements - 1))
- where
- rseqM :: (MonadRandom m) => Int -> m [Int]
- rseqM 0 = return []
- rseqM i = liftM2 (:) (getRandomR (0, i)) (rseqM (i - 1))
diff --git a/lore/bild.nix b/lore/bild.nix
deleted file mode 100644
index 589fda9..0000000
--- a/lore/bild.nix
+++ /dev/null
@@ -1,56 +0,0 @@
-{
- # a common build function
- #
- # see example usage in pack/ibb.nix. this is not set in stone, obviously. we
- # should figure out how to use overlays, for one.
- #
- bild = file: { nixpkgs }:
- with nixpkgs;
- let
- pack = import file;
-
- depsToPackageSet = packageSet: deps:
- map (s: builtins.getAttr s packageSet) deps;
-
- ghc844_ = pkgs.haskell.packages.ghc844.override (oldAttrs: {
- overrides = with pkgs.haskell.lib; self: super: {
- clay = dontCheck super.clay;
- };
- });
-
- ghc = ghc844_.ghcWithPackages (hp: depsToPackageSet hp
- # we need hinotify for chip/make
- ([ "hinotify" ] ++ pack.deps.both ++ pack.deps.apex));
-
- ghcjs_ = pkgs.haskell.packages.ghcjs.override (oldAttrs: {
- overrides = with pkgs.haskell.lib; self: super: {
- clay = dontCheck super.clay;
- http-types = dontCheck super.http-types;
- tasty-quickcheck = dontCheck super.tasty-quickcheck;
- scientific = dontCheck super.scientific; # takes forever
- servant = dontCheck super.servant;
- comonad = dontCheck super.comonad;
- QuickCheck = dontCheck super.QuickCheck;
- };
- });
-
- ghcjs = ghcjs_.ghcWithPackages (hp:
- depsToPackageSet hp (pack.deps.both ++ pack.deps.aero));
-
- make = ../chip/make;
- in
- stdenv.mkDerivation {
- name = pack.name;
- version = "0";
- src = ../.;
- nativeBuildInputs = [
- ghc ghcjs
- ];
- strictDeps = true;
- buildPhase = "${ghc}/bin/runhaskell ${make} ${pack.name}";
- installPhase = ''
- mkdir -p $out/bin
- cp bild/${pack.name} $out/bin/${pack.name}
- '';
- };
-}
diff --git a/lore/core.scm b/lore/core.scm
deleted file mode 100644
index 3d411c4..0000000
--- a/lore/core.scm
+++ /dev/null
@@ -1,59 +0,0 @@
-;; standard library for bs
-
-(define (not x) (if x #f #t))
-(define (null? obj) (if (eqv? obj '()) #t #f))
-(define (list objs) objs)
-(define (identity obj) obj)
-(define (flip f) (lambda (x y) (f y x)))
-(define (curry f a) (lambda (b) (apply f (cons a (list b)))))
-(define (compose f g) (lambda (x) (f (apply g x))))
-(define zero? (curry = 0))
-(define positive? (curry < 0))
-(define negative? (curry > 0))
-(define (odd? n) (= (mod n 2) 1))
-(define (even? n) (= (mod n 2) 0))
-
-(define (foldr f end lst)
- (if (null? lst)
- end
- (f (car lst) (foldr f end (cdr lst)))))
-
-(define (foldl f acc lst)
- (if (null? lst)
- acc
- (foldl f (f acc (car lst)) (cdr lst))))
-
-(define fold foldl)
-
-(define (unfold f init pred)
- (if (pred init)
- (cons init '())
- (cons init (unfold f (f init) pred))))
-
-(define (mem* pred op)
- (lambda (acc next)
- (if (and (not acc) (pred (op next)))
- next
- acc)))
-
-(define (sum lst) (fold + 0 lst))
-(define (produce lst) (fold * 0 1 lst))
-
-(define (max nums)
- (fold (lambda (x y) (if (> x y) x y))
- (car nums) (cdr nums)))
-
-(define (min nums)
- (fold (lambda (x y) (if (< x y) x y))
- (car nums) (cdr nums)))
-
-(define (length lst) (fold (lambda (x y) (+ x 1)) 0 lst))
-(define (reverse lst) (fold (flip cons) '() lst))
-(define (memq obj lst) (fold (mem* (curry eq? obj) identity) #f lst))
-(define (memv obj lst) (fold (mem* (curry eqv? obj) identity) #f lst))
-(define (member obj lst) (fold (mem* (curry equal? obj) identity) #f lst))
-(define (assq obj alist) (fold (mem* (curry eq? obj) car) #f alist))
-(define (assv obj alist) (fold (mem* (curry eqv? obj) car) #f alist))
-(define (assoc obj alist) (fold (mem* (curry equal? obj) car) #f alist))
-(define (map f lst) (foldr (lambda (x y) (cons (f x) y)) '() lst))
-(define (filter pred lst) (foldr (lambda (x y) (if (pred x) (cons x y) y)) '() lst))
diff --git a/lore/sicp/meta.scm b/lore/sicp/meta.scm
deleted file mode 100644
index 94dc784..0000000
--- a/lore/sicp/meta.scm
+++ /dev/null
@@ -1,20 +0,0 @@
-(define (eval exp env)
- (cond
- ((self-evaluating? exp) exp)
- ((variable? exp) (lookup-variable-value exp env))
- ((quoted? exp) (text-of-quotation exp))
- ((assignment? exp) (eval-assignment exp env))
- ((definition? exp) (eval-definition exp env))
- ((if? exp) (eval-if exp env))
- ((lambda? exp)
- (make-procedure (lambda-parameters exp)
- (lambda-body exp)
- env))
- ((begin? exp)
- (eval-sequence (begin-actions exp) env))
- ((cond? exp) (eval (cond->if exp) env))
- ((application? exp)
- (apply (eval (operator exp) env)
- (list-of-values (operands exp) env)))
- (else
- (error "Unknown expression type -- EVAL" exp))))
diff --git a/lore/sicp/set.scm b/lore/sicp/set.scm
deleted file mode 100644
index 3d60c5c..0000000
--- a/lore/sicp/set.scm
+++ /dev/null
@@ -1,42 +0,0 @@
-;; A set module, based on binary trees (from sicp)
-
-(define (entry tree) (car tree))
-(define (left-branch tree) (cadr tree))
-(define (right-branch tree) (caddr tree))
-
-(define (make-tree entry left right)
- (list entry left right))
-
-(define (element-of-set? x set)
- (cond ((null? set) #f)
- ((= x (entry set)) #t)
- ((< x (entry set))
- (element-of-set? x (left-branch set)))
- ((> x (entry set))
- (element-of-set? x (right-branch set)))))
-
-(define (adjoin-set x set)
- (cond ((null? set) (make-tree x '() '()))
- ((= x (entry set)) set)
- ((< x (entry set))
- (make-tree (entry set)
- (adjoin-set x (left-branch set))
- (right-branch set)))
- ((> x (entry set))
- (make-tree (entry set)
- (left-branch set)
- (adjoin-set x (right-branch set))))))
-
-(define (intersection-set set1 set2)
- (if (or (null? set1) (null? set2))
- '()
- (let ((x1 (car set1))
- (x2 (car set2)))
- (cond ((= x1 x2)
- (cons x1
- (intersection-set (cdr set1)
- (cdr set2))))
- ((< x1 x2)
- (intersection-set (cdr set1) set2))
- ((< x2 x1)
- (intersection-set set1 (cdr set2)))))))
generated by cgit v1.2.3 (git 2.25.1) at 2024-11-01 10:26:31 +0000