Result for 005EFFC9680B20EF7DFF42F3024181F380905605

Query result

Key Value
FileName./usr/share/doc/libghc-agda-doc/html/Agda-Termination-CallGraph.html
FileSize24276
MD570691FC20329CF036A361831F0A2CFBD
SHA-1005EFFC9680B20EF7DFF42F3024181F380905605
SHA-256B15990FEDE8B4F86294A8AAE542BE89D2FACBC8DA3D593DD3195989C625D46D0
SSDEEP384:dmq+TcTMMRAfKHI23+jycbpWUT8T2YwTNwT/TlTra8kPRwaU2aWJ4H:6YjR2Ko23+jycbpWUQHwRw7pXa8k42aV
TLSHT1E9B266E1DBD5537A57A207FBA2ED275EB6A325E4C583CD0C75F4086ACF08BA06823057
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