Result for 7E0BA49BCE8025BC42773CAD0182FCB3205C56A1

Query result

Key Value
FileName./usr/share/doc/libghc-agda-dev/buildinfo_amd64.gz
FileSize5848
MD57B1B847CF75B2AE2A246B666EE9DA5E2
SHA-17E0BA49BCE8025BC42773CAD0182FCB3205C56A1
SHA-256E2C4A8025F702E8CEE3E469DA151C7E65E010003D21A78587DA6DF73254D6CC7
SSDEEP96:So84VmQ55qS1ufkYGgRbkXs3D/AkMKtRVuuejeLThdbF0r1TnH7ledSxHUKaGBjv:SoppgxfIcskMWu9yfoZbcPw
TLSHT1B4C18D86C6100BCA5BCD11D67A213F4C828A492E9E91DC55D8DFECCC9908E2D591BF9F
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
FileSize8910056
MD5A88B7B8E76D241D4543F73BD7D5972E8
PackageDescriptioncommandline interface to Agda 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 a command-line program for type-checking and compiling Agda programs. The program can also generate hyperlinked, highlighted HTML files from Agda sources.
PackageMaintainerDebian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageNameagda-bin
PackageSectionhaskell
PackageVersion2.6.1-1+b2
SHA-139B6B6588BFEE7A7D7D391817A95556F13E5EDFD
SHA-25601EB3C14E58B10373A8D45962340B075E403FB4030B0BEFD937D3012193E2048
Key Value
FileSize37948252
MD5F39B526CB4CEBB6C3AD152E078B4139F
PackageDescriptiondependently typed functional programming language 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 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-dev
PackageSectionhaskell
PackageVersion2.6.1-1+b2
SHA-1D7447BAD0811553403E34173EEAFB164FC714455
SHA-2563189CC3FD18E820BA8BC5D4A9CE7207185BF0F590571BA2767CDDC2FF7C15B09