31 search results - page 3 / 7 » Relational Parametricity for a Polymorphic Linear Lambda Cal... |
ACS
2005
13 years 5 months ago
2005
There are several kinds of linear typed calculus in the literature, some with their associated notion of categorical model. Our aim in this paper is to systematise the relationshi...
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
TACS
1991
Springer
13 years 9 months ago
1991
Springer
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...
JFP
2006
13 years 5 months ago
2006
We investigate a technique from the literature, called the phantom-types technique, that uses parametric polymorphism, type constraints, and unification of polymorphic types to mo...
ICFP
2010
ACM
13 years 6 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...