github/semantic
1
1
Fork 0
mirror of https://github.com/github/semantic.git synced 2024-12-22 22:31:36 +03:00
Code Issues Projects Releases Wiki Activity

Add anamorphism example showing how to construct terms from strings

Browse Source
This commit is contained in:
Rick Winfrey 2016-11-17 17:26:32 -06:00
parent c093eb6838
commit 90ba2a73ab
1 changed files with 12 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
src/FDoc/RecursionSchemes.hs
View File

@ -46,3 +46,15 @@ indexedTermCata :: [leaf] -> Term (Syntax leaf) (Record '[NewField, Range, Categ
indexedTermCata childrenLeaves = cata algebra (indexedTerm childrenLeaves)
where
algebra term = cofree $ (NewField .: (headF term)) :< (tailF term)
{-
Anamorphism -- construct a Term from a string
The example below shows how to build up a recursive Term structure from a string representation.
-}
stringToTermAna :: String -> Term (Syntax String) (Record '[Range, Category])
stringToTermAna = ana coalgebra
where
coalgebra representation = case representation of
"indexed" -> (Range 1 10 .: Category.MethodCall .: RNil) :< Indexed ["leaf"]
_ -> (Range 1 10 .: Category.MethodCall .: RNil) :< Leaf representation