Result for 01628EA683EE2574058555FC41715995506D3C88

Query result

Key Value
FileName./usr/lib/ghc-7.4.2/Agda-2.3.0.1/Agda/Syntax/Abstract.hi
FileSize191896
MD5E0DE12D4B9B675BA26D400A5E336C349
SHA-101628EA683EE2574058555FC41715995506D3C88
SHA-256C059DE7D1B9FEC25A4D3F9980F5D1A239D398EE622EB21F2C710FD74A65097FC
SSDEEP3072:hETlHmKogQp5zgczQEZs+JVYTvqVs+B1Y7XDKB2LVWhNX05d429CmoZ7S8QR:6tmKmp5zgczQX+Jv1Y7XDKB2LVWhNX0z
TLSHT1AE14418BAF0DD716DC79023AD4FB63003761DDA6AE5DD3A7925C2E24BD430E02C92D99
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
MD5C12A55767465D3B04B4396999D057B1A
PackageArchppc
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.
PackageMaintainerKoji
PackageNameghc-Agda-devel
PackageRelease9.fc19
PackageVersion2.3.0.1
SHA-18F7055A3BAF89B4A535A2A8B4B3FD5310D187E02
SHA-25627FE8FAC2862BF485DBDD55F4D07BF1152D03E1A7F79F031300C82385E90B9E4