Back to Results
First PageMeta Content
Models of computation / Logic / Mathematical logic / Function / Data-flow analysis / Free variables and bound variables / Algorithm / Lambda calculus / Monad / Mathematics / Elementary mathematics / Theoretical computer science


Flow-Sensitive Type Recovery in Linear-Log Time Michael D. Adams ∗ , Andrew W. Keep∗ , Jan Midtgaard† , Matthew Might‡ , Arun Chauhan∗ , R. Kent Dybvig∗ Abstract the cost of run-time type checks. This cost c
Add to Reading List

Document Date: 2012-04-14 12:13:51

Open Document

File Size: 362,03 KB

Share Result on Facebook

Facility

Indiana University / University of Utah / Aarhus University / /

IndustryTerm

car returns / usual flow-graph algorithm / variable binding site / flow-graph based algorithm / car x1 / linear-log time algorithm / car x2 / type-recovery algorithm / call site / particular call site / lowest common ancestor algorithm / car xn / flow-sensitive type-recovery algorithm / car fˆ / work-list algorithm / /

Organization

University of Utah / Aarhus University / National Security Agency / Indiana University / /

Person

Jan Midtgaard / Van Horn / Arun Chauhan / Matthew Might / Lam JcKin / Andrew W. Keep / /

Position

Optimization General / /

ProgrammingLanguage

Ruby / Python / JavaScript / /

ProvinceOrState

Utah / /

Technology

type-recovery algorithm / CFA-based type-recovery algorithm / flow-graph based algorithm / linear-log time algorithm / ancestor algorithm / optimized algorithm / Caching / usual flow-graph algorithm / work-list algorithm / v. 35 / /

SocialTag