Sciweavers

20 search results - page 2 / 4
» Relational parametricity for references and recursive types
Sort
View
LICS
1999
IEEE
13 years 9 months ago
Subtyping Recursive Types in Kernel Fun
The problem of defining and checking a subtype relation between recursive types was studied in [3] for a first order type system, but for second order systems, which combine subty...
Dario Colazzo, Giorgio Ghelli
ENTCS
2006
153views more  ENTCS 2006»
13 years 4 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...
CORR
2011
Springer
173views Education» more  CORR 2011»
12 years 12 months ago
Linear Dependent Types and Relative Completeness
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Ugo Dal Lago, Marco Gaboardi
INLG
2004
Springer
13 years 10 months ago
Overgenerating Referring Expressions Involving Relations and Booleans
Abstract. We present a new approach to the generation of referring expressions containing attributive, type and relational properties combined by conjunctions, disjunctions and neg...
Sebastian Varges
FOSSACS
2007
Springer
13 years 11 months ago
Relational Parametricity and Separation Logic
Abstract. Separation logic is a recent extension of Hoare logic for reasoning about programs with references to shared mutable data structures. In this paper, we provide a new inte...
Lars Birkedal, Hongseok Yang