Result for CFEBC902159A353760D289ED92063DAA1BCBD62D

Query result

Key Value
FileName./usr/share/doc/libghc-agda-dev/buildinfo_arm64.gz
FileSize5687
MD5BCC2BBC6F608CE3126D74BE3467F1516
SHA-1CFEBC902159A353760D289ED92063DAA1BCBD62D
SHA-256A9998B28E9C3173D9579AE550AEF2FA1233A9F83EE3623851590038F1AFDC90A
SSDEEP96:ZAccSB4bXP6cL507hWhrqWVWOzUFyrC+isnVO01Zz8l3/AUIG59Qxs08yohO8Ib9:ucn4bV5+hWh+WJ44ryM8KZz8l3x5SGDm
TLSHT121C19E69895899F9BCEE1D3D60E8758881A5EEBD40F6203020403FA8C91B0CCEEDC299
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
FileSize9233292
MD514C753A01BA823EF785392BE95B2CA22
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.3-3+b1
SHA-1FBB3955C17562EEC8B93603FF965739F0105AA3E
SHA-256C32D5BBC3A276F9CD87B95DBDC8CAA2F0C355D9A3EA2C4573BB966E682740B86
Key Value
FileSize23942348
MD5F4C41E1F4A2550E2CF0C257ABCFFA546
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.3-3+b1
SHA-17490314056012763DAEC8EE67BA32D325F5A563B
SHA-25637DFA5E80432153BA61F888650806096494EB15F3B99287A7B3042F6EB6487F2