Sciweavers

17 search results - page 2 / 4
» Polymorphic typed defunctionalization and concretization
Sort
View
POPL
1997
ACM
13 years 11 months ago
Type-Checking Higher-Order Polymorphic Multi-Methods
We present a new predicative and decidable type system, called ML , suitable for languages that integrate functional programming and parametric polymorphism in the tradition of ML...
François Bourdoncle, Stephan Merz
ENTCS
2006
153views more  ENTCS 2006»
13 years 7 months ago
Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show,...
Lars Birkedal, Rasmus Ejlers Møgelberg, Ras...
APLAS
2008
ACM
13 years 9 months ago
Extensional Universal Types for Call-by-Value
Abstract. We propose c2-calculus, which is a second-order polymorphic call-by-value calculus with extensional universal types. Unlike product types or function types in call-by-val...
Kazuyuki Asada
ENTCS
2000
59views more  ENTCS 2000»
13 years 7 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
ICDT
2010
ACM
149views Database» more  ICDT 2010»
14 years 11 days ago
Mapping Polymorphism
We examine schema mappings from a type-theoretic perspective and aim to facilitate and formalize the reuse of mappings. Starting with the mapping language of Clio, we present a ty...
Ryan Wisnesky, Mauricio Hernandez, Lucian Popa