Result for 7675DCAFBF864AEA672C5F2F05081BB9DBAB424B

Query result

Key Value
FileName./usr/share/doc/libghc-agda-doc/README.gz
FileSize3525
MD555B6A5B0AA6A46DB9D702593B652039B
SHA-17675DCAFBF864AEA672C5F2F05081BB9DBAB424B
SHA-25665A01B8E3A63ECE4F92A9C82B09B828592FCB0185E9CF3F0EF680469B686CD56
SSDEEP96:R78i74TodazwcarEIEWmoNRYQ3auWFYUXURvmM:xv74Tpw5ERWmuauWFnX4vmM
TLSHT124717DB2688D2733146B05FC3608237797D8C7D5D4860EE775BD65F1301EC928DB066A
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
FileSize44936
MD526C157AD10CC0F305AE0665B52A8CE52
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.0.1-2build1
SHA-11AB9184BB3FAFEF99AE9BADA64BFBB851E8E7D4D
SHA-256EF5D9DF811584E257FCC412A938AF895E9619E49865A944CA0649AC6478844D7
Key Value
FileSize16454650
MD5C6955F45C7266E4CB1A08AAD86BB633A
PackageDescriptiondependently typed functional programming language - development libraries 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 normal library files.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-agda-dev
PackageSectionhaskell
PackageVersion2.3.0.1-1build2
SHA-1025FFC1590518255D0FF4DA907F429084A0D210B
SHA-2561F98EF386C61E1C8F1C53455C75DC89C4DCCC697E19B499BF6C2DB2803CB919B
Key Value
FileSize12537544
MD54E631B39A8EC3CD454CB84E55CD1B2BF
PackageDescriptiondependently typed functional programming language - development libraries 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 normal library files.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-agda-dev
PackageSectionhaskell
PackageVersion2.3.0.1-2build1
SHA-13907E7AB8D1C888D6E8EE0D230E009BCE04A154D
SHA-25648953699D22C535604B34FAD122079A069BD9FAB9E37DA108E80A87EBE7C8097
Key Value
FileSize13190090
MD509E6CA49340C1411A2C1A50212DA2E83
PackageDescriptiondependently typed functional programming language - development libraries 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 normal library files.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-agda-dev
PackageSectionhaskell
PackageVersion2.3.0.1-2build1
SHA-13780586C8B036AC0DE7D8739B29400669C16998C
SHA-2566645888F536FB2E0C934AABBE1E208584AD73CB627DCDC76E691C7E6C3017071
Key Value
FileSize18871022
MD59B3FCB94C07BB2F00B158EB23AC331E0
PackageDescriptiondependently typed functional programming language - development libraries 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 normal library files.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-agda-dev
PackageSectionhaskell
PackageVersion2.3.0.1-2build1
SHA-1B332BD9A5BF26BFFA4566053B0B01760756ED98E
SHA-2566A2BE5708BEDC88D08FCE3864FC4D9A2896D132F90E96BCBF2BD9069C5D2EC13
Key Value
FileSize18722962
MD572E4F99D4BCA1D11280B913692817FFB
PackageDescriptiondependently typed functional programming language - development libraries 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 normal library files.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-agda-dev
PackageSectionhaskell
PackageVersion2.3.0.1-1build2
SHA-1FDAF36DB2245C328A3F25969BFE3FEDE984119DE
SHA-256CDA84FE2B559F5378149C7077D60EE9D2C3B6F01506E7A9014642C0AF5AB13C9
Key Value
FileSize16575618
MD5228A3E11BF40B9A20AED71F96B40D885
PackageDescriptiondependently typed functional programming language - development libraries 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 normal library files.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-agda-dev
PackageSectionhaskell
PackageVersion2.3.0.1-2build1
SHA-1283EF70CD010FDC245FDBF20508748A6B3DF560B
SHA-25610C253DF5BD5EC501A78CF7CCFE77EA57CDFE13401572BFB2FA89BEC4E766063
Key Value
FileSize13034196
MD57F9831011453F89FA2EE92AE8216C4AF
PackageDescriptiondependently typed functional programming language - development libraries 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 normal library files.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-agda-dev
PackageSectionhaskell
PackageVersion2.3.0.1-1build2
SHA-1754BB2D207644A949A4265645405C6C4BF7E9211
SHA-25699763CB396A7BF99FF3D9DBF82FC51A7D7E50F5F8C968CA201840DE4B949098A
Key Value
FileSize12390688
MD5FE9C4DACE0B6890CE20408B1B27104C2
PackageDescriptiondependently typed functional programming language - development libraries 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 normal library files.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-agda-dev
PackageSectionhaskell
PackageVersion2.3.0.1-1build2
SHA-1B13AEF5B16AD073E276527901781050EF4D3A916
SHA-256B3904DA7D4285BAE7092FEA10F30B60EA15B9163383D9F1202AB849AAC6D86F5
Key Value
FileSize17730002
MD580D45461DD8C1B43D6DD189387A4BCCF
PackageDescriptiondependently typed functional programming language - development libraries 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 normal library files.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-agda-dev
PackageSectionhaskell
PackageVersion2.3.0.1-2build1
SHA-18E1D776782CA49B9AC7B17D580A8086040D13CEE
SHA-256BAA70D8BE777FAD4991393590FBBE3A41816A6995D35C1D23EE5AE014E658280
Key Value
FileSize18716716
MD5FD3FB1B2B02FE189864DB4AF440A25B8
PackageDescriptiondependently typed functional programming language - development libraries 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 normal library files.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-agda-dev
PackageSectionhaskell
PackageVersion2.3.0.1-1build2
SHA-1A7B1F771821D0FFD91F07B29854B1553ECFCA0E5
SHA-256B5959C5B73495D3B58101A1E64EB49BAB5201142E04B76E628ED38046DDCB29F
Key Value
FileSize1687042
MD524E733B39043DFF3A1B62BE36000B8DA
PackageDescriptiondependently typed functional programming language - documentation 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 documentation files.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-agda-doc
PackageSectiondoc
PackageVersion2.3.0.1-1build2
SHA-16ECDAF01F7DD7339014CC2EAE2E3D98043D3C419
SHA-256541FE36ECCA779006EA7FE3900C3327F8136597774806CD5AAD8182CB43942DF
Key Value
FileSize1768608
MD5855F66578A04BF51EE362483E2D1E5D0
PackageDescriptiondependently typed functional programming language - documentation 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 documentation files.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-agda-doc
PackageSectiondoc
PackageVersion2.3.0.1-2build1
SHA-1945FBDE44DA46714AA1EB5599D39874BFB5646FE
SHA-25665179A83A1D0EE63FCBA80078F27043533A6BE6E6D7553095A55A5F7080B1C82
Key Value
FileSize40830
MD5D2224AB894BE548B16250B9B1728E664
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.0.1-1build2
SHA-1A7A04856917865B9C5828BB421A8E6077861110B
SHA-25670ACFB893EC7DF7B6D3EF9A3F726E927C8A21B37FE948F6990FF14D592EABAC5