Sciweavers

1982 search results - page 8 / 397
» Parametricity and dependent types
Sort
View
JFP
2010
63views more  JFP 2010»
14 years 8 months ago
Parametricity, type equality, and higher-order polymorphism
Dimitrios Vytiniotis, Stephanie Weirich
CASC
2010
Springer
155views Mathematics» more  CASC 2010»
14 years 8 months ago
Type Specialization in Aldor
Computer algebra in scientific computation squarely faces the dilemma of natural mathematical expression versus efficiency. While higher-order programming constructs and parametri...
Laurentiu Dragan, Stephen M. Watt
IFIP
2004
Springer
15 years 3 months ago
Dynamic Typing with Dependent Types
Dependent type systems are promising tools programmers can use to increase the reliability and security of their programs. Unfortunately, dependently-typed programming languages re...
Xinming Ou, Gang Tan, Yitzhak Mandelbaum, David Wa...
RTA
2004
Springer
15 years 3 months ago
A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems
Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent type...
Frédéric Blanqui
JFP
2007
112views more  JFP 2007»
14 years 9 months ago
Dependent ML An approach to practical programming with dependent types
We present an approach to enriching the type system of ML with a restricted form of de
Hongwei Xi