Sciweavers

20 search results - page 2 / 4
» A Per Model of Polymorphism and Recursive Types
Sort
View
TLDI
2009
ACM
169views Formal Methods» more  TLDI 2009»
14 years 5 months ago
Relational parametricity for references and recursive types
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
Lars Birkedal, Kristian Støvring, Jacob Tha...
ENTCS
2006
153views more  ENTCS 2006»
13 years 8 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...
LICS
2008
IEEE
14 years 3 months ago
Typed Normal Form Bisimulation for Parametric Polymorphism
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
Søren B. Lassen, Paul Blain Levy
APLAS
2005
ACM
14 years 2 months ago
Lightweight Family Polymorphism
The formal core calculus .FJ has been introduced to model lightweight family polymorphism, a programming style to support reusable yet type-safe mutually recursive classes. This pa...
Atsushi Igarashi, Chieri Saito, Mirko Viroli
FPCA
1989
14 years 19 days ago
A Simple Semantics for ML Polymorphism
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
Atsushi Ohori