Result for D264BA6C896A468249EDC4816FF4371693623FB7

Query result

Key Value
FileName./usr/share/doc/libghc-agda-doc/buildinfo_all.gz
FileSize5522
MD53F48D783CA09892CF2E4C0C42DB9AB3A
SHA-1D264BA6C896A468249EDC4816FF4371693623FB7
SHA-2568A4D6CE146C2F884FB99B4ADC20217E9D7B3A612470EAD1B8A19BBD3C1D9425E
SSDEEP96:qpqKq6Dn/W9F8GaywDKV0C0DvW0W6J67ifc0cgtdbV08Jv13CUZM25q+x:qpwE/W0GaHD1NzW6JQsRcgtFV08t1kol
TLSHT1AEB19F3D7D21FED21A75DBEAD2077D6828CDF48B2578CA2D2A66F03C88080740A595EC
hashlookup:parent-total4
hashlookup:trust70

Network graph view

Parents (Total: 4)

The searched file hash is included in 4 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
FileSize3790832
MD5F91E27638ADFAC07F36B75EF43E2AD77
PackageDescriptiondependently typed functional programming language; documentation 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 the documentation for 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-doc
PackageSectiondoc
PackageVersion2.5.4.1-3
SHA-1CFA809ED154BA36CE32ECEEFA27B1579855797E4
SHA-256BF5A30361046262E826B991143BEEFA20C863D169C5C05D711C6894CC1D4756C
Key Value
FileSize117680
MD56CA01428ECDAF733B3DEF94941DC829A
PackageDescriptiontransitional dummy package for elpa-agda2-mode agda-mode has been ELPAfied. See the elpa-agda2-mode package. This transitional package is safe to remove.
PackageMaintainerDebian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageNameagda-mode
PackageSectionoldlibs
PackageVersion2.5.4.1-3
SHA-18D28581F0D81E7A8FC0F04CEF99BB1D4B2F4E074
SHA-256C5DCFBF6E895CDCE4E5C4E561AD71A8EC70248E481D4F90CB2899EE7CE466786
Key Value
FileSize155444
MD5CB52322C72193739AD93FE01E915F965
PackageDescriptiondependently typed functional programming language — emacs mode 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 contains the emacs interactive development mode for Agda. This mode is the preferred way to write Agda code, and offers features such as iterative development, refinement, case analysis and so on.
PackageMaintainerDebian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageNameelpa-agda2-mode
PackageSectioneditors
PackageVersion2.5.4.1-3
SHA-1FB2FACFD6CBD3889BE6DCAC8B2AC08899B21A9A8
SHA-256C7899B0D257F768A8E30FDF1D92FABA18279F466328A7C8F16BEE35432354FB1
Key Value
FileSize118104
MD5F636DCCB78166411E935EEEE832CABB2
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 is a meta package which provides Agda's emacs mode, executable, standard library and its documentation.
PackageMaintainerDebian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageNameagda
PackageSectionmisc
PackageVersion2.5.4.1-3
SHA-1D0D76E067034E540B89DD2B1A458EC4F9B92548C
SHA-256ED3B19D37E58579C1915ACB42B29626F040784FC27541CA585A98B48F11887B2