de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Fsub with Recursive Types: `Types-as-Propositions' Interpretations M. Rabin's S2S

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45677

Vorobyov,  Sergei
Computational Biology and Applied Algorithmics, MPI for Informatics, Max Planck Society;
Programming Logics, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Vorobyov, S. (1995). Fsub with Recursive Types: `Types-as-Propositions' Interpretations M. Rabin's S2S. In Proceedings of JFLA'95: Journées Francophones des Langages Applicatifs (JFLA'95) (pp. 49-73). Rocquencourt, France: INRIA.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-AD00-C
Abstract
Subtyping judgments of the polymorphic second-order typed lambda-calculus Fsub extended by recursive types and different known inference rules for these types could be interpreted in S2S, M.Rabin's monadic second-order theory of two successor functions. On the one hand, this provides a comprehensible model of the parametric and inheritance polymorphisms over recursive types, on the other, proves that the corresponding subtyping theories are not essentially undecidable, i.e., possess consistent decidable extensions.