Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Dybjer:1997:RID, author = "P. Dybjer", title = "Representing inductively defined sets by wellorderings in {Martin-L{\"o}f}'s type theory", journal = j-THEOR-COMP-SCI, volume = "176", number = "1--2", pages = "329--335", day = "20", month = apr, year = "1997", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Wed May 27 07:21:35 MDT 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210L (Formal languages and computational linguistics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Chalmers Univ. of Technol., Goteborg, Sweden", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebra; extensional type theory; inductively defined sets; process algebra; set theory; strictly positive endofunctor; type theory; wellorderings", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }