Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

APAL
2008

favoriteEmaildiscussreport

79views more APAL 2008»

Parameter-free polymorphic types

13 years 4 months ago

Parameter-free polymorphic types

Download www.linta.de

Consider the following restriction of the polymorphically typed lambda calculus ("System F"). All quantifications are parameter free. In other words, in every universal type ., the quantified variable is the only free variable in the scope of the quantification. This fragment can be locally proven terminating in a system of intuitionistic second-order arithmetic known to have strength of finitely iterated inductive definitions.

Klaus Aehlig

Real-time Traffic

APAL 2008 | Iterated Inductive Definitions | System F | Typed Lambda Calculus |

claim paper

Related Content

» Integrative ParameterFree Clustering of Data with Mixed Type Attributes

» Type Inference with Rank 1 Polymorphism for TypeDirected Compilation of ML

» A Certified Implementation of ML with Structural Polymorphism

» Firstclass Polymorphism with Type Inference

» Behavioral Equivalence in the Polymorphic Picalculus

» Intensional Polymorphism in TypeErasure Semantics

» Polymorphic Delimited Continuations

» Precise ConstraintBased Type Inference for Java

» Type Inferencing for Polymorphic OrderSorted Logic Programs

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2008
Where	APAL
Authors	Klaus Aehlig

Comments (0)