  
  
     [1X[5XHap Programming[105X – An experimental framework for objectifying the data
                               structures of Hap[101X
  
  
                     ( development version of 10.02.2020 )
  
  
                                   Marc Röder
  
  
  
  Marc Röder
      Email:    [7Xmailto:marc.roeder(at)nuigalway.ie[107X
  
  
  Address: [33X[0;9YMarc Röder, Department of Mathematics, NUI Galway, Irleland[133X
  
  
  -------------------------------------------------------
  [1XAbstract[101X
  [33X[0;0YThis   extension  does  not  change  the  behaviour  of  Hap  and  is  fully
  backwards-compatible. It is not a part of Hap and there is no guarantee that
  it will at any point be supported by Hap. Use at your own risk.[133X
  
  
  -------------------------------------------------------
  [1XCopyright[101X
  [33X[0;0Y© 2007 Marc Röder.[133X
  
  [33X[0;0YThis  package  is  distributed  under  the  terms  of the GNU General Public
  License  version  2  or later (at your convenience). See the file [11XLICENSE[111X or
  [7Xhttps://www.gnu.org/copyleft/gpl.html[107X[133X
  
  
  -------------------------------------------------------
  [1XAcknowledgements[101X
  [33X[0;0YThis work was supported by Marie Curie Grant No. MTKD-CT-2006-042685[133X
  
  
  -------------------------------------------------------
  
  
  [1XContents (HAPprog)[101X
  
  1 [33X[0;0YResolutions in Hap[133X
    1.1 [33X[0;0YThe Standard Representation [9XHapResolutionRep[109X[133X
    1.2 [33X[0;0YThe [9XHapLargeGroupResolutionRep[109X Representation[133X
  2 [33X[0;0YAccessing and Manipulating Resolutions[133X
    2.1 [33X[0;0YRepresentation-Independent Access Methods[133X
      2.1-1 StrongestValidRepresentationForLetter
      2.1-2 StrongestValidRepresentationForWord
      2.1-3 PositionInGroupOfResolution
      2.1-4 IsValidGroupInt
      2.1-5 GroupElementFromPosition
      2.1-6 MultiplyGroupElts
      2.1-7 MultiplyFreeZGLetterWithGroupElt
      2.1-8 MultiplyFreeZGWordWithGroupElt
      2.1-9 BoundaryOfFreeZGLetter
      2.1-10 BoundaryOfFreeZGWord
    2.2 [33X[0;0YConverting Between Representations[133X
      2.2-1 ConvertStandardLetter
      2.2-2 ConvertStandardWord
      2.2-3 ConvertLetterToStandardRep
      2.2-4 ConvertWordToStandardRep
    2.3 [33X[0;0YSpecial Methods for [9XHapResolutionRep[109X[133X
      2.3-1 IsFreeZGLetter
      2.3-2 IsFreeZGWord
      2.3-3 MultiplyGroupEltsNC
      2.3-4 MultiplyFreeZGLetterWithGroupEltNC
      2.3-5 MultiplyFreeZGWordWithGroupEltNC
      2.3-6 BoundaryOfFreeZGLetterNC
      2.3-7 BoundaryOfFreeZGWordNC
    2.4 [33X[0;0YThe [9XHapLargeGroupResolutionRep[109X Representation[133X
      2.4-1 GroupRingOfResolution
      2.4-2 MultiplyGroupElts_LargeGroupRep
      2.4-3 IsFreeZGLetterNoTermCheck_LargeGroupRep
      2.4-4 IsFreeZGWordNoTermCheck_LargeGroupRep
      2.4-5 IsFreeZGLetter_LargeGroupRep
      2.4-6 IsFreeZGWord_LargeGroupRep
      2.4-7 MultiplyFreeZGLetterWithGroupElt_LargeGroupRep
      2.4-8 MultiplyFreeZGWordWithGroupElt_LargeGroupRep
      2.4-9 GeneratorsOfModuleOfResolution_LargeGroupRep
      2.4-10 BoundaryOfGenerator_LargeGroupRep
      2.4-11 BoundaryOfFreeZGLetterNC_LargeGroupRep
      2.4-12 BoundaryOfFreeZGWord_LargeGroupRep
  3 [33X[0;0YContracting Homotopies[133X
    3.1 [33X[0;0YThe [9XPartialContractingHomotopy[109X Data Type[133X
      3.1-1 ResolutionOfContractingHomotopy
      3.1-2 PartialContractingHomotopyLookup
  
  
  [32X
