Result for 021C3C4D534A14FA2DC72C75E43A5B40868E8D8B

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/aarch64-linux-ghc-8.0.2/Agda-2.5.3-3uWTit9Gy0pFt60EMl2f8Z/Agda/TypeChecking/SizedTypes/Utils.dyn_hi
FileSize7814
MD5E6C6F9B54A70AB7AF5D27AB7EBE31B1C
SHA-1021C3C4D534A14FA2DC72C75E43A5B40868E8D8B
SHA-2566CF2BC818CCAC92127F9F28D9B918F62320936C1D414C99470EA61160649E81E
SSDEEP192:tjbs2IYRXuX4hMqpkhnsAwSXSxWrBlct0VRgTQGyn5AR:RY2HM4hMqpujwSXSxMBlkKR5AR
TLSHT1B9F1446ABFC6E23AE63E8775C0B64301B734DA412222DF87509D6134CCA33C96F6915E
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
FileSize23942348
MD5F4C41E1F4A2550E2CF0C257ABCFFA546
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.3-3+b1
SHA-17490314056012763DAEC8EE67BA32D325F5A563B
SHA-25637DFA5E80432153BA61F888650806096494EB15F3B99287A7B3042F6EB6487F2