Result for 49F23A65087E3EC5E3617CCC03113EB1562C7FCA

Query result

Key Value
FileName./usr/share/Agda-2.5.4.2/agda.sty
FileSize23792
MD5D8A4BC8EEAE2F369807D7EE7BD1CA6B8
SHA-149F23A65087E3EC5E3617CCC03113EB1562C7FCA
SHA-2564E381F084EBCF71D21FF3B8B6907D81BECCDDC433EEDB408927BBB61A2CB9865
SSDEEP384:hxcBBeZL3LyoNmbxuD4USjsh1Bqek9IQJtMxMZiFKH6q:v6xHgDkDJyWZDH5
TLSHT179B263F3BE7911A3ABC3C579DC496F90DA3AA1BF208481DD3D9D05D88F52410CAED689
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
MD5AC2946B6BADE2D10352E825A20AE0CF6
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 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 includes both a command-line program (agda) and an Emacs mode. If you want to use the Emacs mode you can set it up by running 'agda-mode setup' (see the README). Note that the Agda package does not follow the package versioning policy, because it is not intended to be used by third-party packages.
PackageNameAgda
PackageRelease1.10
PackageVersion2.5.4.2
SHA-1D67B92B5B6FE431E0A9EA7788DDB5383509D1148
SHA-2567B3C4C11AFD5F871313D7A11B8B7D2B845BD563BFD5E274487D52FC271298BCA
Key Value
MD532E11682BB55ED686A8A792337A83664
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 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 includes both a command-line program (agda) and an Emacs mode. If you want to use the Emacs mode you can set it up by running 'agda-mode setup' (see the README). Note that the Agda package does not follow the package versioning policy, because it is not intended to be used by third-party packages.
PackageNameAgda
PackageReleaselp150.1.2
PackageVersion2.5.4.2
SHA-1306EE61D61D0E2DE7D414331A867F247DC48329D
SHA-2567F961B4B99BF1CC0287DA2A679354F556507A6EA5386EC79845D14D0C38A11AA