[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"doc-detail-86202-en":3,"doc-seo-86202-105":29,"detail-sidebar-cat-0-en-105":91},{"code":4,"msg":5,"data":6},0,"success",{"doc_id":7,"user_id":8,"nickname":9,"user_avatar":10,"doc_module":4,"category_id":11,"category_name":12,"doc_title":13,"doc_description":14,"doc_content":15,"file_id":16,"file_url":17,"file_type":18,"file_size":19,"view_count":20,"is_deleted":4,"is_public":20,"is_downloadable":20,"audit_status":20,"page_count":21,"language":22,"language_code":23,"site_id":24,"html_lang":23,"table_of_contents":25,"faqs":26,"seo_title":13,"seo_description":14,"update_tm":27,"read_time":28},86202,1374391974564,"Clementine","https://ap-avatar.wpscdn.com/avatar/14000253aa45c000a9e?x-image-process=image/resize,m_fixed,w_180,h_180&k=1779874745381141002",8,"Research & Report","Fuss-free cumulative universes theory and practice","Fuss-free cumulative universes develops a simpler algebraic account of polymorphic cumulative universes in dependent type theory. It replaces the intricate framework of coherent universe coercions with a new generalized algebraic presentation, proved equivalent to the original via a normalisation theorem. Utility is supported by a formal specification of a bidirectional elaboration algorithm and an executable Haskell implementation. The work further extends the universe hierarchy with a judgemental datatype description notion enabling derivations of prior cumulative inductive type concepts.","arXiv :2607 . 1 1329v 1 [ cs .PL] 13 Jul 2026  \nFuss-free cumulative universes: theory and practice  \nExtended version with supplementary appendices  \nRAPHAËL STERBAC, ENS Paris-Saclay —Université Paris-Saclay, France JONATHAN STERLING, University of Cambridge, United Kingdom  \nUniverses are central to dependent type theory, and they are notoriously difficult to handle in a way that is both correct and usable. We propose a new “fuss-free” generalised algebraic presentation for polymorphic cumulative universes that dispenses with the intricate theory of coherent universe coercions in favour of a simpler formulation, which we prove equivalent by means of a normalisation theorem for the former. Evidence for the utility of the fuss-free formulation is provided in the form of (1) an abstract specification of its bidirectional elaboration algorithm, and (2) a concrete implementation in Haskell. We also describe and implement an extension of the fuss-free universe hierarchy with a judgemental notion of datatype description from which prior notions of cumulative inductive type may be derived.  \n1 Introduction  \nIn dependently typed programming languages like Lean, Rocq, and Agda, universes turn types into ordinary data that can be taken as arguments, returned from functions, and even embedded in more complex data structures. This is achieved by introducing a type U whose elements encode types:  \nuniv-formation  \nΓ ⊢ U type  \nuniv-decoding  Γ ⊢ 􀀖 : U Γ ⊢ el (􀀖) type  \nIt is important that we do not have an inverse to the decoding function el, for if U can be encoded by an element of U, then the type system becomes inconsistent in the sense that every type becomes inhabited. More importantly, the intended semantic models of type theory (e.g. sets!) would be lost. Instead, we must arrange for the universe U to be closed under the connectives of type theory; for example, in addition to the usual formation rule for the dependent function space, we need a  \nseparate rule targeting the universe:  \ndfun-formation  \nΓ ⊢ 􀀖 type Γ, 􀁇 : 􀀖 ⊢ 􀀗 [􀁇] type Γ ⊢ (􀁇 : 􀀖) → 􀀗 [􀁇] type  \ndfun-code-formation  \nΓ ⊢ 􀀢 : U Γ, 􀁇 : el (􀀢) ⊢ 􀀣 [􀁇] : U Γ ⊢ (􀁇 : 􀀢) →U 􀀣 [􀁇] : U  \ndfun-decoding  \n Γ ⊢ 􀀢 : U Γ, 􀁇 : el (􀀢) ⊢ 􀀣 [􀁇] : U Γ ⊢ el 􀀀 (􀁇 : 􀀢) →U 􀀣 [􀁇]􀀁 = (􀁇 : el (􀀢)) → el (􀀣 [􀁇]) type  \nThe decoding function el(−) and the subscripts → U are implicit in most production systems; it is nonetheless important for the “official” rules of the type theory to be fully explicit, as it is with respect only to the explicit version that appropriate notions of model can be specified. Implicit presentations of the calculus are then justified by proving metatheorems about the explicit syntax:  \nProposition 1.1 . In intensional Martin-Löf type theory with one universe, the decoding function is injective in the sense that the following rule is admissible:  \nuniv-decoding-inj  \nΓ ⊢ 􀀢, 􀀣 : U Γ ⊢ el (􀀢) = el (􀀣 ) type Γ ⊢ 􀀢 = 􀀣 : U  \nAuthors’ Contact Information: Raphaël Sterbac, [raphael.sterbac@ens-paris-saclay.fr](raphael.sterbac@ens-paris-saclay.fr), ENS Paris-Saclay —Université ParisSaclay, Gif-sur-Yvette, France; Jonathan Sterling, [js2878@cl.cam.ac.uk](js2878@cl.cam.ac.uk), Computer Laboratory, University of Cambridge, Cambridge, United Kingdom.  \n2 Raphaël Sterbac and Jonathan Sterling  \nIt is the combination of dfun-decoding and univ-decoding-inj that justifies an implicit syntax in which el is silent and → U is written as → . The failure of dfun-decoding would lead to nonsensical error messages like “( _ : N) → N could not be unified with ( _ : N) → N”. The role ofuniv-decoding-inj is more subtle: we argue that the notional meaning of a silent coercion from the universe to the class of all types must be an inclusion, and inclusions are always injective.  \n1.1 Background: type theory with multiple universes  \nAlthough most of pure mathematics can in principle be formalised without more than one universe [42], it can be very inconvenient to do so. For this reason, most pr","cbCaiu52Kx3fhixP","https://ap.wps.com/l/cbCaiu52Kx3fhixP","pdf",828897,1,34,"English","en",105,"# Introduction\n## Universe formation and decoding\n## Background: type theory with multiple universes\n## Cumulativity and universe hierarchies","[{\"question\":\"What problem does the paper address in dependent type theory universes?\",\"answer\":\"Universes are central but difficult to handle in a way that is both correct and usable. The paper targets complications caused by the usual theory of coherent universe coercions in polymorphic cumulative universes.\"},{\"question\":\"What is the core contribution of the “fuss-free” formulation?\",\"answer\":\"It proposes a new generalized algebraic presentation for polymorphic cumulative universes that dispenses with the intricate coercion theory. The paper proves the new formulation equivalent to the former one using a normalisation theorem.\"},{\"question\":\"How is the usefulness of the fuss-free approach demonstrated?\",\"answer\":\"The authors provide an abstract specification of a bidirectional elaboration algorithm and a concrete Haskell implementation. They also describe an extension of the universe hierarchy with a judgemental notion of datatype description.\"}]",1784209372,86,{"code":4,"msg":30,"data":31},"ok",{"site_id":24,"language":23,"slug":32,"title":13,"keywords":33,"description":14,"schema_data":34,"social_meta":86,"head_meta":88,"extra_data":90,"updated_unix":27},"fuss-free-cumulative-universes-theory-and-practice","",{"@graph":35,"@context":85},[36,53,68],{"@type":37,"itemListElement":38},"BreadcrumbList",[39,43,47,50],{"item":40,"name":41,"@type":42,"position":20},"https://docshare.wps.com","Home","ListItem",{"item":44,"name":45,"@type":42,"position":46},"https://docshare.wps.com/document/","Document",2,{"item":48,"name":12,"@type":42,"position":49},"https://docshare.wps.com/document/research-report/",3,{"item":51,"name":13,"@type":42,"position":52},"https://docshare.wps.com/document/fuss-free-cumulative-universes-theory-and-practice/86202/",4,{"url":51,"name":13,"@type":54,"author":55,"headline":13,"publisher":57,"fileFormat":60,"inLanguage":23,"description":14,"dateModified":61,"datePublished":62,"encodingFormat":60,"isAccessibleForFree":63,"interactionStatistic":64},"DigitalDocument",{"name":9,"@type":56},"Person",{"url":40,"name":58,"@type":59},"DocShare","Organization","application/pdf","2026-07-17","2026-07-16",true,{"@type":65,"interactionType":66,"userInteractionCount":20},"InteractionCounter",{"@type":67},"ViewAction",{"@type":69,"mainEntity":70},"FAQPage",[71,77,81],{"name":72,"@type":73,"acceptedAnswer":74},"What problem does the paper address in dependent type theory universes?","Question",{"text":75,"@type":76},"Universes are central but difficult to handle in a way that is both correct and usable. The paper targets complications caused by the usual theory of coherent universe coercions in polymorphic cumulative universes.","Answer",{"name":78,"@type":73,"acceptedAnswer":79},"What is the core contribution of the “fuss-free” formulation?",{"text":80,"@type":76},"It proposes a new generalized algebraic presentation for polymorphic cumulative universes that dispenses with the intricate coercion theory. The paper proves the new formulation equivalent to the former one using a normalisation theorem.",{"name":82,"@type":73,"acceptedAnswer":83},"How is the usefulness of the fuss-free approach demonstrated?",{"text":84,"@type":76},"The authors provide an abstract specification of a bidirectional elaboration algorithm and a concrete Haskell implementation. They also describe an extension of the universe hierarchy with a judgemental notion of datatype description.","https://schema.org",{"og:url":51,"og:type":87,"og:title":13,"og:site_name":58,"og:description":14},"article",{"robots":89,"canonical":51},"index,follow",{"doc_id":7,"site_id":24},{"code":4,"msg":5,"data":92},[93,97,101,105,110,115,120,123,128,131,135],{"id":20,"doc_module":4,"doc_module_name":45,"category_name":94,"show_sort_weight":95,"slug":96},"Story & Novel",90,"story-novel",{"id":46,"doc_module":4,"doc_module_name":45,"category_name":98,"show_sort_weight":99,"slug":100},"Literature",80,"literature",{"id":52,"doc_module":4,"doc_module_name":45,"category_name":102,"show_sort_weight":103,"slug":104},"Exam",70,"exam",{"id":106,"doc_module":4,"doc_module_name":45,"category_name":107,"show_sort_weight":108,"slug":109},5,"Comic",60,"comic",{"id":111,"doc_module":4,"doc_module_name":45,"category_name":112,"show_sort_weight":113,"slug":114},6,"Technology",50,"technology",{"id":116,"doc_module":4,"doc_module_name":45,"category_name":117,"show_sort_weight":118,"slug":119},7,"Healthcare",40,"healthcare",{"id":11,"doc_module":4,"doc_module_name":45,"category_name":12,"show_sort_weight":121,"slug":122},30,"research-report",{"id":124,"doc_module":4,"doc_module_name":45,"category_name":125,"show_sort_weight":126,"slug":127},9,"Religion & Spirituality",20,"religion-spirituality",{"id":126,"doc_module":4,"doc_module_name":45,"category_name":129,"show_sort_weight":126,"slug":130},"World Cup","world-cup",{"id":132,"doc_module":4,"doc_module_name":45,"category_name":133,"show_sort_weight":132,"slug":134},10,"Lifestyle","lifestyle",{"id":136,"doc_module":4,"doc_module_name":45,"category_name":137,"show_sort_weight":106,"slug":138},19,"General","general"]