Add documentation

This commit is contained in:
Joscha 2020-11-26 19:26:45 +01:00
parent d8865c49d7
commit d8ebda0fa9
2 changed files with 28 additions and 2 deletions

View file

@ -1,7 +1,10 @@
{-# LANGUAGE OverloadedStrings #-} {-# LANGUAGE OverloadedStrings #-}
-- | This module contains functions useful for displaying 'Term's.
module Props.Lambda.Display module Props.Lambda.Display
( findConstNames ( Name
, findConstNames
, makeVarNamesUnique , makeVarNamesUnique
, findVarNames , findVarNames
, displayTerm , displayTerm
@ -17,6 +20,7 @@ import qualified Data.Text as T
import Props.Lambda.Term import Props.Lambda.Term
-- | The name of a variable or a constant.
type Name = T.Text type Name = T.Text
varNames :: [Name] varNames :: [Name]
@ -38,6 +42,11 @@ makeNameUnique taken name
$ zipWith (<>) (repeat name) $ zipWith (<>) (repeat name)
$ "" : map (T.pack . show) [(2::Integer) ..] $ "" : map (T.pack . show) [(2::Integer) ..]
-- | Find names for constants that don't overlap with existing constants. Every
-- unnamed constant is assumed to be a different constant. This means that every
-- unnamed constant will be assigned a unique name.
--
-- Names for constants follow the schema @A@, @B@, ... @AA@, @AB@, ...
findConstNames :: Term e (Maybe Name) v -> Term e Name v findConstNames :: Term e (Maybe Name) v -> Term e Name v
findConstNames term = evalState (helper term) (Set.fromList $ catMaybes $ consts term) findConstNames term = evalState (helper term) (Set.fromList $ catMaybes $ consts term)
where where
@ -51,6 +60,9 @@ findConstNames term = evalState (helper term) (Set.fromList $ catMaybes $ consts
helper (App l r) = App <$> helper l <*> helper r helper (App l r) = App <$> helper l <*> helper r
helper (Ext e) = pure $ Ext e helper (Ext e) = pure $ Ext e
-- | Make names of existing variables unique. If the name is not already unique
-- in the current scope, tries to make it unique by appending a number from
-- @[2..]@.
makeVarNamesUnique :: Term e Name (Maybe Name) -> Term e Name (Maybe Name) makeVarNamesUnique :: Term e Name (Maybe Name) -> Term e Name (Maybe Name)
makeVarNamesUnique term = helper (Set.fromList $ consts term) term makeVarNamesUnique term = helper (Set.fromList $ consts term) term
where where
@ -64,6 +76,9 @@ makeVarNamesUnique term = helper (Set.fromList $ consts term) term
helper taken (App l r) = App (helper taken l) (helper taken r) helper taken (App l r) = App (helper taken l) (helper taken r)
helper _ (Ext e) = Ext e helper _ (Ext e) = Ext e
-- | Find names for unnamed variables that are unique in the current scope.
--
-- Names for variables follow the schema @a@, @b@, ..., @aa@, @ab@, ...
findVarNames :: Term e Name (Maybe Name) -> Term e Name Name findVarNames :: Term e Name (Maybe Name) -> Term e Name Name
findVarNames term = helper (Set.fromList $ consts term) term findVarNames term = helper (Set.fromList $ consts term) term
where where
@ -75,9 +90,13 @@ findVarNames term = helper (Set.fromList $ consts term) term
helper taken (App l r) = App (helper taken l) (helper taken r) helper taken (App l r) = App (helper taken l) (helper taken r)
helper _ (Ext e) = Ext e helper _ (Ext e) = Ext e
-- | Display a term using the variable and constant names provided. Does not
-- attempt to resolve name collisions.
displayTerm :: (e -> T.Text) -> Term e Name Name -> T.Text displayTerm :: (e -> T.Text) -> Term e Name Name -> T.Text
displayTerm f = dTerm f [] displayTerm f = dTerm f []
-- | Display a term. Tries to use the provided variable names where possible.
-- Resolves name collisions.
displayTerm' :: (e -> T.Text) -> Term e (Maybe Name) (Maybe Name) -> T.Text displayTerm' :: (e -> T.Text) -> Term e (Maybe Name) (Maybe Name) -> T.Text
displayTerm' f = displayTerm f . findVarNames . makeVarNamesUnique . findConstNames displayTerm' f = displayTerm f . findVarNames . makeVarNamesUnique . findConstNames

View file

@ -1,3 +1,6 @@
-- | This module contains 'Term', the base type for lambda expressions. It also
-- contains a few utility functions for operating on it.
module Props.Lambda.Term module Props.Lambda.Term
( Term(..) ( Term(..)
, vars , vars
@ -20,14 +23,16 @@ data Term e c v
| App (Term e c v) (Term e c v) | App (Term e c v) (Term e c v)
-- ^ Lambda application -- ^ Lambda application
| Ext e | Ext e
-- ^ Term extension (set @e@ to 'Void' if you don't need this) -- ^ Term extension (set @e@ to 'Data.Void' if you don't need this)
deriving (Show) deriving (Show)
-- | All of a term's variable names in order from left to right.
vars :: Term e c v -> [v] vars :: Term e c v -> [v]
vars (Lambda v t) = v : vars t vars (Lambda v t) = v : vars t
vars (App l r) = vars l <> vars r vars (App l r) = vars l <> vars r
vars _ = [] vars _ = []
-- | Map over the variable names.
mapVars :: (a -> b) -> Term e c a -> Term e c b mapVars :: (a -> b) -> Term e c a -> Term e c b
mapVars _ (Var i) = Var i mapVars _ (Var i) = Var i
mapVars _ (Const c) = Const c mapVars _ (Const c) = Const c
@ -35,12 +40,14 @@ mapVars f (Lambda a t) = Lambda (f a) (mapVars f t)
mapVars f (App l r) = App (mapVars f l) (mapVars f r) mapVars f (App l r) = App (mapVars f l) (mapVars f r)
mapVars _ (Ext e) = Ext e mapVars _ (Ext e) = Ext e
-- | All of a term's constant names in order from left to right.
consts :: Term e c v -> [c] consts :: Term e c v -> [c]
consts (Const c) = [c] consts (Const c) = [c]
consts (Lambda _ t) = consts t consts (Lambda _ t) = consts t
consts (App l r) = consts l <> consts r consts (App l r) = consts l <> consts r
consts _ = [] consts _ = []
-- | Map over the constant names.
mapConsts :: (a -> b) -> Term e a v -> Term e b v mapConsts :: (a -> b) -> Term e a v -> Term e b v
mapConsts _ (Var i) = Var i mapConsts _ (Var i) = Var i
mapConsts f (Const c) = Const (f c) mapConsts f (Const c) = Const (f c)