Result for 013AC21B0038169DABF450F956253210B7A2939C

Query result

Key Value
FileName./usr/share/doc/libghc-agda-doc/html/mini_Agda-Termination-CallGraph.html
FileSize2960
MD54E842C0E21953000CBCD65FB0AEEE1BD
SHA-1013AC21B0038169DABF450F956253210B7A2939C
SHA-256A12773BC48CC97ACDA543B6CCFD53EE909B11A6CFB82FA5FFC50F71C3B274035
SSDEEP48:Im3ygT2CZsN6qsN63J7BD64BD6PBD6oBD6L0BD6IBD6PWS6fJRBD6LeBD64BD6Iw:xT5ZEttH63vnyWp3t3Hn3MyfL8
TLSHT1D351E7BADBE5A77341134AFEB2FAA35D24B341C8C9438D4CB5E409E2CF84FA19513156
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
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
Key Value
FileSize2560524
MD5ED8E86F6F51166DE833001A669E04E91
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.1.1-3build3
SHA-18DA9B0B324035E87F03FBEF2F3769FE8360EDCAC
SHA-2564FCD524D0ECAB93960C5E8032F33BCAAAF344739028DDECC76D37C1DB754E7B1