Parents (Total: 8)

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

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
FileSize	37272
MD5	F08DC824AAB02A3687B9B9EEB69655C3
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.2.5-1build1
SHA-1	7CDA99F8A6E7CFF6D37CED32CA49C8A83D7A3000
SHA-256	8D5F750653EFC0DFA03A458C9E6EAD43539DB5C1DAA69E5528FB7F2D012155A3

Key	Value
MD5	01AC0A92A3E6710C1DEA8FC4C28ADBA9
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	6.fc24
PackageVersion	2.4.2.2
SHA-1	70C1BDD7891A9704FE5C530A9D89BF0631BEAC6A
SHA-256	13F3904ADA5F546031AE2CEA7A7B082163799D74C6235F092DF1ABB75E979D6D

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

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
MD5	C934985E26D4EBE13999B4870C5FBC95
PackageArch	aarch64
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	A436EBFF2A0B980FF9B9406B3B1600624390E006
SHA-256	D6683CE234C11743201FDAE5DA7352E327BD564C700186857ABE764086223536

Key	Value
FileSize	36270
MD5	3376F221DBAAC0CCDE12F6E466C243A9
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.2.2-4build1
SHA-1	9F66D2C02364F4826044C2961E503C9EA23B0D3F
SHA-256	2D10D19EA6EDEBDB7BB19E9C52408CFA8AB20F0B989F4DF41B8F5E541447DD51

Key	Value
MD5	DF04C9547BC0DCC10C2F23143D028BB3
PackageArch	aarch64
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	9F326016CFF62DAD79DEB934E1DBDB219E51BD3C
SHA-256	0A8A3B4AFF30AB49C29FA8E2D2666ED4C2D9D7EB19872D0287070A658F25FE23