Result for 0A549D33BDC692E2C7708DC05538D4AEE919EEEA

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/Agda-2.3.0.1/ghc-7.4.2/Agda/Syntax/Parser/Lexer.hi
FileSize12184
MD5800438A83E4FD37C7FFD6E5A44E5F845
SHA-10A549D33BDC692E2C7708DC05538D4AEE919EEEA
SHA-256FB527C09B37F0B2CC921773B40014E2AB403CD4B8BD1A92DACF7044F29AADF08
SSDEEP192:Zr4WSPrLGRkR7H4QfSre0ehlI+qNXrtJFU7N/QqFSDO+f6caq/b/XcwYzEhP+:Zr4rLGiuQie0eKf6caq/bXcwYzEB+
TLSHT173421BA60F0C6D2AEA040B3BCC974711AFA0E9766951CFDB7AD865622C075CE5E3051F
hashlookup:parent-total1
hashlookup:trust55

Network graph view

Parents (Total: 1)

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

Key Value
FileSize17730002
MD580D45461DD8C1B43D6DD189387A4BCCF
PackageDescriptiondependently typed functional programming language - development libraries 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 normal library files.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-agda-dev
PackageSectionhaskell
PackageVersion2.3.0.1-2build1
SHA-18E1D776782CA49B9AC7B17D580A8086040D13CEE
SHA-256BAA70D8BE777FAD4991393590FBBE3A41816A6995D35C1D23EE5AE014E658280