Sciweavers

599 search results - page 22 / 120
» Type System for Specializing Polymorphism
Sort
View
AISC
1992
Springer
13 years 11 months ago
A Type-Coercion Problem in Computer Algebra
Abstract. An important feature of modern computer algebra systems is the support of a rich type system with the possibility of type inference. Basic features of such a type system ...
Andreas Weber
PPDP
2010
Springer
13 years 6 months ago
Generic record combinators with static type checking
Common record systems only provide access to individual record fields. However, it is often useful to have generic record combinators, that is, functions that work with complete ...
Wolfgang Jeltsch
CC
2010
Springer
243views System Software» more  CC 2010»
14 years 2 months ago
Optimizing Matlab through Just-In-Time Specialization
Abstract. Scientists are increasingly using dynamic programming languages like Matlab for prototyping and implementation. Effectively compiling Matlab raises many challenges due t...
Maxime Chevalier-Boisvert, Laurie J. Hendren, Clar...
ICFP
2009
ACM
14 years 8 months ago
Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform
We describe the implementation of first-class polymorphic delimited continuations in the programming language Scala. We use Scala's pluggable typing architecture to implement...
Tiark Rompf, Ingo Maier, Martin Odersky
JFP
2010
142views more  JFP 2010»
13 years 6 months ago
Linear type theory for asynchronous session types
Session types support a type-theoretic formulation of structured patterns of communication, so that the communication behaviour of agents in a distributed system can be verified ...
Simon J. Gay, Vasco Thudichum Vasconcelos