Sciweavers

59 search results - page 3 / 12
» Alias Types for Recursive Data Structures
Sort
View
TLDI
2005
ACM
135views Formal Methods» more  TLDI 2005»
13 years 11 months ago
Types for describing coordinated data structures
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
Michael F. Ringenburg, Dan Grossman
ICFP
2001
ACM
14 years 5 months ago
Recursive Structures for Standard ML
Standard ML is a statically typed programming language that is suited for the construction of both small and large programs. "Programming in the small" is captured by St...
Claudio V. Russo
ECOOP
1998
Springer
13 years 9 months ago
The Complexity of Type Analysis of Object Oriented Programs
One of the price tags attached to the blessings that OO brings about is a drop in efficiency due to dynamic method dispatch. Much research effort is being spent on the problem of e...
Joseph Gil, Alon Itai
POPL
2010
ACM
14 years 2 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
13 years 6 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