Result for 147DA20AA758E0A977ED665913C5F0469E583436

Query result

Key Value
FileNameusr/share/agda/MAlonzo/src/MAlonzo/RTE.hs
FileSize3994
MD541C20842F03B02FF7FAA603F0B966B43
SHA-1147DA20AA758E0A977ED665913C5F0469E583436
SHA-2566334EFEC9FC7F9103B877BFE708DFA984725DE21C21978FCA9D9525903A35593
SSDEEP48:DWX+g5MxMUFko0R+pV54rFqqf25xDH/qMLpEPrVJV55l6AGX:DM5kMe30RvqfxvLmrVJVfUAs
TLSHT1D08127FD23C5303BD039B9B1E909B05ADC157AC78BD37495384C827863E5A54DA01FA7
tar:gnameroot
tar:unameroot
hashlookup:parent-total8
hashlookup:trust90

Network graph view

Parents (Total: 8)

The searched file hash is included in 8 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
FileNamehttp://archlinux.mirror.root.lu//pool//community//agda-2.6.1.2-41-x86_64.pkg.tar.zst
MD541AD8F3145809187DCC98E0CFFDBF88C
SHA-111572B89890552CDB7C877AA1807678861ED9B94
SHA-256DC051BF07378BA8669CC4993CA03EA987409B0F0423FAF096937D36E0F86DC37
SSDEEP786432:fHZ0Vm0UOrE1iu7Sn2JutwBZEkq7w40pA6U:+VaA2JVZEk+90p2
TLSHT1DE573372BD540ACB480FA16DAC9FC0EEBEB179522514AE15C21F66569C0879CEB4FCF0
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
Key Value
FileNamehttp://archlinux.mirror.root.lu//pool//community//agda-2.6.1.3-9-x86_64.pkg.tar.zst
MD59F0C59D9FAE86EC4D9B720006F5DD8F7
SHA-1474F66B9DA3A15A0D229AE50BC9B305F81A1D2FA
SHA-2560279952CA88D6ACA7C3B384D3E0D32AC612F0FAADC308E619D5B4D59C033FFE8
SSDEEP393216:qkdpjMNckhxfOEzk7+d3vYQdb8J47OJG2hJqbWVSzTVcTXnGf3zXt5XgTgwYJZXE:qkrcH5k7EvBdTOJLTlSNcTXnejdOcCl
TLSHT1405733B963E2443961488C4FD5B5E4B68BD1E891D3728995BB109C83F837BF1C39E4B2