Back to Results
First PageMeta Content
Mathematics / Logic in computer science / Formal languages / Models of computation / Combinatory logic / Fixed-point combinator / Rewriting / Simply typed lambda calculus / Overlap / Theoretical computer science / Applied mathematics / Lambda calculus


Type Preservation as a Confluence Problem∗ Aaron Stump1 , Garrin Kimmell1 , and Roba El Haj Omar1 1 Computer Science The University of Iowa
Add to Reading List

Document Date: 2011-04-26 05:41:58

Open Document

File Size: 513,70 KB

Share Result on Facebook

Company

Creative Commons / Dagstuhl Publishing / /

Country

Germany / /

/

Facility

Computer Science The University / /

IndustryTerm

type-level applications / abstract reduction systems / similar reduction systems / type systems / type applications / term-rewriting tools / term-rewriting systems / /

Organization

U.S. National Science Foundation / The University of Iowa / /

Person

Roba El Haj Omar / Aaron Stump / Garrin Kimmell / /

/

Position

Editor / /

ProvinceOrState

Iowa / /

Technology

http / Digital Object Identifier / /

URL

www.cs.uiowa.edu/~astump/papers/rta11.pdf / /

SocialTag