Parents (Total: 75)

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

Key	Value
FileSize	1698660
MD5	C8544A9E4EF06C3C818DBE48BE1DA7DD
PackageDescription	XQuery implementation with static typing - documentation Galax is an implementation of XQuery, the W3C XML Query Language. . Galax implements XQuery 1.0 as specified by the W3C, as well as XPath 2.0, which is subset of XQuery 1.0. . Galax is a Schema-aware implementation of XQuery and supports static typing. Also thanks to that, Galax is a really fast implementation of the language. . Galax supports some advanced XQuery features, such as XML Schema validation, XML updates, XQuery optimization and projection, applications of XQuery to Web services. . This package contains the Galax documentation. User's and reference manuals are provided, as well as the OCaml API reference for the Galax library.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	galax-doc
PackageSection	doc
PackageVersion	1.1-7build2
SHA-1	03A2A41174D9C17F26F3DDC8E7F036D490F42544
SHA-256	BC4B0358E7B629176E00F5046C34920F7C2DE81B53CCE62F2506EB3A3E9921E0

Key	Value
FileSize	678724
MD5	598AC54F792A0F53157CF500DEA3299A
PackageDescription	Manual of the frown parser generator for Haskell 98 The manual and examples of the frown LALR(k) parser generator. , Frown is inspired by the parser generator Happy and uses a syntax quite simular as the syntax used by Happy. Happy only handles LALR(1) grammars while Frown can use more extensive LALR(k) grammars and the parsers generated by Frown are also faster than the parsers generated by Happy. . The salient features of Frown are: - The generated parsers are time and space efficient. On the downside, the parsers are quite large. - Frown generates four different types of parsers. As a common characteristic, the parsers are genuinely functional (ie 'table-free'); the states of the underlying LR automaton are encoded as mutually recursive functions. Three output formats use a typed stack representation, one format due to Ross Paterson (code=stackless) works even without a stack. - Encoding states as functions means that each state can be treated individually as opposed to a table driven-approach, which necessitates a uniform treatment of states. For instance, look-ahead is only used when necessary to resolve conflicts. - Frown comes with debugging and tracing facilities; the standard output format due to Doaitse Swierstra (code=standard) may be useful for teaching LR parsing. - Common grammatical patterns such as repetition of symbols can be captured using rule schemata. There are several predefined rule schemata. - Terminal symbols are arbitrary variable-free Haskell patterns or guards. Both terminal and nonterminal symbols may have an arbitrary number of synthesized attributes. - Frown comes with extensive documentation; several example grammars are included. . Furthermore, Frown supports the use of monadic lexers, monadic semantic actions, precedences and associativity, the generation of backtracking parsers, multiple start symbols, error reporting and a weak form of error correction.
PackageMaintainer	Ubuntu MOTU Developers <ubuntu-motu@lists.ubuntu.com>
PackageName	frown-doc
PackageSection	doc
PackageVersion	0.6.1-8
SHA-1	040FE0A775057711304D7D095F396756A57F46DF
SHA-256	495F1F169D78DF7236316921D5F370148BF113A4467B278F412934F8E3F3E2C2

Key	Value
MD5	1D1FBBB7346EB2328EE055DB5E1A6285
PackageArch	x86_64
PackageDescription	An interactive geometry program that allows the construction of interactive geometric figures. It is oriented towards education.
PackageName	drgeo
PackageRelease	1.1
PackageVersion	12.10a
SHA-1	0555A3F004CE5A1B796E6D2871FB221ABD273965
SHA-256	B0DCB17DC71800D285C2DF5116FFFFA140541427A85FC8433D84EE34F8EEE9DB

