Result for 01E65B359255F6544973FC615AD32A73ECEFF339

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/s390x-linux-ghc-8.2.2/Agda-2.5.3-AlW5zQ5MUdtJ9ZrXwUqf3K/Agda/Compiler/Treeless/EliminateDefaults.hi
FileSize12631
MD5022FCDA7BC36502CA5C02192252A4623
SHA-101E65B359255F6544973FC615AD32A73ECEFF339
SHA-25652AB8F8F989EF844A7B9BADAEB5D7BB08F050D8FBDBC75FB81D34E8B4B0E5AC4
SSDEEP192:eBECFyXVFoH5FJWPEBFrArSi/2twXo+HIuYKADN9nggARnSqsrtqJ6WjS0nk/Hu0:lXnoH8PEBFq2t4zMvd/W2E0SoA111A
TLSHT1014274B8260C1975FAA10D771CFEC7016E902A23C593EBEF01D6D1E3194DC9E2DA2A71
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
FileSize24612788
MD5823CC46D912D0B2C62CADF6A5E30E3E3
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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-agda-dev
PackageSectionhaskell
PackageVersion2.5.3-5build3
SHA-1545CF3CAC12DD4DE2F4502328C2F4B06E19E42B9
SHA-256242484B1F8194729D4CEC98C90B0746D4F34DC1A90C80164DF94384E2E1E1431