Result for 02ECE146BE559563820F9FBECC63812A1EE2207A

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/mips-linux-ghc-8.4.4/Agda-2.5.4.1-Hn9DfijrxNi2OOIMamLJRg/Agda/Compiler/Treeless/Unused.dyn_hi
FileSize16400
MD5C3E19ADAC7EB6C0AC5DC04E518C5DC44
SHA-102ECE146BE559563820F9FBECC63812A1EE2207A
SHA-256E9BB11D3F7D875C5596082BE706DCBF245B18FADDA2400BC92D47A6A7F45FB79
SSDEEP192:UNH0qFwcvv5JlKet/fjz3qVU1hHsH+BIbaVUMaii+HIuYKADN9nggARnSqsrtqJs:UZ069ZOZiM29VA2EAS3G1T1vZ8Y8x
TLSHT1C4726469AB080512E5640D368CFE83041F7099129587FBEF02C5E5BB8D9FCDD2EA2671
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
FileSize24536388
MD5C7ED7DCA30FF65D94045695B1FF9ECD7
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.4.1-3+b1
SHA-1E90239BE6EE4B8D31ADEC7C96F22F7131ABDEA88
SHA-256C74974CA221D528A44FB1104AFC7E8B11BC9EC8D5AB49EA9C7E70C133D1035CB