Result for 2B1E8080DB98BD7C499BE51E9F2419D2D076D1BB

Query result

Key Value
FileName./usr/share/doc/libghc-agda-dev/buildinfo_amd64.gz
FileSize5592
MD5015A7A27B5B248E88C8AF63CB37F7670
SHA-12B1E8080DB98BD7C499BE51E9F2419D2D076D1BB
SHA-2569684F87EB5701954FFE14E7BC49BFEE034867F53B3B557D1935B336B7909A463
SSDEEP96:ZbdC0ZLpbvEdO/qf7BqrPjhAL9VRaeL95xxjaB1g0yA8YBJsMq8M7sOBtMJ:Z0GNbguqTcrPF0haSj+/gzKgMq8MPBtG
TLSHT15BB17E0917AEDFAF67750B3109274F6066024E7C0764C81244AB9523A5FC69FE2146EF
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
FileSize15998028
MD585495FB799D3EE6ECB4432B51585113E
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.5.3-3+b1
SHA-18E529DD5CA98D68D355B399D9E0708E0A887A2D7
SHA-256F2FBF1ECA54F75036D32747A1727635DDE05061205378BA0F40505CB7E59F8E1
Key Value
FileSize5818604
MD56399615017C21809EDBBD9CE9D38A67F
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.5.3-3+b1
SHA-10D58737DAF0DA85268400FF607DF751CCF2A6F9D
SHA-256C02902F3791320C20BF1CBDA20702A58886F7F5C665774731D5CCA5C6E996C4A