Result for 5305A69637B49A2466C1CD67E0BA82240F0D72CC

Query result

Key Value
FileName./usr/share/emacs/site-lisp/agda/agda2-queue.elc
FileSize1741
MD5BE1C9F1C8F84CFB04FAED56C49AD5EC0
SHA-15305A69637B49A2466C1CD67E0BA82240F0D72CC
SHA-256D1B449A7206B3B7068F30AC2EC29988E71D9E6E41476830F159535EBA66F0B3B
SSDEEP48:MMZjtEUI/8MnkHsix8nMsYfIpPgnFHMRaei:Mc+f8j8nMzIpPEJMRc
TLSHT14131102AF8F98790402301E250EAA391EB19D199B63E2C00DDD8E45873D3BC877F5CC4
hashlookup:parent-total6
hashlookup:trust80

Network graph view

Parents (Total: 6)

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

Key Value
MD518F2A0B738E4D53F6A594C8E053CC18B
PackageArchppc64le
PackageDescriptionAgda is a dependently typed functional programming language: it has inductive families, which are similar to Haskell's GADTs, but they can be indexed by values and not just types. It also has parameterized 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.
PackageMaintainerFedora Project
PackageNameAgda
PackageRelease5.fc23
PackageVersion2.4.2.2
SHA-141E3E8AC580DB747CC4883E25EEF3FF7A90EAAAD
SHA-256F997D47691DC11934F5DF3C77799F13E8702314A0FA85077D088245D1656360F
Key Value
MD501AC0A92A3E6710C1DEA8FC4C28ADBA9
PackageArchppc64le
PackageDescriptionAgda is a dependently typed functional programming language: it has inductive families, which are similar to Haskell's GADTs, but they can be indexed by values and not just types. It also has parameterized 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.
PackageMaintainerFedora Project
PackageNameAgda
PackageRelease6.fc24
PackageVersion2.4.2.2
SHA-170C1BDD7891A9704FE5C530A9D89BF0631BEAC6A
SHA-25613F3904ADA5F546031AE2CEA7A7B082163799D74C6235F092DF1ABB75E979D6D
Key Value
MD529AEA192D99BABA675A351B66DB52EBA
PackageArchppc64
PackageDescriptionAgda is a dependently typed functional programming language: it has inductive families, which are similar to Haskell's GADTs, but they can be indexed by values and not just types. It also has parameterized 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.
PackageMaintainerFedora Project
PackageNameAgda
PackageRelease6.fc24
PackageVersion2.4.2.2
SHA-15F4D5F92D44846709F707A1666F90B00DED2101B
SHA-2566CE13F2C57BD814C134AEA6DF4468E1D7C6B242CBD75D64CA9AD0CD993ACCB62
Key Value
MD518473ACB47ABD02E5271CF8E9E8F60F9
PackageArchppc64
PackageDescriptionAgda is a dependently typed functional programming language: it has inductive families, which are similar to Haskell's GADTs, but they can be indexed by values and not just types. It also has parameterized 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.
PackageMaintainerFedora Project
PackageNameAgda
PackageRelease5.fc23
PackageVersion2.4.2.2
SHA-15269895FF557AD4CFE60D3967C153E761578F1FA
SHA-256118944345C2EEB3AFC2CB7DF2C50C83FB11AF2AE5CC52F8AECEF54AC203B50B9
Key Value
MD5C934985E26D4EBE13999B4870C5FBC95
PackageArchaarch64
PackageDescriptionAgda is a dependently typed functional programming language: it has inductive families, which are similar to Haskell's GADTs, but they can be indexed by values and not just types. It also has parameterized 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.
PackageMaintainerFedora Project
PackageNameAgda
PackageRelease5.fc23
PackageVersion2.4.2.2
SHA-1A436EBFF2A0B980FF9B9406B3B1600624390E006
SHA-256D6683CE234C11743201FDAE5DA7352E327BD564C700186857ABE764086223536
Key Value
MD5DF04C9547BC0DCC10C2F23143D028BB3
PackageArchaarch64
PackageDescriptionAgda is a dependently typed functional programming language: it has inductive families, which are similar to Haskell's GADTs, but they can be indexed by values and not just types. It also has parameterized 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.
PackageMaintainerFedora Project
PackageNameAgda
PackageRelease6.fc24
PackageVersion2.4.2.2
SHA-19F326016CFF62DAD79DEB934E1DBDB219E51BD3C
SHA-2560A8A3B4AFF30AB49C29FA8E2D2666ED4C2D9D7EB19872D0287070A658F25FE23