Sciweavers

8 search results - page 2 / 2
» Coinductive Axiomatization of Recursive Type Equality and Su...
Sort
View
MST
2008
119views more  MST 2008»
13 years 5 months ago
Logical Equivalence for Subtyping Object and Recursive Types
Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalised throu...
Steffen van Bakel, Ugo de'Liguoro
LICS
2000
IEEE
13 years 9 months ago
Efficient and Flexible Matching of Recursive Types
Equality and subtyping of recursive types have been studied in the 1990s by Amadio and Cardelli; Kozen, Palsberg, and Schwartzbach; Brandt and Henglein; and others. Potential appl...
Jens Palsberg, Tian Zhao
SCP
2010
155views more  SCP 2010»
13 years 3 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay