Result for 0216151C3C2E7842580519CFE9E0888BC8C0C006

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-9.0.2/Agda-2.6.2.2-7KnEKyKhaJHFPwDzdI3vIK/Agda/Syntax/Parser/Alex.dyn_hi
FileSize23506
MD55E6B3E1D91D4189AF5815A7D7754914E
SHA-10216151C3C2E7842580519CFE9E0888BC8C0C006
SHA-25623E9800E609885F49A9BFE173A77E38DE5169DF740462482EB0370A716A528A2
SSDEEP384:oThFSfFyFfSlqFyFFFlSKFyFRFyF780w4SURowNS80ssSraPH10wqHU2ANC81awI:kFSfFyFfSlqFyFFFlSKFyFRFyF78OSW/
TLSHT166B21D2FBB91DD51C92F0A368C730342F721DCE0722652DB56E926F6DA40AF44DA9AC4
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
FileSize24853036
MD5A827C1F62CB35F810525E042DA8A4B4E
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.2.2-1.1
SHA-19C7642EEE4646AA11A4215B9C6249C43E53C882A
SHA-2563B1E6380DC53A3CF5F628F3A537AF8BE654E881A1F7C4409E108A59ED7E2C360