Result for 121BECC1A4894D6B000554657268568B51217D32

Query result

Key Value
FileName./usr/share/emacs/site-lisp/agda/agda2-mode.elc
FileSize75468
MD5CF130578435126CFB71A2FC6CE7D5B54
SHA-1121BECC1A4894D6B000554657268568B51217D32
SHA-256EA3E3C338631792103FF00902F2580063826662157FDBEE5452D0D820BD47768
SSDEEP1536:kklFBIJmNpvho/K0d4D6EVenNeqcLVce1L8Cr1cpXa9EQpNDGfWTF6YuxQIGZp:md4DReUBa0joKrPTkYuxQh
TLSHT1E473E97FEBF98271858610A3D678DBAA4722C1D0E6511C50789CC388E311EB5A7E7B4E
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
MD5BEA32CF4C5302AF806042983AF2D7229
PackageArcharmv7hl
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
PackageRelease28.fc33
PackageVersion2.6.1
SHA-13D29C39B884968085485A87F8115AFADF4911FD1
SHA-256CB7B90F16365437B95D858C5DF82F6DEA3FD8B36582E0CFD0231643BE9E3D01E
Key Value
MD5256F5E6109E945BF1AEB0B3F99BD479F
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
PackageRelease28.fc33
PackageVersion2.6.1
SHA-1B1548AD41DC0E61FBC0489D7678446FCCB9856C4
SHA-256F1B4DF65B58A7C9BD3C357A8CED33484E1C1CD7A5BB993DCAC5F642D68357141
Key Value
MD5A95D78BB17DCAFB07B0413663B2FD69C
PackageArchx86_64
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
PackageRelease28.fc33
PackageVersion2.6.1
SHA-166F8F396B6F369479C0AB685F7183F9A9724D228
SHA-256B32AF34182B2067FC89D560300C04249D789AE710094FCC0C8B3AFF3F24B6CA7
Key Value
MD5DE011CAA3C3E1E68518653257C472A93
PackageArcharmv7hl
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
PackageRelease30.fc34
PackageVersion2.6.1
SHA-1D9496C1555CA41D901625BF7B9075CD79AB4B1A3
SHA-256BB085C5D24D6EBAA490AF7BC72B441C5B4CD4B27C91618A2F6EC3BFC842AA95A
Key Value
MD55777B06945327966BCCE14E17A1CE217
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
PackageRelease30.fc34
PackageVersion2.6.1
SHA-10E4D4D36C6414CD1EF816AB632D904407DD7EFC1
SHA-2567C272684273F9F1D45E1A05E24ABB82CB4CEEE568D7C96296F955E3B11C50C56
Key Value
MD56D1A6D85266C8CB2A99E07FEE878885F
PackageArchx86_64
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
PackageRelease30.fc34
PackageVersion2.6.1
SHA-129E757E8D33937BAE129FA89C30699962E38B217
SHA-256C30F3075B376FE7CD05511ADEB7E8C5D595A4479B49A80AF245B752407F6E7E9