Tags
- A
- Algorithms
- Android Runtime
- Based on
- Basic block
- Branch predictor
- Call-with-current-continuation
- Compiler
- Compiler infrastructure
- Computer Science
- Computer scientist
- Constant folding
- Continuation-passing style
- D
- Dynamic and formal equivalence
- Efficient algorithms
- End
- Form
- Functional programming
- GNU Compiler Collection
- HHVM
- Higher-order
- Higher-order function
- High-quality
- IBM Fellow
- IBM Research
- Illinoi, Illinois and Indiana
- Imperative programming
- Innovation
- Insert
- Insertion point
- Institute of Electrical and Electronics Engineers
- Intermediate representation
- Interprocedural optimization
- J
- Java bytecode
- Jeanne Ferrante
- Jikes RVM
- Join point
- Just-in-time compilation
- K
- Lempel–Ziv–Welch
- LLVM
- Logical shift
- Loop-invariant code motion
- M
- Machine code
- Mesa Driver
- MLton
- Modern Life Is Rubbish
- Multiple working
- N
- National Academy of Engineering
- New York University
- Node 4
- Nth root
- Number
- Oberon-2
- Open64
- Optimization algorithms
- Optimizing compiler
- P
- Power of two
- Public projects
- Reaching definition
- Register allocation
- Result
- Rosen Wegman
- SafeTSA
- Second
- SIGPLAN
- Some
- Standard ML
- Static
- Static single assignment form
- Storage allocation
- Terms
- The heart
- Universal hashing
- University of California, Berkeley
- Variable name
- Virtual machine
- Wegman
- Wikipedia