8 search results - page 1 / 2 » Coinductive Axiomatization of Recursive Type Equality and Su... |
TLCA
1997
Springer
13 years 9 months ago
1997
Springer
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 ...
MPC
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. It is natural to present subtyping for recursive types coinductively. However, Gapeyev, Levin and Pierce have noted that there is a problem with coinductive definitions ...
TLCA
2001
Springer
13 years 9 months ago
2001
Springer
Using methods drawn from Game Semantics, we build a sound and computationally adequate model of a simple calculus that includes both subtyping and recursive types. Our model solves...
TLCA
2005
Springer
13 years 10 months ago
2005
Springer
This work sets the formal bases for building tools that help retrieve classes in object-oriented libraries. In such systems, the user provides a query, formulated as a set of class...
ENTCS
2007
13 years 4 months ago
2007
This paper is concerned with a proof-theoretic observation about two kinds of proof systems for regular cyclic objects. It is presented for the case of two formal systems that are...