UMinho Haskell Libraries (1.0) Contents Index

Language.Haskell.FreeNames Portability portable Stability experimental Maintainer joost.visser@di.uminho.pt

Description

This module implements free name analysis for Haskell. Under construction!!! We are not yet faithfully dealing with qualified vs. unqualified names. Same holds for module level analysis.

Synopsis

hsFreeAndDeclared :: (Term t, MonadPlus m) => t -> m ([HsQName], [HsQName]) hsFreeAndDeclaredList :: (Term t, MonadPlus m) => [t] -> m ([HsQName], [HsQName])

Documentation

hsFreeAndDeclared :: (Term t, MonadPlus m) => t -> m ([HsQName], [HsQName])

Extract free and declared names from a syntactic entity. This is the main function of the analysis. We use the stop_td scheme. We define ad hoc cases for several syntactical domains. Ad hoc cases are meant to restart recursion.

hsFreeAndDeclaredList :: (Term t, MonadPlus m) => [t] -> m ([HsQName], [HsQName])

Extract free and declared names from a list of syntactic entities.

Produced by Haddock version 0.6