Result for 01AAB258628F46C3B32B1E6611DA76D53AEE3AA4

Query result

Key Value
FileName./usr/share/doc/libghc-agda-doc/html/doc-index-47.html
FileSize3236
MD59C297529E18A9E8EC7D2A755AAADCF81
SHA-101AAB258628F46C3B32B1E6611DA76D53AEE3AA4
SHA-2563FB743E892AC2E303A0F4C47D051DA2DAFFD3D1CBF3597908D4C226AA6E6E63C
SSDEEP48:Im3+MGQPZNV4xlX8GiDpsLYdyklZ6cscJyk0HEk8s8s0kU08s8ZCEyKd3llIAQwd:wFQPS/XVXYpjLFP/T87uT
TLSHT16D61D90A2DCC20278375164CDDD17B1814434EF25B760D87A48DFC4ADEAA7597D0EA8F
hashlookup:parent-total2
hashlookup:trust60

Network graph view

Parents (Total: 2)

The searched file hash is included in 2 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
FileSize3790832
MD5F91E27638ADFAC07F36B75EF43E2AD77
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.4.1-3
SHA-1CFA809ED154BA36CE32ECEEFA27B1579855797E4
SHA-256BF5A30361046262E826B991143BEEFA20C863D169C5C05D711C6894CC1D4756C
Key Value
FileSize3667124
MD5413E8F4B8751EFCA3E60911F0C64A2F9
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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-agda-doc
PackageSectiondoc
PackageVersion2.5.4.1-3
SHA-1D7AF9F8ABE0CEF79AFB82699E78A5869915B108C
SHA-256079268DF53F5A357E78E144E0817636A5E97CCD3323EC3DDD0F8CD32BF78AEC2