Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The First-Order Theory of Subtyping Constraints Zhendong Su Alexander Aiken
 

Summary: The First-Order Theory of Subtyping Constraints
Zhendong Su Alexander Aiken
Computer Science Division
University of California
Berkeley, CA 94720
http://www.cs.berkeley.edu/~{zhendong,aiken}
Joachim Niehren Tim Priesnitz
Programming Systems Lab
Universit¨at des Saarlandes
Saarbr¨ucken, Germany
http://www.ps.uni-sb.de/~{niehren,tim}
Ralf Treinen
LRI, Universit´e Paris-Sud
F91405 Orsay cedex, France
http://www.lri.fr/~treinen
Abstract
We investigate the first-order theory of subtyping con-
straints. We show that the first-order theory of non-
structural subtyping is undecidable, and we show that in the
case where all constructors are either unary or nullary, the

  

Source: Aiken, Alex - Department of Computer Science, Stanford University
Su, Zhendong - Department of Computer Science, University of California, Davis
Treinen, Ralf - Laboratoire Preuves, Programmes et Systèmes, Université Paris 7 - Denis Diderot

 

Collections: Computer Technologies and Information Sciences