<--- Back to Details
First PageDocument Content
Computing / Type inference / Type system / Lambda calculus / Constraint programming / Hindley–Milner / Generalized algebraic data type / Constraint satisfaction / Standard ML / Software engineering / Programming language theory / Type theory
Date: 2007-01-26 09:13:38
Computing
Type inference
Type system
Lambda calculus
Constraint programming
Hindley–Milner
Generalized algebraic data type
Constraint satisfaction
Standard ML
Software engineering
Programming language theory
Type theory

A modern eye on ML type inference – Old techniques and recent developments – Franc¸ois Pottier INRIA September 2005

Add to Reading List

Source URL: cristal.inria.fr

Download Document from Source Website

File Size: 199,38 KB

Share Document on Facebook

Similar Documents

in Knowledge Engineering Reviews, 2001  Synthesis of EÆcient Constraint Satisfaction Programs Stephen J. Westfold and Douglas R. Smith Kestrel Institute 3260 Hillview Avenue

in Knowledge Engineering Reviews, 2001 Synthesis of EÆcient Constraint Satisfaction Programs Stephen J. Westfold and Douglas R. Smith Kestrel Institute 3260 Hillview Avenue

DocID: 1xVgq - View Document

Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems∗ Eli Ben-Sasson† Alessandro Chiesa†

Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems∗ Eli Ben-Sasson† Alessandro Chiesa†

DocID: 1xTDp - View Document

A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan and Michael Molloy Department of Computer Science University of Toronto {siuon,molloy}@cs.toronto.edu

A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan and Michael Molloy Department of Computer Science University of Toronto {siuon,molloy}@cs.toronto.edu

DocID: 1uD4W - View Document

1  Overview • This talk is about: – The Boolean Satisfiability Problem (SAT) – The Constraint Satisfaction Problem (CSP)

1 Overview • This talk is about: – The Boolean Satisfiability Problem (SAT) – The Constraint Satisfaction Problem (CSP)

DocID: 1ukgD - View Document

5  CONSTRAINT SATISFACTION PROBLEMS  In which we see how treating states as more than just little black boxes leads to the

5 CONSTRAINT SATISFACTION PROBLEMS In which we see how treating states as more than just little black boxes leads to the

DocID: 1uf9a - View Document