Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Fundamenta Informaticae

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Infinitary Axiomatization of the Equational Theory of Context-Free Languages

Grathwohl N. B. B., Henglein F., Kozen D.

Fundamenta Informaticae

2017

Vol. 150, nr 3/4

241--257

We give a natural complete infinitary axiomatization of the equational theory of the context-free languages, answering a question of Leiß (1992).

Coinductive axiomatization of recursive type equality and subtyping

Brandt M., Henglein F.

Fundamenta Informaticae

1998

Vol. 33, nr 4

309-338

We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by coinductive characterizations of type containment and type equality via simulation and bisimulation, respectively. The main novelty of the axiomatization is the fixpoint rule (or coinduction principle). It states that from A,Pý P one may deduce Aý P, where P is either a type equality t = t1 or type containment t