Sciweavers

291 search results - page 3 / 59
» A Logic for Parametric Polymorphism
Sort
View
113
Voted
TPHOL
1998
IEEE
15 years 3 months ago
Object-Oriented Verification Based on Record Subtyping in Higher-Order Logic
We show how extensible records with structural subtyping can be represented directly in Higher-Order Logic (HOL). Exploiting some specific properties of HOL, this encoding turns o...
Wolfgang Naraschewski, Markus Wenzel
ICFP
2009
ACM
16 years 7 days ago
Non-parametric parametricity
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
Georg Neis, Derek Dreyer, Andreas Rossberg
PLPV
2010
ACM
15 years 8 months ago
Free theorems for functional logic programs
Type-based reasoning is popular in functional programming. In particular, parametric polymorphism constrains functions in such a way that statements about their behavior can be de...
Jan Christiansen, Daniel Seidel, Janis Voigtlä...
79
Voted
JMLC
1997
Springer
15 years 3 months ago
Lightweight Parametric Polymorphism for Oberon
Strongly typed polymorphism is necessary for expressing safe reusable code. Two orthogonal forms of polymorphism exist: inclusion and parametric, the Oberon language only supports ...
Paul Roe, Clemens A. Szyperski
ICFP
2010
ACM
15 years 20 days ago
Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators
We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism. We show that, for higher-order functions, the expressiveness of highe...
Stefan Holdermans, Jurriaan Hage