Result for 493A2FF819D4CAF7DC21DAD5CBD3F06CC03CB61D

Query result

Key Value
FileName./usr/share/doc/libghc-agda-dev/changelog.Debian.arm64.gz
FileSize219
MD5B0340B205FA0AAE20A4F27FC286D0B5A
SHA-1493A2FF819D4CAF7DC21DAD5CBD3F06CC03CB61D
SHA-256950CDF729A69FE929081FE6FF74FF6A1378B0BB31EB6CDB552872634428F7814
SSDEEP6:XtBucItabdTyqJ3R3qebZV9NADOztt55CwY36Ttln:XRWaPJhZbPoAH5BYqTn
TLSHT179D0A7910B9594BDC096A2FC32504B96AB575598E594CD34A40A5B02D6BB90409D25C4
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
FileSize8127230
MD565DF278428AB2F3D764B7152530E3857
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.2-2+b1
SHA-1D66591A5C1A79B3D58D8C67E3700242B824CE7E8
SHA-256886B4AFB5ADBAF305BDAE732617C5B333E6117B1546CC836CEFD3E338FB1DA03
Key Value
FileSize19839258
MD5D9CE974EE739DE8879F2F1DD71AB1DE5
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.2-2+b1
SHA-13F1EAE824BC0000C56F92EEDF6832BDF133E3CA3
SHA-2561D4548BC54CF0433A3BB334B9F397B9D0B2D05F4B93C2BC2C56A7E087C75E21A