Result for 012B1EB4B81A6D7FC605AEE01230302D2FC1D25C

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-8.0.1/Agda-2.5.1.1-D7i3toi3ly1FEjQkWaRq05/Agda/Utils/Monad.hi
FileSize20408
MD543C7407D852FB0F5340FCA07D4AF1BCF
SHA-1012B1EB4B81A6D7FC605AEE01230302D2FC1D25C
SHA-256D8EA8AA42B62ABCDA208BAF71806781F1E2C0DBF2812F95176E7A068496B44D5
SSDEEP384:BCxs2YBAlIn8OhMHNjhu2U6rXJ+N4fdRV23oU5HHWUOHiJTXGpf6fJLc/NizE78M:BCxs2gAlIn8OhMHNjhu2U6rXJ+N4fdRZ
TLSHT18492E424BB87D71AE46ACA71A4AE874DBB30EE4017259F5780153531FC36AE83D3076B
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
FileSize12846156
MD54640039F72F1C3461064962C532B9993
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.1.1-3+b3
SHA-15141EC53567DB02993DAC92C07F8546C2732EA3C
SHA-2564E8326CB810323B59ED8FCD0EB7E7FA5010A1050DD246192F5EC2617E2A32369