Result for 03AB4843DB55D049C34DFD4FFD05E0D3BB536356

Query result

Key Value
FileName./usr/share/doc/libghc-agda-doc/html/Agda-Utils-Trie.html
FileSize4938
MD57BF70863C3B5F8D5E4F7D5D33AB664AC
SHA-103AB4843DB55D049C34DFD4FFD05E0D3BB536356
SHA-25606D6665225D60C5FD6D91A2F51703D7F513D5635D77F1901E969C1B165EFC4B7
SSDEEP96:JG/Xbn7aEIw5q83TmRyRrRBqAGm2y7fWLY4R0URFFIRp98dr:J6faEIMROmlBqAp22fWY400FFop9ur
TLSHT1B0A1449143A4E7BA56125DEEBDE43A1EF8C312D9D0008D0E307846CBDBD9FA519152BB
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
FileSize1768608
MD5855F66578A04BF51EE362483E2D1E5D0
PackageDescriptiondependently typed functional programming language - documentation 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 contains the documentation files.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-agda-doc
PackageSectiondoc
PackageVersion2.3.0.1-2build1
SHA-1945FBDE44DA46714AA1EB5599D39874BFB5646FE
SHA-25665179A83A1D0EE63FCBA80078F27043533A6BE6E6D7553095A55A5F7080B1C82