Once upon a polymorphic type

Wansbrough, Keith; Jones, Simon Peyton

doi:10.1145/292540.292545

Cited by 52 publications

(43 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence we plan to investigate optimizations of the monadic code via some static analysis techniques. In particular, we speculate that the type-based usage analysis developed in [22] can be adapted to serve our purpose.…”

Section: Discussionmentioning

confidence: 99%

Side-effect localization for lazy, purely functional languages via aspects

Chen

Weng

Lin

et al. 2011

Higher-Order Symb Comput

View full text Add to dashboard Cite

Many side-effecting programming activities, such as profiling and tracing, can be formulated as crosscutting concerns and be framed as side-effecting aspects in the aspect-oriented programming paradigm. The benefit gained from this separation of concerns is particularly evident in purely functional programming, as adding such aspects using techniques such as monadification will generally lead to crosscutting changes. This paper presents an approach to provide side-effecting aspects for lazy purely functional languages in a user transparent fashion. We propose a simple yet direct state manipulation construct for developing side-effecting aspects and devise a systematic monadification scheme to translate the woven code to monadic style purely functional code. Furthermore, we present a static and dynamic semantics of the aspect programs and reason about the correctness of our monadification scheme with respect to them.

show abstract

Section: Discussionmentioning

confidence: 99%

Side-effect localization for lazy, purely functional languages via aspects

Chen

Weng

Lin

et al. 2011

Higher-Order Symb Comput

View full text Add to dashboard Cite

show abstract

“…Many current forms of program analysis, including many type-based analyses, work best when given the entire program to be analyzed [21,7]. However, by their very nature, large software systems are assembled from components that are designed separately and updated at different times.…”

Section: Background and Motivationmentioning

confidence: 99%

System E: Expansion Variables for Flexible Typing with Linear and Non-linear Types and Intersection Types

Carlier¹,

Polakow²,

Wells³

et al. 2004

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. Types are often used to control and analyze computer programs. Intersection types give great flexibility, but have been difficult to implement. The ! operator, used to distinguish between linear and non-linear types, has good potential for better resource-usage tracking, but has not been as flexible as one might want and has been difficult to use in compositional analysis. We introduce System E, a type system with expansion variables, linear intersection types, and the ! type constructor for creating non-linear types. System E is designed for maximum flexibility in automatic type inference and for ease of automatic manipulation of type information. Expansion variables allow postponing the choice of which typing rules to use until later constraint solving gives enough information to allow making a good choice. System E removes many difficulties that expansion variables had in the earlier System I and extends expansion variables to work with ! in addition to the intersection type constructor. We present subject reduction for call-by-need evaluation and discuss program analysis in System E. Discussion Background and MotivationMany current forms of program analysis, including many type-based analyses, work best when given the entire program to be analyzed [21,7]. However, by their very nature, large software systems are assembled from components that are designed separately and updated at different times. Hence, for large software systems, a program analysis methodology will benefit greatly from being compositional, and thereby usable in a modular and incremental fashion.Type systems for programming languages that are flexible enough to allow safe code reuse and abstract datatypes must support some kind of polymorphic types. Theoretical models for type polymorphism in existing programming languages (starting in the 1980s through now) have generally obtained type polymorphism via ∀ ("for all") [15,6] and ∃ ("there exists") quantifiers [13] or closely related methods. Type systems with ∀ and ∃ quantifiers alone tend to

show abstract

“…While related, this aspect is in fact orthogonal to the issue of polymorphism in the underlying type. Recent work [18,12,6] have suggested that extension to type polymorphism is not necessarily straightforward.…”

Section: Type Polymorphismmentioning

confidence: 99%

“…In another dimension, we may also compare our sized analysis with other constraint-based type analyses, such as those for binding-time analysis [4], usage analysis [18], and flow analysis [5]. While the handling of type polymorphism is not so straightforward, the methods used in [18,6,12] are essentially the same with the need to instantiate type variables; and the need to maintain suitable relationships between existing and the newly instantiated annotations.…”

Section: Related Workmentioning

confidence: 99%

Extending sized type with collection analysis

ChinWei-Ngan¹,

KhooSiau-Cheng²,

XuDana³

2003

SIGPLAN Not.

View full text Add to dashboard Cite

Many program optimizations and analyses, such as arraybounds checking, termination analysis, depend on knowing the size of a function's input and output. However, size information can be difficult to compute. Firstly, accurate size computation requires detecting a size relation between different inputs of a function. Secondly, size information may also be contained inside a collection (data structure with multiple elements). In this paper, we introduce some techniques to derive universal and existential size properties over collections of elements of recursive data structures. We shall show how a mixed constraint system could support the enhanced size type, and highlight examples where collection analysis are useful.

show abstract

Once upon a polymorphic type

Cited by 52 publications

References 16 publications

Side-effect localization for lazy, purely functional languages via aspects

Side-effect localization for lazy, purely functional languages via aspects

System E: Expansion Variables for Flexible Typing with Linear and Non-linear Types and Intersection Types

Extending sized type with collection analysis

Contact Info

Product

Resources

About