Result for 00A82755D2F8271C79B0D59C9E0A1B33093D1D2E

Query result

Key Value
FileName./usr/share/doc/libghc6-agda-doc/html/Agda-Utils-ReadP.html
FileSize33072
MD54B5D522878EB0901029B69FB837F9D56
SHA-100A82755D2F8271C79B0D59C9E0A1B33093D1D2E
SHA-25696608E8726CF16BEBA47FD7478000095EC3586311248ED30A9E979851096F517
SSDEEP384:Hlm6dXeJ3IfTPHoM1TtrRQlGHmtPtRw8d5IZ5YdP7dcH/sqkv7n:UJ3IfTvoctKimt7ckZcHT0n
TLSHT15EE205EC1302581BED927993F8DE50676D45023DB7927D9E342D8C0E5EC663A243AE2F
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
FileSize1058914
MD58030F1CF102B2E547862D0E2653A3460
PackageDescriptiona dependently 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 contains the documentation files.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc6-agda-doc
PackageSectiondoc
PackageVersion2.2.6-7build1
SHA-11AFB83785C97151971F4181F96B0F79B254018FE
SHA-2562E1D030C9EF37E02E4AFBA95B0C59443134A717DD5A2FA578E4FA2ABCF964BEA
Key Value
FileSize1058766
MD54138847715982C065F0EACFFF6D12D3A
PackageDescriptiona dependently 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 contains the documentation files.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamehaskell-agda-doc
PackageSectiondoc
PackageVersion2.2.6-3
SHA-16D586327FE3161D82C389294C38E842AA4E729EE
SHA-256BD95B95D7B8A0CB27EA24D5210049668382A2744CE8ADB80F43EB406B06DEC51