Parents (Total: 53)

The searched file hash is included in 53 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
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
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
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
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	F5CEF03A75240436F31932A158B1F453
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	21.fc32
PackageVersion	2.6.0.1
SHA-1	260B42E4074F93F6B22EE6128B94E8A8EAD44531
SHA-256	4281A4D5209C8C93CFE738A096B73FE162A17F63454E7F4E6C2B1BCC6F906619

Key	Value
FileSize	40852
MD5	3F490A99AB3402920ECFC0F902255D82
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.3-3build1
SHA-1	26F5D065494E67791F4470427937C1B34DBFFE89
SHA-256	0A529F8576860EC9BCFA0624F4D557F45ED4326ADA3AE5864ACCE235E259635C

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