Result for 027B611569D3AFE4D6B6F0A45F9AC9AA57ABE8CF

Query result

Key Value
FileName./usr/share/doc/libghc-agda-doc/html/Agda-TypeChecking-Rules-LHS.html
FileSize17089
MD568C89B093750164920D6ED1647E3062F
SHA-1027B611569D3AFE4D6B6F0A45F9AC9AA57ABE8CF
SHA-256713699FB92468FC245A91E4B581F718D0A244405726DCAC61CFD0A48ED228D84
SSDEEP384:3fa0MR4fxETReKTHjVvvlm2STQtuKHVEnXkTQ3Dr:yR4fxEAKHVXlm2ScsKenXkc3Dr
TLSHT18A721FF1ABC5713A63B31E8A9AC03A5D718302F5C5514D0E71B98AD7CF9AF2034B6587
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