Result for 423828BF4A3058849A890FF209C0C72077C924A9

Query result

Key Value
FileName./usr/share/emacs/site-lisp/agda/agda-input.el
FileSize35594
MD56CEA7E68E26FEC591185FF88EC9FEE81
SHA-1423828BF4A3058849A890FF209C0C72077C924A9
SHA-256668A3EB817B77D9E8F67547C443629577C37E983C6EE7F7DA94FCD025B41F56F
SSDEEP768:xqHFyJu+Je2qEB0OSfaq3FJBQJaJyhyntmj:4HFyrVLB0OSiiJBQQ7M
TLSHT163F2C92248596DE2A7533EAB06CFA744B339C74D96730D98BD8FC0DACB4B02543B5E12
hashlookup:parent-total4
hashlookup:trust70

Network graph view

Parents (Total: 4)

The searched file hash is included in 4 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
FileSize39854
MD5706F1B9F11365BC57200A60B95D76A88
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>
PackageNameelpa-agda2-mode
PackageSectioneditors
PackageVersion2.5.1-2build2
SHA-1204C101BE9BF0EC83A9848844823B8E24DD7AFEC
SHA-256201F045116D3A8069D1F58D448AA7D1312E3A529C918B0A763090049CC01C56F
Key Value
FileSize115256
MD5E269B3CA2F98E6FE9F217CFCAD8E7A1B
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.
PackageMaintainerDebian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageNameelpa-agda2-mode
PackageSectioneditors
PackageVersion2.5.1.1-3
SHA-1643D06CA0664726A1DA216F856E3342659C999EC
SHA-256C812023053C2A082C3AD470FE5B5FA23BC674E4FA251F1C7A81EEE5B19D3409D
Key Value
FileSize39700
MD529CD50A45521CFF33FE90D039089366A
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>
PackageNameelpa-agda2-mode
PackageSectioneditors
PackageVersion2.5.1.1-3build3
SHA-1F3EBB80E3E93D83229D55EBAB5561EC656C43B4C
SHA-2563CDA9FF16E377E1734931F3A60E860D47D408D15471E5C72BF43223E6A03EBE4
Key Value
FileSize37272
MD5F08DC824AAB02A3687B9B9EEB69655C3
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.4.2.5-1build1
SHA-17CDA99F8A6E7CFF6D37CED32CA49C8A83D7A3000
SHA-2568D5F750653EFC0DFA03A458C9E6EAD43539DB5C1DAA69E5528FB7F2D012155A3