Parents (Total: 15)

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

Key	Value
FileSize	44808040
MD5	1E2FE96924BCAE71AC07870CCEFBCF60
PackageDescription	dependently typed functional programming language 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 provides a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainer	Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageName	libghc-agda-dev
PackageSection	haskell
PackageVersion	2.6.1-1+b3
SHA-1	76F288F55740E747B1C6F74F0668B97A59DD6296
SHA-256	FF77AB419034C39B5042F96BF080AE1BCD9314C20421F4A5A8A9D112837081BB

Key	Value
FileSize	55855836
MD5	EC06D310EDD7FD5194C0ECC7C2C52580
PackageDescription	dependently typed functional programming language 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 provides a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainer	Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageName	libghc-agda-dev
PackageSection	haskell
PackageVersion	2.6.1-1+b3
SHA-1	84ABA2F3154DBFEBB06A9464B6ACF99C4E313065
SHA-256	8BE37EEB5D15B1DC3F00817605500477E938357262D0487B33C2D80505FE012D

Key	Value
FileName	http://archlinux.mirror.root.lu//pool//community//agda-2.6.1.2-41-x86_64.pkg.tar.zst
MD5	41AD8F3145809187DCC98E0CFFDBF88C
SHA-1	11572B89890552CDB7C877AA1807678861ED9B94
SHA-256	DC051BF07378BA8669CC4993CA03EA987409B0F0423FAF096937D36E0F86DC37
SSDEEP	786432:fHZ0Vm0UOrE1iu7Sn2JutwBZEkq7w40pA6U:+VaA2JVZEk+90p2
TLSH	T1DE573372BD540ACB480FA16DAC9FC0EEBEB179522514AE15C21F66569C0879CEB4FCF0

Key	Value
FileSize	57990816
MD5	4AB11FEAB32442BC7B0D4854EFB8FD2D
PackageDescription	dependently typed functional programming language 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 provides a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainer	Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageName	libghc-agda-dev
PackageSection	haskell
PackageVersion	2.6.1-1+b3
SHA-1	11D8B93027080E2A596C732CA58370C9D31BA064
SHA-256	8177E67DF94971CAF5EDC7EB6CD0B15897236B60FA3FBFB68400DEB8B1EF465A

Key	Value
FileSize	37948252
MD5	F39B526CB4CEBB6C3AD152E078B4139F
PackageDescription	dependently typed functional programming language 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 provides a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainer	Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageName	libghc-agda-dev
PackageSection	haskell
PackageVersion	2.6.1-1+b2
SHA-1	D7447BAD0811553403E34173EEAFB164FC714455
SHA-256	3189CC3FD18E820BA8BC5D4A9CE7207185BF0F590571BA2767CDDC2FF7C15B09

Key	Value
FileSize	58006132
MD5	974DDC35C7ECF53001AE5B63422BBDF8
PackageDescription	dependently typed functional programming language 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 provides a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainer	Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageName	libghc-agda-dev
PackageSection	haskell
PackageVersion	2.6.1-1+b4
SHA-1	D7D42A96CDED263B44F06EAB4C1CAB490CE7E950
SHA-256	C3579700129D8F76D74050170AFBB658E03E08DC1184D583C2A61F88BB2C995B

Key	Value
FileSize	37928612
MD5	D9B2F80C93D9B06967016524BAB748FA
PackageDescription	dependently typed functional programming language 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 provides a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libghc-agda-dev
PackageSection	haskell
PackageVersion	2.6.1-1build1
SHA-1	5F5B02E9161B0ECB133D03C0AFB872BE778C236B
SHA-256	850CFD1692FCEF2BABA6FF4E0BC0E861D6E9069E5805A83D716CE51BB97D45F9

Key	Value
MD5	A95D78BB17DCAFB07B0413663B2FD69C
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.
PackageMaintainer	Fedora Project
PackageName	Agda
PackageRelease	28.fc33
PackageVersion	2.6.1
SHA-1	66F8F396B6F369479C0AB685F7183F9A9724D228
SHA-256	B32AF34182B2067FC89D560300C04249D789AE710094FCC0C8B3AFF3F24B6CA7

Key	Value
MD5	256F5E6109E945BF1AEB0B3F99BD479F
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	28.fc33
PackageVersion	2.6.1
SHA-1	B1548AD41DC0E61FBC0489D7678446FCCB9856C4
SHA-256	F1B4DF65B58A7C9BD3C357A8CED33484E1C1CD7A5BB993DCAC5F642D68357141

Key	Value
FileSize	55865268
MD5	1217FA6AB21423CD00A235554A7062B2
PackageDescription	dependently typed functional programming language 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 provides a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainer	Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageName	libghc-agda-dev
PackageSection	haskell
PackageVersion	2.6.1-1+b2
SHA-1	46D3E6F146BB7B4353EFE102740727F1CAEF28CB
SHA-256	5D3D0FD0C3AD9CABF3BAC3970FCC5285464B606C807D6143D1692C9AFCECEE6F

Key	Value
FileSize	37929588
MD5	ECDAEA88421F9CEDEB7822CA500C851D
PackageDescription	dependently typed functional programming language 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 provides a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainer	Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageName	libghc-agda-dev
PackageSection	haskell
PackageVersion	2.6.1-1+b3
SHA-1	B653C4651019C31683811007213CB992F4048B3C
SHA-256	5BC8DC702FA8AE7AED90F6D97520B9DD1DF798A3D323170ADC0222F3F1B73C3A

Key	Value
MD5	5777B06945327966BCCE14E17A1CE217
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	30.fc34
PackageVersion	2.6.1
SHA-1	0E4D4D36C6414CD1EF816AB632D904407DD7EFC1
SHA-256	7C272684273F9F1D45E1A05E24ABB82CB4CEEE568D7C96296F955E3B11C50C56

Key	Value
MD5	6D1A6D85266C8CB2A99E07FEE878885F
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.
PackageMaintainer	Fedora Project
PackageName	Agda
PackageRelease	30.fc34
PackageVersion	2.6.1
SHA-1	29E757E8D33937BAE129FA89C30699962E38B217
SHA-256	C30F3075B376FE7CD05511ADEB7E8C5D595A4479B49A80AF245B752407F6E7E9

Key	Value
FileSize	44818592
MD5	82C6FD45246BD1F78958B8A90C0AD31A
PackageDescription	dependently typed functional programming language 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 provides a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainer	Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageName	libghc-agda-dev
PackageSection	haskell
PackageVersion	2.6.1-1+b2
SHA-1	C39338F9446B7B44791B9EC3FE12E16DB74D4989
SHA-256	311047FB83A048E6A41203E2183F31443D3B602AD3E74CBABF6A3ECAC70FDA29

Key	Value
FileSize	37913588
MD5	54ACEAD8030978140E4D944AEAE3FC17
PackageDescription	dependently typed functional programming language 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 provides a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libghc-agda-dev
PackageSection	haskell
PackageVersion	2.6.1-1build2
SHA-1	F7A7D312553C5099C2C6E64BAB8D5270DA4D2878
SHA-256	720E227529E3A19E79DC6CC873F2C19F0C4EAC0E9470BB5D3B7D4AEB283508D4