Sciweavers

16 search results - page 2 / 4
» Optimal Representations of Polymorphic Types with Subtyping ...
Sort
View
TLCA
1993
Springer
13 years 10 months ago
Recursive Types Are not Conservative over F
d abstract) Giorgio Ghelli1 F≤ is a type system used to study the integration of inclusion and parametric polymorphism. F≤ does not include a notion of recursive types, but ext...
Giorgio Ghelli
EMSOFT
2001
Springer
13 years 10 months ago
System-Level Types for Component-Based Design
Abstract. We present a framework to extend the concept of type systems in programming languages to capture the dynamic interaction in component-based design, such as the communicat...
Edward A. Lee, Yuhong Xiong
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
13 years 7 months ago
Genetic programming with polymorphic types and higher-order functions
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
Franck Binard, Amy P. Felty
ICFP
2005
ACM
14 years 6 months ago
Type inference, principal typings, and let-polymorphism for first-class mixin modules
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
Henning Makholm, J. B. Wells
ASPLOS
2006
ACM
14 years 7 days ago
Type inference for unboxed types and first class mutability
Systems programs rely on fine-grain control of data representation and use of state to achieve performance, conformance to hardware specification, and temporal predictability. T...
Swaroop Sridhar, Jonathan S. Shapiro