✦ LIBER ✦

Languages for Coalgebras on Datafunctors

✍ Scribed by Martin Rößiger

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 294 KB
Volume: 19
Category: Article
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80268-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Expressivity and Compositionality in

On Expressivity and Compositionality in Logics for Coalgebras

✍ Corina Cîrstea 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 242 KB

Remarks on formal languages for writing

Remarks on formal languages for writing proofs

✍ K. P. Vershinin 📂 Article 📅 1974 🏛 Springer US 🌐 English ⚖ 322 KB

On the decidability of homomorphism equi

On the decidability of homomorphism equivalence for languages

✍ K. Culik II; Arto Salomaa 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 779 KB

Complexity classes without machines: On

Complexity classes without machines: On complete languages for UP

✍ Juris Hartmanis; Lane A. Hemachandra 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 1012 KB

Considerations on Language interpretatio

Considerations on Language interpretation for microprocessor systems

✍ W. Mackrodt 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 816 KB

On Instance-Completeness for Database Qu

On Instance-Completeness for Database Query Languages involving Object Creation

✍ Marc Andries; Jan Paredaens 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 838 KB

In 1978 Bancilhon and Paredaens introduced a notion of completeness for relational database languages on instance-level. Their criterion was subsequently called BP-completeness. Since then, it was used frequently in the context of other database models. However, its application in the context of lan