Result for 022F2C453104DA6587569BB04506BE04B5D2246D

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/powerpc64le-linux-ghc-8.2.2/Agda-2.5.3-AlW5zQ5MUdtJ9ZrXwUqf3K/Agda/Compiler/Treeless/EliminateLiteralPatterns.hi
FileSize17058
MD5430C722E5538C243678EC3F9E221FD1D
SHA-1022F2C453104DA6587569BB04506BE04B5D2246D
SHA-2567472081B2246471DC14A25510CAEE966553C6F3CF17AC058E50017E74456E0C3
SSDEEP192:gBECpY5AVAWPE92fR1aTVrSi/2twXo+HIuYKADN9nggARnSqsrtqJ6WjS0nk/HuF:/EPEkpm2t4zMvd/W2E0SoA1a1eeyYan
TLSHT13B72B868AF080522F9540D7B8CFEC3017B605A5296C3FBDF01D5D1BB49AEE8E1EA2535
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
FileSize23272728
MD5573B20B65476C87A6C6AB32D81FB3B60
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-13C714C256B82E2E57CC9BAA2F02E3EA17C29277A
SHA-256790906BEECD1F9D726AC31AB6BB1279BBC6A9DAFD12CADE01664D1EA500E3EFC