Result for 02FFE83BBD01BE8075A72D55D42DE5ABB967A996

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/aarch64-linux-ghc-8.0.2/Agda-2.5.3-3uWTit9Gy0pFt60EMl2f8Z/Agda/Syntax/Abstract.dyn_hi
FileSize692693
MD54EC635C1E5A717D626B3E7F9C4E884B0
SHA-102FFE83BBD01BE8075A72D55D42DE5ABB967A996
SHA-256E055DB3233F03F8D22E3036A89CB8D8F55DF524BA7601FE17DBC5BA299504821
SSDEEP3072:cJq6dKtHdh3rIINuzFaNZvljh2xJnlW4IKx6RFYhTsYaIEcUXne84sFcSo1R6pbn:JXenc4D6RFYDhwXncAjw3Q
TLSHT1BFE46812BF8BD317E42A8731C8F9830C7B29D9D526628B1F51843179E8716EC3DB169E
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