Key	Value
FileSize	1865734
MD5	EDA7B15E16DBC28B2383C21C6D2029FD
PackageDescription	XQuery implementation with static typing - documentation Galax is an implementation of XQuery, the W3C XML Query Language. . Galax implements XQuery 1.0 as specified by the W3C, as well as XPath 2.0, which is subset of XQuery 1.0. . Galax is a Schema-aware implementation of XQuery and supports static typing. Also thanks to that, Galax is a really fast implementation of the language. . Galax supports some advanced XQuery features, such as XML Schema validation, XML updates, XQuery optimization and projection, applications of XQuery to Web services. . This package contains the Galax documentation. User's and reference manuals are provided, as well as the OCaml API reference for the Galax library.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	galax-doc
PackageSection	doc
PackageVersion	1.1-6build1
SHA-1	0C13098FA49B35BA1C98CD9909C37AB7731ED584
SHA-256	5117FD209008C80A4EFB033E83B54D0CEA057C2FDCBB1EB9DDCBFA11ADC38362

Key	Value
MD5	72A13A7C5887231F263C3E23D42757A4
PackageArch	noarch
PackageDescription	Coq is a formal proof management system. It allows for the development of theorems through first order logic that are mechanically checked by the machine. Sets of definitions and theorems can be saved as compiled modules and loaded into the system. This package provides documentation and tutorials for the system. The main documentation comes in two parts: the main Library documentation, which describes all Coq.* modules, and the Reference Manual, which gives a more complete description of the whole system. Included are also HTML versions of both. Furthermore, there are two tutorials, the main one, and one specifically on recursive types. The example code for the latter is also included.
PackageMaintainer	Fedora Project
PackageName	coq-doc
PackageRelease	1.fc24
PackageVersion	8.5pl1
SHA-1	0DE3D54C744029E2FC9E62EEFE09511E61A8D998
SHA-256	AD1C030778F66EC404F4F4328BBCD4221FC1C73C98CAC0648A35460C05A9EB96

Key	Value
FileSize	678736
MD5	638386344253EB989DBD662E3D30E68C
PackageDescription	Manual of the frown parser generator for Haskell 98 The manual and examples of the frown LALR(k) parser generator. , Frown is inspired by the parser generator Happy and uses a syntax quite simular as the syntax used by Happy. Happy only handles LALR(1) grammars while Frown can use more extensive LALR(k) grammars and the parsers generated by Frown are also faster than the parsers generated by Happy. . The salient features of Frown are: - The generated parsers are time and space efficient. On the downside, the parsers are quite large. - Frown generates four different types of parsers. As a common characteristic, the parsers are genuinely functional (ie 'table-free'); the states of the underlying LR automaton are encoded as mutually recursive functions. Three output formats use a typed stack representation, one format due to Ross Paterson (code=stackless) works even without a stack. - Encoding states as functions means that each state can be treated individually as opposed to a table driven-approach, which necessitates a uniform treatment of states. For instance, look-ahead is only used when necessary to resolve conflicts. - Frown comes with debugging and tracing facilities; the standard output format due to Doaitse Swierstra (code=standard) may be useful for teaching LR parsing. - Common grammatical patterns such as repetition of symbols can be captured using rule schemata. There are several predefined rule schemata. - Terminal symbols are arbitrary variable-free Haskell patterns or guards. Both terminal and nonterminal symbols may have an arbitrary number of synthesized attributes. - Frown comes with extensive documentation; several example grammars are included. . Furthermore, Frown supports the use of monadic lexers, monadic semantic actions, precedences and associativity, the generation of backtracking parsers, multiple start symbols, error reporting and a weak form of error correction.
PackageMaintainer	Ubuntu MOTU Developers <ubuntu-motu@lists.ubuntu.com>
PackageName	frown-doc
PackageSection	doc
PackageVersion	0.6.1-8
SHA-1	0EF5E02F509A4D6CA0D4AEA975D0A0FA910C0100
SHA-256	D3D1174C850B551A52AC5B4F61AC0B93371667165DF259383D28B09498893091

