Result for CF6F19EE6818CEF500108E3FB680E270F56A95DE

Query result

Key Value
FileName./usr/share/doc/libghc-agda-dev/buildinfo_amd64.gz
FileSize6893
MD52994C4818E35A4DC5D7C6FEE24656756
SHA-1CF6F19EE6818CEF500108E3FB680E270F56A95DE
SHA-2562432F76FE1350A55FED954E8CF6FC80CC7546BD11A168CB68FE3EFC8F5F68101
SSDEEP96:BYtZPpXS1Zk+VFOXOG1t3IlRI8MektGIW6qf7OlJ2foDWnzJrhTxxXCuCEP7LBce:6tZPOVFEOWtY4Rtbqf6Tjibntr/C7Xa
TLSHT1D6E1AF61E07C4AFE6ACC84E154FA90C62BB441F7D9C8B5005CDB8389ABC3913255ED59
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
FileSize7751992
MD55F8D9A83270B77FDE6510D2860D08F5A
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.2.2-1.1
SHA-12B8828FDBE83625C84C4AF70EC9E8AA476851B56
SHA-2568E4C39FD316F8B91800BEA9B4AC580FACC23C83030662C928031F1A9C2634466
Key Value
FileSize24853036
MD5A827C1F62CB35F810525E042DA8A4B4E
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.2.2-1.1
SHA-19C7642EEE4646AA11A4215B9C6249C43E53C882A
SHA-2563B1E6380DC53A3CF5F628F3A537AF8BE654E881A1F7C4409E108A59ED7E2C360