Parents (Total: 32)

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

Key	Value
MD5	D6B94D599BCE6AF5CBDEC5FD64C8C1F5
PackageArch	x86_64
PackageDescription	Agda 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. This provides the Emacs Lisp source files for the Agda interactive mode.
PackageMaintainer	Fedora Project
PackageName	emacs-agda-el
PackageRelease	9.el6
PackageVersion	2.3.0.1
SHA-1	0A804BF28458B86084EBD9CCDFD029E840D48FDA
SHA-256	1004A84814BD963A8DD8AC50DF820CE40D8E437979266BCCD160FB957D89AF6B

Key	Value
FileSize	40228
MD5	B3227CD9E151F5F53A2C80CA41AD6F7C
PackageDescription	dependently 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.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	agda-mode
PackageSection	misc
PackageVersion	2.4.0.2-2build1
SHA-1	0F9F6B3FD82750E178A9768742D6AEA11DFCCA16
SHA-256	31B81FB623F09F8E41E047C67B47E8944AAA4519E39741028BA1F7F305911EAB

Key	Value
MD5	B1687882326A844827A5852B87FC647A
PackageArch	i686
PackageDescription	Agda 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. This provides the Emacs Lisp source files for the Agda interactive mode.
PackageMaintainer	Fedora Project
PackageName	emacs-agda-el
PackageRelease	9.el6
PackageVersion	2.3.0.1
SHA-1	19AE30BD7615E4689DE0D22C8D5CF65992FC4783
SHA-256	AF19F6E8828A843BEC200EB963518857C61BE58696A6797538F2C891788D45F8

Key	Value
FileSize	44936
MD5	26C157AD10CC0F305AE0665B52A8CE52
PackageDescription	dependently 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.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	agda-mode
PackageSection	misc
PackageVersion	2.3.0.1-2build1
SHA-1	1AB9184BB3FAFEF99AE9BADA64BFBB851E8E7D4D
SHA-256	EF5D9DF811584E257FCC412A938AF895E9619E49865A944CA0649AC6478844D7

Key	Value
FileSize	39854
MD5	706F1B9F11365BC57200A60B95D76A88
PackageDescription	dependently 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.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	elpa-agda2-mode
PackageSection	editors
PackageVersion	2.5.1-2build2
SHA-1	204C101BE9BF0EC83A9848844823B8E24DD7AFEC
SHA-256	201F045116D3A8069D1F58D448AA7D1312E3A529C918B0A763090049CC01C56F

Key	Value
MD5	E43B520CDFA7A985A25712F7BD856E22
PackageArch	ppc64
PackageDescription	Agda 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. This provides the Emacs Lisp source files for the Agda interactive mode.
PackageMaintainer	Koji
PackageName	emacs-agda-el
PackageRelease	9.fc19
PackageVersion	2.3.0.1
SHA-1	3C609C28F6405D43AC9D4EC9EB6EF737323AC6C7
SHA-256	FA6478717924018B5E30219F9FE35325DC0DF1E08CBD0CDE5B234DA7E6A57446

Key	Value
MD5	18F2A0B738E4D53F6A594C8E053CC18B
PackageArch	ppc64le
PackageDescription	Agda 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.
PackageMaintainer	Fedora Project
PackageName	Agda
PackageRelease	5.fc23
PackageVersion	2.4.2.2
SHA-1	41E3E8AC580DB747CC4883E25EEF3FF7A90EAAAD
SHA-256	F997D47691DC11934F5DF3C77799F13E8702314A0FA85077D088245D1656360F

Key	Value
MD5	18473ACB47ABD02E5271CF8E9E8F60F9
PackageArch	ppc64
PackageDescription	Agda 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.
PackageMaintainer	Fedora Project
PackageName	Agda
PackageRelease	5.fc23
PackageVersion	2.4.2.2
SHA-1	5269895FF557AD4CFE60D3967C153E761578F1FA
SHA-256	118944345C2EEB3AFC2CB7DF2C50C83FB11AF2AE5CC52F8AECEF54AC203B50B9

Key	Value
FileSize	39278
MD5	23E8001ADF9C0D196BA8333E1CD4B6D3
PackageDescription	the 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.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	agda-mode
PackageSection	misc
PackageVersion	2.2.6-3
SHA-1	5CE948FCDC3E30BDB64D3C8E43B419090151DCDD
SHA-256	9D29D1A05A7E2E9126012BDD67361E009FDB38334959F8DF41C7F0C6AE649469

Key	Value
MD5	29AEA192D99BABA675A351B66DB52EBA
PackageArch	ppc64
PackageDescription	Agda 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.
PackageMaintainer	Fedora Project
PackageName	Agda
PackageRelease	6.fc24
PackageVersion	2.4.2.2
SHA-1	5F4D5F92D44846709F707A1666F90B00DED2101B
SHA-256	6CE13F2C57BD814C134AEA6DF4468E1D7C6B242CBD75D64CA9AD0CD993ACCB62