Sciweavers

25 search results - page 4 / 5
» The Typed Polymorphic Label-Selective lambda-Calculus
Sort
View
POPL
1989
ACM
13 years 9 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
ICFP
2002
ACM
14 years 5 months ago
Type classes with more higher-order polymorphism
We propose an extension of Haskell's type class system with bstractions in the type language. Type inference for our extension relies on a novel constrained unification proce...
Matthias Neubauer, Peter Thiemann
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
ICFP
1999
ACM
13 years 10 months ago
Representing Java Classes in a Typed Intermediate Language
We propose a conservative extension of the polymorphic lambda calculus (A5B ) as an intermediate language for compiling languages with name-based class and interface hierarchies. ...
Christopher League, Zhong Shao, Valery Trifonov
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
13 years 11 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...