Result for 00AD2AD63ECC20A683DCE6B19276AE24F859F19C

Query result

Key Value
FileName./usr/share/doc/libghc-agda-doc/html/Agda-Termination-TermCheck.html
FileSize4025
MD5C2C67FFAA378E90432A66997D1028E45
SHA-100AD2AD63ECC20A683DCE6B19276AE24F859F19C
SHA-2567ACD24B50DAD6031E8F4C4E0D3896108CC22462F00C2BD415395EFBE46DC1AD0
SSDEEP48:Im30S44GE4V4xlX7Gio7qB2w5q8gAM0L+749M+iFS9O6L+7434woag7sn+MR4TAQ:X/X6n7qEw5q8x6J+AJ66kbiC+MIHuxsH
TLSHT1648100E15BD12277A2A30AD6E5F47B2D71A785E5C2424C0C34F814A7CF89FE4A6431EA
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
FileSize2649336
MD52E01F07A198753A99486B11BB50F8A06
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 provides the documentation for 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-doc
PackageSectiondoc
PackageVersion2.5.1.1-3
SHA-11FD4076A51ECB6E75E00CE184F0E007C8A2B2EF2
SHA-256A24383CF8D920131892A0FA5E17F38945E5C29CBBDDDAC33540280DA03AC8441