Sciweavers

76 search results - page 2 / 16
» Recursive Polymorphic Types and Parametricity in an Operatio...
Sort
View
FOSSACS
2009
Springer
14 years 3 days ago
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
Lars Birkedal, Kristian Støvring, Jacob Tha...
MSCS
2010
86views more  MSCS 2010»
13 years 3 months ago
Realisability semantics of parametric polymorphism, general references and recursive types
tations of imperative abstract data types.
Lars Birkedal, Kristian Støvring, Jacob Tha...
ENTCS
2006
153views more  ENTCS 2006»
13 years 5 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...
JACM
2007
84views more  JACM 2007»
13 years 5 months ago
Polymorphic higher-order recursive path orderings
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
Jean-Pierre Jouannaud, Albert Rubio
GPCE
2003
Springer
13 years 10 months ago
Concept-Controlled Polymorphism
Concepts—sets of abstractions related by common requirements— have a central role in generic programming. This paper proposes a general framework for using concepts to control ...
Jaakko Järvi, Jeremiah Willcock, Andrew Lumsd...