Result for 04AD8CF82EF2DF4F4FC7CD3AC022416C6B62272D

Query result

Key Value
FileName./usr/share/doc/libghc-agda-doc/html/Agda-Termination-Monad.html
FileSize138309
MD5B8FA28564E19B053AD3A58BDBB8093E4
SHA-104AD8CF82EF2DF4F4FC7CD3AC022416C6B62272D
SHA-256BCB1EEA273C58302F0E40FEEF1F46840FA7783CC6B4F41847C0F963E0E2259D3
SSDEEP768:rNHaH/pUnXv1zIkE76zR3ausEaO/i/lyKFqcBDIeM7eYVFtZvrasPfHgEXtGR/7U:wUOuna3WT
TLSHT170D3A9E32BD1173ED6620BAB56F8A76EB15359D4D1806D4C70E0B8A3CF49FB590234B2
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