Result for 3C50C7DF4E03AE89B4EDE8F0EEFAE783BD163E80

Query result

Key Value
FileName./usr/share/emacs/site-lisp/agda/agda2-mode.el
FileSize46802
MD56B47490229576DC3043A95444F73650F
SHA-13C50C7DF4E03AE89B4EDE8F0EEFAE783BD163E80
SHA-25679DA9AF4D8130339AB6284B9B6F68CA05F8CD0E17C114A952E71FF0E8F185E11
SSDEEP768:qnw7pOQq1qJDvh+5K2Km0E4vmpVNyOQs1uxcszOsokLpcKX/V/0Q5+:qZt1qJDvh+Y7m0E4vqH1jsqsokLpDLA
TLSHT19923D622EF76D9716743002396AFE3099F2090CFD52469957A9E81589F42DB4C3E3F4E
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
FileSize39278
MD523E8001ADF9C0D196BA8333E1CD4B6D3
PackageDescriptionthe emacs mode for 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 contains the emacs interactive development mode for Agda. This mode is the preferred way to write Agda code, and offers features such as iterative development, refinement, case analysis and so on.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNameagda-mode
PackageSectionmisc
PackageVersion2.2.6-3
SHA-15CE948FCDC3E30BDB64D3C8E43B419090151DCDD
SHA-2569D29D1A05A7E2E9126012BDD67361E009FDB38334959F8DF41C7F0C6AE649469
Key Value
FileSize39608
MD5748278A5A8CBCA4437139704305EA014
PackageDescriptionthe emacs mode for 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 contains the emacs interactive development mode for Agda. This mode is the preferred way to write Agda code, and offers features such as iterative development, refinement, case analysis and so on.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNameagda-mode
PackageSectionmisc
PackageVersion2.2.6-7build1
SHA-172C3196E52B76F028E08539FF79DD72A3A51D6B9
SHA-25655DF2F0BB8AA386F509A774AC712622828FE72A59E15A0FA97C3C8B4B243A2F2