Soft typing with conditional types

Authors:
Alexander Aiken;Edward L. Wimmers;T. K. Lakshman
Affiliations:
Computer Science Division, University of California at Berkeley, Berkeley, CA and IBM Almaden Research Center 650 Harry Rd., San Jose, CA;IBM Almaden Research Center, 650 Harry Rd., San Jose, CA;Department of Computer Science, University of Illinois at Urbana-Champaign, 1304 W. Springfield Ave, Urbana, IL
Venue:
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Year:
1994

Citing 18
Cited 77

Control flow analysis in scheme

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Type inference with subtypes

Proceedings of the Second European Symposium on Programming
Partial type inference for untyped functional programs

LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Static type inference in a dynamically typed language

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Refinement types for ML

PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Soft typing

PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Implementing regular tree expressions

Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Global tagging optimization by type inference

LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Analysis of recursive types in Lisp-like languages

LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Type inclusion constraints and type inference

FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Set based program analysis

Set based program analysis
Declaration-free type checking

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Flow analysis and optimization of LISP-like structures

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Principal type-schemes for functional programs

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type Inference with Partial Types

ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
An ideal model for recursive polymorphic types

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Coercion and type inference

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

A practical soft type system for Scheme

LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Set-based analysis of ML programs

LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Precise concrete type inference for object-oriented languages

OOPSLA '94 Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applications
Compiling polymorphism using intensional type analysis

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Safe: a semantic technique for transforming programs in the presence of errors

ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstract interpretation and low-level code optimization

PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Dynamic typing and subtype inference

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Safe polymorphic type inference for a dynamically typed language: translating Scheme to ML

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Catching bugs in the web of program invariants

PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
A practical soft type system for scheme

ACM Transactions on Programming Languages and Systems (TOPLAS)
Componential set-based analysis

Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Strongly typed flow-directed representation transformations (extended abstract)

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
A practical subtyping system for Erlang

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
On the complexity of set-based analysis

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Minimal typings in atomic subtyping

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Infinitary control flow analysis: a collecting semantics for closure analysis

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Disjunctive program analysis for algebraic data types

ACM Transactions on Programming Languages and Systems (TOPLAS)
Inference of polymorphic and conditional strictness properties

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Static typing for dynamic messages

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dynamic typing as staged type inference

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Polymorphic splitting: an effective polyvariant flow analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Partial online cycle elimination in inclusion constraint graphs

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
A framework for type inference with subtyping

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Type inference in the polymorphic relational algebra

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Trace-Based Abstract Interpretation of Operational Semantics

Lisp and Symbolic Computation
Dynamic typing for distributed programming in polymorphic languages

ACM Transactions on Programming Languages and Systems (TOPLAS)
Componential set-based analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Projection merging: reducing redundancies in inclusion constraint graphs

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Intersection types and computational effects

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
The first-order theory of subtyping constraints

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Simplifying subtyping constraints: a theory

Information and Computation
Tarskian set constraints

Information and Computation
On the complexity analysis of static analyses

Journal of the ACM (JACM)
Kima: An Automated Error Correction System for Concurrent Logic Programs

Automated Software Engineering
On type systems for object-oriented database programming languages

ACM Computing Surveys (CSUR)
Generalized Definite Set Constraints

Constraints
Optimal Representations of Polymorphic Types with Subtyping

Higher-Order and Symbolic Computation
A 3-Part Type Inference Engine

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Entailment with Conditional Equality Constraints

ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
A Systematic Approach to Static Access Control

ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
On the Complexity Analysis of Static Analyses

SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Solving Regular Tree Grammar Based Constraints

SAS '01 Proceedings of the 8th International Symposium on Static Analysis
A versatile constraint-based type inference system

Nordic Journal of Computing
Set constraints with intersection

Information and Computation - Special issue: LICS'97
Tarskian Set Constraints

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
SOLAT - A Simple Object-Oriented Language Analyzing Tool

TOOLS '97 Proceedings of the Tools-23: Technology of Object-Oriented Languages and Systems
Types in program analysis

The essence of computation
Discriminative sum types locate the source of type errors

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Tridirectional typechecking

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus with polymorphic and polyvariant flow types

Journal of Functional Programming
From Polyvariant flow information to intersection and union types

Journal of Functional Programming
The semantics of future and an application

Journal of Functional Programming
Types for describing coordinated data structures

TLDI '05 Proceedings of the 2005 ACM SIGPLAN international workshop on Types in languages design and implementation
A systematic approach to static access control

ACM Transactions on Programming Languages and Systems (TOPLAS)
Selectors Make Set-Based Analysis Too Hard

Higher-Order and Symbolic Computation
Hybrid type checking

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Practical type inference based on success typings

Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Interlanguage migration: from scripts to programs

Companion to the 21st ACM SIGPLAN symposium on Object-oriented programming systems, languages, and applications
Static error detection using semantic inconsistency inference

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
The design and implementation of typed scheme

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semantic subtyping: Dealing set-theoretically with function, union, intersection, and negation types

Journal of the ACM (JACM)
Constrained types for object-oriented languages

Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
Static type inference for Ruby

Proceedings of the 2009 ACM symposium on Applied Computing
Type-specialized staged programming with process separation

Proceedings of the 2009 ACM SIGPLAN workshop on Generic programming
Hybrid type checking

ACM Transactions on Programming Languages and Systems (TOPLAS)
Type assignment for intersections and unions in call-by-value languages

FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
State of the union: type inference via Craig interpolation

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Logical types for untyped languages

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Adding dynamic types to C

ECOOP'10 Proceedings of the 24th European conference on Object-oriented programming
Runtime instrumentation for precise flow-sensitive type analysis

RV'10 Proceedings of the First international conference on Runtime verification
The ins and outs of gradual type inference

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bidirectional data flow analysis for type inferencing

Computer Languages, Systems and Structures
Elaborating intersection and union types

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Energy types

Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Gradual typing for objects

ECOOP'07 Proceedings of the 21st European conference on Object-Oriented Programming
Type-specialized staged programming with process separation

Higher-Order and Symbolic Computation
A calculus for constraint-based flow typing

Proceedings of the 15th Workshop on Formal Techniques for Java-like Programs

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple and powerful type inference method for dynamically typed languages where no type information is supplied by the user. Type inference is reduced to the problem of solvability of a system of type inclusion constraints over a type language that includes function types, constructor types, union, intersection, and recursive types, and conditional types. Conditional types enable us to analyze control flow using type inference, thus facilitating computation of accurate types. We demonstrate the power and practicality of the method with examples and performance results from an implementation.