Result for 003B912D2F14BE9A12FEF41578A323E673A8BF32

Query result

Key Value
FileName./usr/lib/ghc-7.4.2/Agda-2.3.0.1/Agda/Syntax/Parser/Parser.p_hi
FileSize23840
MD5E05C3749E264EC8BBC1BBCA39C0D04D7
SHA-1003B912D2F14BE9A12FEF41578A323E673A8BF32
SHA-256215B74F606E9F185D3856DFE0AB9808A269D9299E7E8589D47963DCEC7D56F30
SSDEEP384:ZTQf1AtWZdhBayX539pFzVWeUnKu1UDhsgf6OMm7/zq/ZXft5X+YQdc1/N:ZTQDZEgtXzVWlMlfLMGq/vkcRN
TLSHT190B2B4AA1F09AD70E476297BC8A317122731F2217B49EB2B658C01534CD286E7F675CF
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
MD5584B3D527B66EFB62F1A995EC4BE24FC
PackageArcharmv7hl
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-1E53510882EE52B2FD0701760B04DD766A8E5F40C
SHA-25641B425B97C7331A5E16D67F2FA54746FAC98734A95C2BBB273188D42E74E3CAB