Sciweavers

429 search results - page 64 / 86
» Parameter-free polymorphic types
Sort
View
AI
2006
Springer
14 years 9 months ago
The complexity of soft constraint satisfaction
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint type...
David A. Cohen, Martin C. Cooper, Peter Jeavons, A...
FUIN
2006
77views more  FUIN 2006»
14 years 9 months ago
The Impact of seq on Free Theorems-Based Program Transformations
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., vi...
Patricia Johann, Janis Voigtländer
ENTCS
2000
59views more  ENTCS 2000»
14 years 9 months ago
Building continuous webbed models for system F
We present here a large family of concrete models for Girard and Reynolds polymorphism (System F), in a non categorical setting. The family generalizes the construction of the mod...
Stefano Berardi, Chantal Berline
166
Voted
POPL
2007
ACM
15 years 9 months ago
Towards a mechanized metatheory of standard ML
We present an internal language with equivalent expressive power to Standard ML, and discuss its formalization in LF and the machine-checked verification of its type safety in Twe...
Daniel K. Lee, Karl Crary, Robert Harper
81
Voted
LICS
1994
IEEE
15 years 1 months ago
Subtyping and Parametricity
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic support...
Gordon D. Plotkin, Martín Abadi, Luca Carde...