<--- Back to Details
First PageDocument Content
Software engineering / Computer programming / Compiler optimizations / Computing / Inline expansion / Optimizing compiler / Data-flow analysis / Scope / Standard ML / Functional programming / Directed acyclic graph / Static single assignment form
Date: 2017-07-17 11:35:05
Software engineering
Computer programming
Compiler optimizations
Computing
Inline expansion
Optimizing compiler
Data-flow analysis
Scope
Standard ML
Functional programming
Directed acyclic graph
Static single assignment form

PREPRINT: To be presented at ICFP ’14, September 1–6, 2014, Gothenburg, Sweden. Practical and Effective Higher-Order Optimizations Lars Bergstrom Matthew Fluet

Add to Reading List

Source URL: manticore.cs.uchicago.edu

Download Document from Source Website

File Size: 312,43 KB

Share Document on Facebook

Similar Documents

Network Analysis and Modeling Lectures 1 and 2 Prof. Aaron Clauset 1

Network Analysis and Modeling Lectures 1 and 2 Prof. Aaron Clauset 1

DocID: 1rmNc - View Document

Kronos: The Design and Implementation of an Event Ordering Service Robert Escriva Ayush Dubey

Kronos: The Design and Implementation of an Event Ordering Service Robert Escriva Ayush Dubey

DocID: 1qU2V - View Document

Querying DAG-shaped Execution Traces Through Views Maya Ben-Ari Tova Milo  Elad Verbin

Querying DAG-shaped Execution Traces Through Views Maya Ben-Ari Tova Milo Elad Verbin

DocID: 1qJ8t - View Document

Evaluating TOP-K Queries Over Business Processes Daniel Deutch, Tova Milo Tel Aviv University {danielde,milo}@post.tau.ac.il  Abstract— A Business Process (BP) consists of some business

Evaluating TOP-K Queries Over Business Processes Daniel Deutch, Tova Milo Tel Aviv University {danielde,milo}@post.tau.ac.il Abstract— A Business Process (BP) consists of some business

DocID: 1qIGc - View Document

Algorithms and Data Structures Winter TermExercises for UnitProve that the implementation for the DFS-framework presented in the lecture correctly identifies the strongly connected components in a directe

Algorithms and Data Structures Winter TermExercises for UnitProve that the implementation for the DFS-framework presented in the lecture correctly identifies the strongly connected components in a directe

DocID: 1qy6z - View Document