idris-1.3.4: Functional Programming Language with Dependent Types

License | BSD3
Maintainer | The Idris Community.
Safe Haskell | None
Language | Haskell2010

IRTS.JavaScript.LangTransforms

Contents

- Orphan instances

Description

# Documentation

removeDeadCode :: Map Name LDecl -> [Name] -> Map Name LDecl #

globlToCon :: Map Name LDecl -> Map Name LDecl #

# Orphan instances

Data FDesc # |
Instance details Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FDesc -> c FDesc # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FDesc # toConstr :: FDesc -> Constr # dataTypeOf :: FDesc -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c FDesc) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FDesc) # gmapT :: (forall b. Data b => b -> b) -> FDesc -> FDesc # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FDesc -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FDesc -> r # gmapQ :: (forall d. Data d => d -> u) -> FDesc -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> FDesc -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> FDesc -> m FDesc # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FDesc -> m FDesc # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FDesc -> m FDesc #
Data LDecl # |
Instance details Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> LDecl -> c LDecl # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c LDecl # toConstr :: LDecl -> Constr # dataTypeOf :: LDecl -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c LDecl) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c LDecl) # gmapT :: (forall b. Data b => b -> b) -> LDecl -> LDecl # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> LDecl -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> LDecl -> r # gmapQ :: (forall d. Data d => d -> u) -> LDecl -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> LDecl -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> LDecl -> m LDecl # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> LDecl -> m LDecl # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> LDecl -> m LDecl #
Data LExp # |
Instance details Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> LExp -> c LExp # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c LExp # toConstr :: LExp -> Constr # dataTypeOf :: LExp -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c LExp) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c LExp) # gmapT :: (forall b. Data b => b -> b) -> LExp -> LExp # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> LExp -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> LExp -> r # gmapQ :: (forall d. Data d => d -> u) -> LExp -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> LExp -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> LExp -> m LExp # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> LExp -> m LExp # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> LExp -> m LExp #
Data LOpt # |
Instance details Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> LOpt -> c LOpt # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c LOpt # toConstr :: LOpt -> Constr # dataTypeOf :: LOpt -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c LOpt) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c LOpt) # gmapT :: (forall b. Data b => b -> b) -> LOpt -> LOpt # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> LOpt -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> LOpt -> r # gmapQ :: (forall d. Data d => d -> u) -> LOpt -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> LOpt -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> LOpt -> m LOpt # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> LOpt -> m LOpt # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> LOpt -> m LOpt #
Data LVar # |
Instance details Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> LVar -> c LVar # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c LVar # toConstr :: LVar -> Constr # dataTypeOf :: LVar -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c LVar) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c LVar) # gmapT :: (forall b. Data b => b -> b) -> LVar -> LVar # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> LVar -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> LVar -> r # gmapQ :: (forall d. Data d => d -> u) -> LVar -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> LVar -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> LVar -> m LVar # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> LVar -> m LVar # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> LVar -> m LVar #
Data PrimFn # |
Instance details Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> PrimFn -> c PrimFn # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c PrimFn # toConstr :: PrimFn -> Constr # dataTypeOf :: PrimFn -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c PrimFn) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c PrimFn) # gmapT :: (forall b. Data b => b -> b) -> PrimFn -> PrimFn # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> PrimFn -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> PrimFn -> r # gmapQ :: (forall d. Data d => d -> u) -> PrimFn -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> PrimFn -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> PrimFn -> m PrimFn # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> PrimFn -> m PrimFn # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> PrimFn -> m PrimFn #
Data CaseType # |
Instance details Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CaseType -> c CaseType # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c CaseType # toConstr :: CaseType -> Constr # dataTypeOf :: CaseType -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c CaseType) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c CaseType) # gmapT :: (forall b. Data b => b -> b) -> CaseType -> CaseType # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CaseType -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CaseType -> r # gmapQ :: (forall d. Data d => d -> u) -> CaseType -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> CaseType -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> CaseType -> m CaseType # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CaseType -> m CaseType # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CaseType -> m CaseType #