Sciweavers

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

12

POPL
1991
ACM

favoriteEmaildiscussreport

113views Programming Languages» more POPL 1991»

The Complexity of Type Inference for Higher-Order Typed Lambda Calculi

13 years 8 months ago

The Complexity of Type Inference for Higher-Order Typed Lambda Calculi

Download www.diku.dk

Fritz Henglein, Harry G. Mairson

Real-time Traffic

POPL 1991 | Programming Languages |

claim paper

Related Content

» Exploring the Design Space of HigherOrder Casts

» Type Checking and Inference Are Equivalent in Lambda Calculi with Existential Types

» Rewriting Calculus without Types

» Monotonicity Inference for HigherOrder Formulas

» A Synchronous Semantics of HigherOrder Processes for Modeling Reconfigurable Reactive Syst...

» A typed lambda calculus with intersection types

» MultiLevel LambdaCalculi An Algebraic Description

» Subtyping Union Types

» PolyAML a polymorphic aspectoriented functional programming language

Post Info
More Details (n/a)

Added	27 Aug 2010
Updated	27 Aug 2010
Type	Conference
Year	1991
Where	POPL
Authors	Fritz Henglein, Harry G. Mairson

Comments (0)