NDLI: A type system equivalent to static single assignment

Please wait, while we are loading the content...

Combining fuzzy logic and behavioral similarity for non-strict program validation

Type-oriented construction of web user interfaces

Type inference for spreadsheets

Rewriting term-graphs with priority

Combining algorithmic debugging and program slicing

One-and-a-halfth-order logic

Condate: a proto-language at the confluence between checking and compiling

Typed polyadic pi-calculus in bigraphs

An abductive framework for a-priori verification of web services

Polymorphic algebraic data type reconstruction

Computing constructor forms with non terminating rewrite programs

Practical type inference based on success typings

A modal type system for multi-level generating extensions with persistent code

Compiling ML polymorphism with explicit layout bitmap

Constraint handling rules: the story so far

An efficient algorithm for XML type projection

Extracting programs from type class proofs

Open data types and open functions

Collection analysis for Horn clause programs

Inferring dynamic credentials for rôle-based trust management

A type system equivalent to static single assignment

BASS: boxed ambients with safe sessions

A historic functional and object-oriented calculus

Poly-controlled partial evaluation

A type system equivalent to static single assignment

Content Provider	ACM Digital Library
Author	Matsuno, Yutaka Ohori, Atsushi
Abstract	This paper develops a static type system equivalent to static single assignment (SSA) form. In this type system, a type of a variable at some program point represents the control flows from the assignment statements that reach the program point. For this type system, we show that a derivable typing of a program corresponds to the program in SSA form. By this result, any SSA transformation can be interpreted as a type inference process in our type system. By adopting a result on efficient SSA transformation, we develop a type inference algorithm that reconstructs a type annotated code from a given code. These results provide a static alternative to SSA based compiler optimization without performing code transformation. Since this process does not change the code, it does not incur overhead due to insertion of φ functions. Another advantage of this type based approach is that it is not constrained to naming mechanism of variables and can therefore be combined with other static properties useful for compilation and code optimization such as liveness information of variables. As an application, we express optimizations as type-directed code transformations.
Starting Page	249
Ending Page	260
Page Count	12
File Format	PDF
ISBN	1595933883
DOI	10.1145/1140335.1140365
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2006-07-10
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Compiler optimization Type system Static single assignment form
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Abstract a type system equivalent to static single assignment ∗.

A Type System Equivalent to Static Single Assignment ⋆,⋆⋆ Abstract

Practical improvements to the construction and destruction of static single assignment form (1998).

Optimization in SSA form (common

Using Software Metrics to Evaluate Static Single Assignment Form in GCC

Single Assignment Compiler, Single Assignment Architecture: Future Gated Single Assignment Form*; Static Single Assignment with Congruence Classes

Efficiently computing the static single information form (2002)

Adding Static Single Assignment Form and a Graph Coloring Register Allocator to the Java Hotspot™ Client Compiler (2000)

Efficiently computing the static single information form (2002)

A type system equivalent to static single assignment

Similar Documents

Abstract a type system equivalent to static single assignment ∗.

A Type System Equivalent to Static Single Assignment ⋆,⋆⋆ Abstract

Practical improvements to the construction and destruction of static single assignment form (1998).

Optimization in SSA form (common

Using Software Metrics to Evaluate Static Single Assignment Form in GCC

Single Assignment Compiler, Single Assignment Architecture: Future Gated Single Assignment Form*; Static Single Assignment with Congruence Classes

Efficiently computing the static single information form (2002)

Adding Static Single Assignment Form and a Graph Coloring Register Allocator to the Java Hotspot™ Client Compiler (2000)

Efficiently computing the static single information form (2002)

A type system equivalent to static single assignment