Result for 019DA0540BC0D24FCF43EBC9FEE8687A3A5FEC39

Query result

Key Value
FileName./usr/lib/ghc-7.4.2/Agda-2.3.0.1/Agda/TypeChecking/Rebind.hi
FileSize6009
MD5E09E356DD233F87BA2F109D841B92C28
SHA-1019DA0540BC0D24FCF43EBC9FEE8687A3A5FEC39
SHA-256A7E92A9E5D43906106C86453E145BF9680AED64A54716A51864D98ED85E0D100
SSDEEP96:ZHO98RxEAmv/2iA7Y5znYf8ooDT2k4o6+qy+OXrtTjWwU72q/PQ6k1FlUv1cD/+b:ZHOeRxnmAP2A5+qytXrtTjWwU72q/PQo
TLSHT108C11EB8564C0975FB610E7B5CFE8B104B906A23D682DBEF11D5D2E3198DC8F5CA2934
hashlookup:parent-total1
hashlookup:trust55

Network graph view

Parents (Total: 1)

The searched file hash is included in 1 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
MD58E5776D49E0FF270CFD97428ACCC8AC8
PackageArchs390
PackageDescriptionAgda is a dependently typed functional programming language: it has inductive families, which are similar to Haskell's GADTs, but they can be indexed by values and not just types. It also has parameterized modules, mixfix operators, Unicode characters, and an interactive Emacs interface (the type checker can assist in the development of your code). Agda is also a proof assistant: It is an interactive system for writing and checking proofs. Agda is based on intuitionistic type theory, a foundational system for constructive mathematics developed by the Swedish logician Per Martin-Löf. It has many similarities with other proof assistants based on dependent types, such as Coq, Epigram and NuPRL. This package contains the development files.
PackageMaintainerFedora Project
PackageNameghc-Agda-devel
PackageRelease10.fc19
PackageVersion2.3.0.1
SHA-1026B7F2136D9A544748097B1A3B427E779E7D3FD
SHA-2561D79CB7723FF59556C02D2BB7DEC8C0A2350801EADE545D9871E0767BBE090C7