Result for FFB4B6AB859DBD4DF5E696901D6EEB3A41B4E756

Query result

Key Value
FileName./usr/share/doc/libghc-agda-dev/changelog.Debian.i386.gz
FileSize218
MD5C4609223EFA4223F71D213A6A0046F2D
SHA-1FFB4B6AB859DBD4DF5E696901D6EEB3A41B4E756
SHA-256D460C8D91B27DABCA6F4BED48E570354C0656671F510CC4AD992E4A9DA01735E
SSDEEP6:XtTWIlSwYwZ2EqwEuaZivq3zUPD/aVylEUjKkU+wn:XkcYw8nHG2zUPD/aV68
TLSHT1A9D023E70410241EE859E3F0C87DBC40B00C6E0C36718000D126CB3041BE7D105D083F
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
FileSize8968812
MD54D1A006E9670C621A460C812021A4BA9
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+b3
SHA-123A48EFE72A36C808FF5E6DC4B24DDF2A4E20EFC
SHA-2566B06A288CACB8736DDCD53D565DA9943DC19BDBFFE917BAED68EC27DA286B9BE
Key Value
FileSize38088112
MD50C18D5EF837A85AA1AE064BBEDD396E4
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+b3
SHA-10F878188DAAA2080568D1D78BA9A0BFFF6F10FCB
SHA-256E10C726C9C1804873A80EA965D579BA11ABCD2305744A0807030A7F054D2107E