Result for 4E70A6ED57F0DC980F92EEEC6E6C683D71B4C4F2

Query result

Key Value
FileName./usr/share/doc/libghc-agda-dev/buildinfo_amd64.gz
FileSize5289
MD50016A1ED2F3A3290A3FEECF25DD09B0B
SHA-14E70A6ED57F0DC980F92EEEC6E6C683D71B4C4F2
SHA-25615714C665D47BE4FDEEC1D55C861CB5E4A8FDD413A3C87C68BAC1315488914F1
SSDEEP96:/J7DnjW/C1jZbnP4mWLEzAiEBcwZVgN/Qay19st+XCdpNMOnxdyNxYMnbKfoIl5O:h7DnKsjZDHT+jgtQLbst+XCdzM+xdynX
TLSHT100B17D7491139264364867F6721B161F1393DB2E8AB2B03134FDC4747AE2E941B85FF1
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
FileSize5868440
MD519C7318C4648B7046F19527104D1AA91
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.4.1-3+b1
SHA-1B7AF8C8D6D83E70F3A0DCC12043DA4A5C761D3E9
SHA-256BF1952F4615C2FE085EA169CAA2FDF540FD1C8BEFE780303F3BEA0C871A1DFF2
Key Value
FileSize17170668
MD5B72791D58BAFADE7FA35BB3768C17212
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.4.1-3+b1
SHA-1906607450657452FEDFB7246EC0F103AD8CA94D7
SHA-256741DF47657F91D8814A93608A8A4955D76F1365060B0F2574490280E3D2B3471