Result for 02B9EAFDF2DED29224B4CE4B0F811428D5FC4CA8

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-8.0.1/Agda-2.5.1.1-D7i3toi3ly1FEjQkWaRq05/Agda/Utils/PartialOrd.dyn_hi
FileSize110189
MD5746C11454545BE3FC8AAA69F00041153
SHA-102B9EAFDF2DED29224B4CE4B0F811428D5FC4CA8
SHA-2569C23C6918D131B9DA4109A83959DD0924EB81198D9335162D4502A0AE99A32D1
SSDEEP3072:wzqe587unPIzZPs0nAKHPhUEZATHmM+1dMnmXUbKnlsyYnHB6vYJVWR2l83KVIjN:wVgzZPs0nAKHPhUEZATHmM+1dMnTKnlr
TLSHT16CB3E926BF96D716D8344BF584F65388B730ECD11A5A4B572208B834FE772E02EB21D9
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
FileSize12846156
MD54640039F72F1C3461064962C532B9993
PackageDescriptiondependently typed functional programming language Agda is a dependently typed functional programming language: It has inductive families, which are like Haskell's GADTs, but they can be indexed by values and not just types. It also has parameterised 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 provides a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainerDebian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageNamelibghc-agda-dev
PackageSectionhaskell
PackageVersion2.5.1.1-3+b3
SHA-15141EC53567DB02993DAC92C07F8546C2732EA3C
SHA-2564E8326CB810323B59ED8FCD0EB7E7FA5010A1050DD246192F5EC2617E2A32369