Result for 34488B97488869F29F91396AFCB239F3301E2685

Query result

Key Value
FileName./usr/share/doc/libghc-agda-dev/changelog.Debian.mips64el.gz
FileSize534
MD54B0B1646D275B541BAA5F621A23C983E
SHA-134488B97488869F29F91396AFCB239F3301E2685
SHA-25681DA4F820258B68949B7A71DB877A8333DBE6EF8C454AE432B5FD1E8DFBE68AE
SSDEEP12:XIiGYLQzLMv+uM6Om/02/qhvoCIQfds5veHrXUpXHb0z+YqPZLd:X8uM352/qK8qVeHrXUpXHbeE
TLSHT130F020C06A40D763E44516F00FA232C0CB2C8B619D01CED1186505E50D6D7A9E57050E
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
FileSize11195152
MD5DCC64F85E2ED823841EB7647E08FDCAD
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-160D27E8709AA6CE27942FA0D7234F9D4C5DAE8B8
SHA-25605F5DF76730498DF02A8F11ABCE87CA1C346101F4A45EF06D4331E7811DA5FEA
Key Value
FileSize24536388
MD5C7ED7DCA30FF65D94045695B1FF9ECD7
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-1E90239BE6EE4B8D31ADEC7C96F22F7131ABDEA88
SHA-256C74974CA221D528A44FB1104AFC7E8B11BC9EC8D5AB49EA9C7E70C133D1035CB