Sciweavers

599 search results - page 19 / 120
» Type System for Specializing Polymorphism
Sort
View
LICS
1999
IEEE
13 years 11 months ago
Subtyping Recursive Types in Kernel Fun
The problem of defining and checking a subtype relation between recursive types was studied in [3] for a first order type system, but for second order systems, which combine subty...
Dario Colazzo, Giorgio Ghelli
POPL
2005
ACM
14 years 7 months ago
Polymorphic bytecode: compositional compilation for Java-like languages
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assum...
Davide Ancona, Ferruccio Damiani, Sophia Drossopou...
POPL
1993
ACM
13 years 11 months ago
Type Checking Type Classes
We study the type inference problem for a system with type classes as in the functional programminglanguage Haskell. Type classes are an extension of ML-style polymorphismwith ove...
Tobias Nipkow, Christian Prehofer
POPL
1989
ACM
13 years 11 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
SAS
1991
Springer
13 years 11 months ago
Polymorphic Time Systems for Estimating Program Complexity
We present a new approach to static program analysis that permits each expression in a program to be assigned an execution time estimate. Our approach uses a time system in conjun...
Vincent Dornic, Pierre Jouvelot, David K. Gifford