Result for 0574B0274F96F6901BA2925E33F461CCED419B32

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/MAlonzo/Coerce.dyn_hi
FileSize11195
MD5A4E511925C42595E82FDC9CA8C792A6E
SHA-10574B0274F96F6901BA2925E33F461CCED419B32
SHA-25623C0037F37B937541D5ED49AEF5A71B123DE79F8DC35CE469C0D9EE0EA11DB4D
SSDEEP192:VAcbaG+OJ8Mp8+v7aeWVUjautwXBi+HIuYKADN9nggARnSqsrtqJ6WjS0/Gxlm+7:VJP+vli7aVut4jM2HVA2EAS3G1R1S
TLSHT19B3252BD560C1964FAA10D3B4CFEC7101EA066238597EFEF01D6D1E31A4DC9E2DA2A71
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
FileSize23023192
MD592A24CBABB78CAB420F02B14BB046E4C
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-1099FC7830E1537A9B08EEFE27E259043438C6127
SHA-25625E55478C0CC4FA673E162BC97869AB3D56F04837DBD8C79D02D0C4C46E88BDF