%0 Journal Article
%T Structures definable in polymorphism<br>Structures Definable in Polymorphism
%A Fu Yuxi
%A <br>Fu
%A Yuxi
%J 计算机科学技术学报
%D 1998
%I 
%X Encodings in polymorphism with finite product types are considered. These encodings aregiven in terms of I-algebras. They have the property that the ground terms are precisely theclosed normal terms of the encoded types. The proof of a well-known result is transplantedto the setting and it is shown why weak recursion is admissible. The paper also shows how tocarry out the dual encodingS using the existential quantifier.
%K Polymorphic types
%K type theory<br>多形计算机系统
%K 编码
%K 打印
%K I－代数学
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=0BD724EC006C854FB35B673924F5D3DB&yid=8CAA3A429E3EA654&vid=FC0714F8D2EB605D&iid=B31275AF3241DB2D&sid=57EA20F731155703&eid=D5970ECA7D10A7B1&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=28