Result for 0027589D66C515DC41F6F15AF17DFD8C1EBA80C7

Query result

Key Value
FileName./usr/share/doc/libghc6-agda-doc/html/Agda-TypeChecking-Rules-Builtin.html
FileSize21014
MD5AC5F53B1C5A2433B63CC5D2B2DD42386
SHA-10027589D66C515DC41F6F15AF17DFD8C1EBA80C7
SHA-2560053F9B90942F0DDDADBBDFC452B360881B10D35754C838C2216830F37D62339
SSDEEP192:HlIS8d4j4tf3P2OCwDLtFwCCO42zEKjy0x57CdDlCF4SvCHv8X:Hld8dga2w2Q7JkkX
TLSHT19D924ADC6302D06BAD617912E0EED2296D10127E77D2A51F355C481E4EEA63E207FF2E
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