Wyniki wyszukiwania - Biblioteka Nauki

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

2 Fundamenta Informaticae

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

A subtyping for extensible, incomplete objects

100%

Bono V. , Bugliesi M. , Dezani-Ciancaglini M. , Liquori L.

1999

tom Vol. 38, Nr 4

325-364

We extend the type system for the Lambda Calculus of Objects with a mechanism of width subtyping and a treatment of incomplete objects. The main novelties over previous work are the use of subtype-bounded quantification to capture a new and more direct rendering of MyType polymorphism, and a uniform treatment for other features that were accounted for via different systems in subsequent extensions. The new system provides for (i) appropriate type specialization of inherited methods, (ii) static detection of errors, (iii) width subtyping compatible with object extension, and (iv) sound typing for partially specified objects.

A Formalism for the Description of Protein Interaction Dedicated to Jerzy Tiuryn on the Occasion of His Sixty Birthday

88%

Barbuti R. , Dezani-Ciancaglini M. , Maggiolo-Schettini A. , Milazzo P. , Troina A.

2010

tom Vol. 103, nr 1-4

1-29

The Calculus of Looping Sequences is a formalism for describing evolution of biological systems by means of term rewriting rules. We propose to enrich this calculus by labelling elements of sequences. Since two elements with the same label are considered to be linked, this allows us to represent protein interaction at the domain level. Well-formedness of terms are ensured by both a syntactic constraint and a type system: we discuss the differences between these approaches through the description of a biological system, namely the EGF pathway.