Result for DA90630726487439CEDDFFB793DA4D5D69805797

Query result

Key Value
FileName./usr/share/emacs/site-lisp/agda/annotation.el
FileSize7994
MD5169FA83F16CB8498407B6E6DD35EDC94
SHA-1DA90630726487439CEDDFFB793DA4D5D69805797
SHA-256E9AEFE35DFB53ABFB744A421180788144A086F8C91D2A9187DEF02C002AF2327
SSDEEP192:NagKU1hUO4YMKLXUExLHn9hPlpS/50Rsh56vBarqYTAThPP:nKU1hUEFLXUERddDS/CRO56vorqYT0hH
TLSHT142F1629AF78017765FCB26A3B96A6186CF74B5EE20608304319FD1442F4613267EFD8B
hashlookup:parent-total14
hashlookup:trust100

Network graph view

Parents (Total: 14)

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

Key Value
FileSize44642
MD5A694C3026AEE390E25699FB428645939
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.1-1
SHA-1C53BEB3844B9FEE8D8536C05FA8FB79FA8845767
SHA-25652F48B35265A2CA7291A924630AB57508D9D046075CB1669F5B2660B8A523101
Key Value
MD518F2A0B738E4D53F6A594C8E053CC18B
PackageArchppc64le
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
PackageRelease5.fc23
PackageVersion2.4.2.2
SHA-141E3E8AC580DB747CC4883E25EEF3FF7A90EAAAD
SHA-256F997D47691DC11934F5DF3C77799F13E8702314A0FA85077D088245D1656360F
Key Value
MD501AC0A92A3E6710C1DEA8FC4C28ADBA9
PackageArchppc64le
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
PackageRelease6.fc24
PackageVersion2.4.2.2
SHA-170C1BDD7891A9704FE5C530A9D89BF0631BEAC6A
SHA-25613F3904ADA5F546031AE2CEA7A7B082163799D74C6235F092DF1ABB75E979D6D
Key Value
MD529AEA192D99BABA675A351B66DB52EBA
PackageArchppc64
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
PackageRelease6.fc24
PackageVersion2.4.2.2
SHA-15F4D5F92D44846709F707A1666F90B00DED2101B
SHA-2566CE13F2C57BD814C134AEA6DF4468E1D7C6B242CBD75D64CA9AD0CD993ACCB62
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
MD518473ACB47ABD02E5271CF8E9E8F60F9
PackageArchppc64
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
PackageRelease5.fc23
PackageVersion2.4.2.2
SHA-15269895FF557AD4CFE60D3967C153E761578F1FA
SHA-256118944345C2EEB3AFC2CB7DF2C50C83FB11AF2AE5CC52F8AECEF54AC203B50B9
Key Value
FileSize45468
MD5CD60AFFB78FB775669963C3755B74DF6
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-1
SHA-19B4BF36E9605D5CF286F02A6337D21E92B55222B
SHA-2563737C76C32B8D03EAA6D684781BD4ABC230A5893FC3956FF9DEA9BF87AAC882E
Key Value
MD5C934985E26D4EBE13999B4870C5FBC95
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
PackageRelease5.fc23
PackageVersion2.4.2.2
SHA-1A436EBFF2A0B980FF9B9406B3B1600624390E006
SHA-256D6683CE234C11743201FDAE5DA7352E327BD564C700186857ABE764086223536
Key Value
FileSize40228
MD5B3227CD9E151F5F53A2C80CA41AD6F7C
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.0.2-2build1
SHA-10F9F6B3FD82750E178A9768742D6AEA11DFCCA16
SHA-25631B81FB623F09F8E41E047C67B47E8944AAA4519E39741028BA1F7F305911EAB
Key Value
FileSize40288
MD5050702791E56261502E8B9F0C46FC49C
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.0.2-2
SHA-16242AE96C69F6BB4C0D415C123F226FEE1305BFA
SHA-25622A38678B6EE36DFD3D282392CC87800A687ADD41ABDE8810830E975EF173DF6
Key Value
FileSize88336
MD5FBE90088FD0B5E99499042943328AD0C
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>
PackageNameagda-mode
PackageSectionmisc
PackageVersion2.4.0.2-2
SHA-1FCD8314BC96EE0C95F77724469B985C76FFA5C44
SHA-256FAA7A61902FB1E38F7B788BF2CAE0880D73B8984177E7BADC6930084120B234F
Key Value
FileSize36270
MD53376F221DBAAC0CCDE12F6E466C243A9
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.2-4build1
SHA-19F66D2C02364F4826044C2961E503C9EA23B0D3F
SHA-2562D10D19EA6EDEBDB7BB19E9C52408CFA8AB20F0B989F4DF41B8F5E541447DD51
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
Key Value
MD5DF04C9547BC0DCC10C2F23143D028BB3
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
PackageRelease6.fc24
PackageVersion2.4.2.2
SHA-19F326016CFF62DAD79DEB934E1DBDB219E51BD3C
SHA-2560A8A3B4AFF30AB49C29FA8E2D2666ED4C2D9D7EB19872D0287070A658F25FE23