Result for 00B31DBDFAE47C727428C79E4C86DAD7762D7F1D

Query result

Key Value
FileName./usr/share/doc/libghc6-agda-doc/html/mini_Agda-Syntax-Concrete-Name.html
FileSize2689
MD57B295933D89CC9CB40102069FEE5A5A2
SHA-100B31DBDFAE47C727428C79E4C86DAD7762D7F1D
SHA-25683F4B26FC032B8689F0E22179C720F0A88016BA3762002643E993FF2AFB1018A
SSDEEP48:HAz+IQIQaRzTz1ztzNzttzPzHz6fzzJzlVz3z1zsnzps:HlBa9npBhL7TsHVlJDpszps
TLSHT152517C3E27D7B05B89536A89F8C3A02B240063845656DCCE740DD486E9FE3A6B89D437
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
FileSize971158
MD51C6BD1E99096089743241858D11A96B6
PackageDescriptiona dependently 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>
PackageNamehaskell-agda-doc
PackageSectiondoc
PackageVersion2.2.4+dfsg-1
SHA-19EDA39FF64C02CAF908F080DAE8D661F33E22EDC
SHA-2563FB480E865E115684999937BE25CBEFE239BC01FC18B86039FED02AC0AE237B6