A soft-typing system for Erlang

Nyström, Sven-Olof

doi:10.1145/940880.940888

Cited by 24 publications

(12 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…1. Soft typing has also been applied to Python [15] and Erlang [13]. In the latter, the author also bases the type system on a data flow analysis, but does not distinguish between p and f types.…”

Section: Related Workmentioning

confidence: 99%

Preemptive Type Checking in Dynamically Typed Languages

Grech

Rathke

Fischer

2013

Theoretical Aspects of Computing – ICTAC 2013

View full text Add to dashboard Cite

Abstract. We describe a type system that identifies potential type errors in dynamically typed languages like Python. The system uses a flow-sensitive static analysis on bytecodes to compute, for every variable and program point, overapproximations of the variable's present and future use types. If the future use types are not subsumed by the present types, the further program execution may raise a type error, and a narrowing assertion is inserted; if future use and present types are disjoint, it will raise a type error, and a type error assertion is inserted. We prove that the assertions are inserted in optimal locations and thus preempt type errors earlier than dynamic, soft, and gradual typing. We describe the details of our type inference and assertion insertion, and demonstrate the results of an implementation of the system with a number of examples.

show abstract

Section: Related Workmentioning

confidence: 99%

Preemptive Type Checking in Dynamically Typed Languages

Grech

Rathke

Fischer

2013

Theoretical Aspects of Computing – ICTAC 2013

View full text Add to dashboard Cite

show abstract

“…For example, functions have fixed arity and there are no structures comparable with JavaScript's objects. Two type systems have been constructed for Erlang, one based on standard type theory [8] and another one which appears more ad-hoc [10]. Both system work from programmer specified type signatures, whereas our system is targeted towards performing automatic program analysis.…”

Section: Related Workmentioning

confidence: 99%

Towards a Type System for Analyzing JavaScript Programs

Thiemann

2005

Programming Languages and Systems

126

View full text Add to dashboard Cite

Abstract. JavaScript is a popular language for client-side web scripting. It has a dubious reputation among programmers for two reasons. First, many JavaScript programs are written against a rapidly evolving API whose implementations are sometimes contradictory and idiosyncratic. Second, the language is only weakly typed and comes virtually without development tools.The present work is a first attempt to address the second point. It does so by defining a type system that tracks the possible traits of an object and flags suspicious type conversions. Because JavaScript is a classless, object-based language with first-class functions, the type system must include singleton types, subtyping, and first class record labels. The type system covers a representative subset of the language and there is a type soundness proof with respect to an operational semantics.

show abstract

“…in the context of ERLANG types are inferred based on a fixed subtyping lattice containing various primitive types [16], or a user supplied set of type definitions [17,21].…”

Section: Related Workmentioning

confidence: 99%

Polymorphic algebraic data type reconstruction

Schrijvers

Bruynooghe

2006

Proceedings of the 8th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

One of the disadvantages of statically typed languages is the programming overhead caused by writing all the necessary type information: Both type declarations and type definitions are typically required. Traditional type inference aims at relieving the programmer from the former.We present a rule-based constraint rewriting algorithm that reconstructs both type declarations and type definitions, allowing the programmer to effectively program type-less in a strictly typed language. This effectively combines strong points of dynamically typed languages (rapid prototyping) and statically typed ones (documentation, optimized compilation). Moreover it allows to quickly port code from a statically untyped to a statically typed setting.Our constraint-based algorithm reconstructs uniform polymorphic definitions of algebraic data types and simultaneously infers the types of all expressions and functions (supporting polymorphic recursion) in the program. The declarative nature of the algorithm allows us to easily show that it has a number of highly desirable properties such as soundness, completeness and various optimality properties. Moreover, we show how to easily extend and adapt it to suit a number of different language constructs and type system features.

show abstract

A soft-typing system for Erlang

Cited by 24 publications

References 10 publications

Preemptive Type Checking in Dynamically Typed Languages

Preemptive Type Checking in Dynamically Typed Languages

Towards a Type System for Analyzing JavaScript Programs

Polymorphic algebraic data type reconstruction

Contact Info

Product

Resources

About