Key	Value
FileSize	415730
MD5	8E3CF067AFA4C244A8266919B5F6E85D
PackageDescription	documentation for Coq in html format Coq is a proof assistant for higher-order logic, which allows the development of computer programs consistent with their formal specification. It is developed using Objective Caml and Camlp5. . This package contains its documentation and tutorials in html format.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	coq-doc-html
PackageSection	non-free/doc
PackageVersion	8.4pl4-2
SHA-1	11F7B783916C028594BA7AF40CD3E7CC3B86EC3C
SHA-256	E97F5A4941486399AC576EF0173B68B71B54325175365EDFB7BC48ABEA7F55F3

Key	Value
FileSize	278078
MD5	88683B912D7A5208281D39ED60607754
PackageDescription	Documentation for FreeFEM (html and pdf) FreeFEM is a language adapted to Partial Differential equation. The underlying method used is the Finite Element Method. This tool has been successfully used as a teaching tool and even as a research tool.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	freefem-doc
PackageSection	math
PackageVersion	3.5.8-4.2
SHA-1	1B96131B28F8A0E0EEB9233095E1887A79419553
SHA-256	7211860DE8CDC7D81E2B0B11F5E6F75A8105098432BB8FEFD96286BC131C648E

Key	Value
FileSize	563396
MD5	5180FE28B5F47328886488547BF2785A
PackageDescription	Manual of the frown parser generator for Haskell 98 The manual and examples of the frown LALR(k) parser generator. , Frown is inspired by the parser generator Happy and uses a syntax quite simular as the syntax used by Happy. Happy only handles LALR(1) grammars while Frown can use more extensive LALR(k) grammars and the parsers generated by Frown are also faster than the parsers generated by Happy. . The salient features of Frown are: - The generated parsers are time and space efficient. On the downside, the parsers are quite large. - Frown generates four different types of parsers. As a common characteristic, the parsers are genuinely functional (ie 'table-free'); the states of the underlying LR automaton are encoded as mutually recursive functions. Three output formats use a typed stack representation, one format due to Ross Paterson (code=stackless) works even without a stack. - Encoding states as functions means that each state can be treated individually as opposed to a table driven-approach, which necessitates a uniform treatment of states. For instance, look-ahead is only used when necessary to resolve conflicts. - Frown comes with debugging and tracing facilities; the standard output format due to Doaitse Swierstra (code=standard) may be useful for teaching LR parsing. - Common grammatical patterns such as repetition of symbols can be captured using rule schemata. There are several predefined rule schemata. - Terminal symbols are arbitrary variable-free Haskell patterns or guards. Both terminal and nonterminal symbols may have an arbitrary number of synthesized attributes. - Frown comes with extensive documentation; several example grammars are included. . Furthermore, Frown supports the use of monadic lexers, monadic semantic actions, precedences and associativity, the generation of backtracking parsers, multiple start symbols, error reporting and a weak form of error correction.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	frown-doc
PackageSection	doc
PackageVersion	0.6.1-12
SHA-1	1D40ADBA5EC953E0BCE1590136FD2CA275DB1C62
SHA-256	B919057C84A5A8CE102391CD36B6583B25E51B4421A2D6C3AF74BBE6F887071E

Key	Value
FileName	http://archlinux.mirror.root.lu//pool//community//xcas-1.6.0.47-1-x86_64.pkg.tar.zst
MD5	A76CF3D38A99E6BBBD433894B7B54E70
SHA-1	24EEAAF217DBE327DD2C22FC893E6C0F72E6AFC1
SHA-256	EB7B82374603ECC6A38EAE00813B46F6496EBF51F9F9124F6E8E7469CCA9EC06
SSDEEP	786432:8mIhY/BGc4Jbn9HeCdkl03JTqA+/vMi7Mt1+FvDcRnsj8YRIo2IOQii7+TZ:8/+/F4Tdkl03JTquMvDcxeRIOOQii7+F
TLSH	T1A2973387BDC4DED19B394C71603A58F320A808FA18A4ADF59317F6D0496BA357F12B8D