Result for 033118D8BE4FFE28D50567FCEA16942601E26357

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/aarch64-linux-ghc-8.0.2/Agda-2.5.3-3uWTit9Gy0pFt60EMl2f8Z/Agda/Termination/TermCheck.hi
FileSize67289
MD5E4063B9A54651F9235786CF4A5BED5BF
SHA-1033118D8BE4FFE28D50567FCEA16942601E26357
SHA-256285C65D8CE4E0C32959A77661957BAF7CC1DCE1D04334A63120FB548D5A4509F
SSDEEP1536:9z1C+l+AgzMVCDRTDpJgNZVjOTBLiIosv3vrdH7a86dqoM6MBVB3lmIbnoywVGth:9z1PVgzMVCDRTDpJgNZVjOTBLiIosv37
TLSHT1BD638054FF45C727DC761B32CCF91308B730EAC126526FAB218820756EB66F81DB6269
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