Result for 01C1830BF0CC2C3D59568E737D1E2A5B25FABF98

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/Compiler/JS/Case.dyn_hi
FileSize25113
MD5A0C2BE14758508A2412A6ADE64CDBAF2
SHA-101C1830BF0CC2C3D59568E737D1E2A5B25FABF98
SHA-256A5AC10E66D9161EE5301EE9BC126618E79E14AA1B713974BBD60032E4C8A25A9
SSDEEP384:Ok2c2BLArVteF4zygdQQGz41p6+Lc3g02FVjUYD3P/f6fJepjF6a9c:X2c2tye6841pRLKb2FV7fSkpjF6a9c
TLSHT1D1B20B12EF44D226D9394BB588BA03427B38EED22B42DBA751017131ECF75D46EF216E
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