Result for F758A0F531D3B65AA86F7C5968C044CF3FCA7F17

Query result

Key Value
FileName./usr/share/emacs/site-lisp/agda/agda2-mode.el
FileSize59157
MD5262C773AA4999CBCCA3433461942B577
SHA-1F758A0F531D3B65AA86F7C5968C044CF3FCA7F17
SHA-25623B5F0C0D4A87301B20CCDBD1D65908CF4F2C926DE1295F5FC39173250AB6ECC
SSDEEP1536:rm1qJDvh+oUmiE4v9GUBvva74Ev0eWIE8IKWKMKI:xeGUBK74Ev6IE8IKWKMKI
TLSHT14243D522EEB6C97127430063A65FD3499F2090CFE5245A953A9E85089F46E74C3E3F9E
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
MD5AD7A09A0AFEEE4CD06AEEDBA2FA3D4EA
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
PackageNameemacs-agda-el
PackageRelease5.el7
PackageVersion2.3.2.2
SHA-1E3C4ECFCE9451232FA524FE91DFC84633DEEC56C
SHA-2567951F3D2088C2B1C828C1A7AF149B2CEBBA2DB9D444235805956ABC14A24B01C
Key Value
FileSize48080
MD555D29847A1814A691B2C476EDED980C7
PackageDescriptiondependently typed functional programming language — emacs mode 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.3.2.2-1
SHA-1B1B682A4A3CD43974857336490653EC071BE20EB
SHA-256256EA59AFF33FFE0F08FE99C120926EEBA67D1C3FE89C51D3EB3D8C879EF0E32