- Raising ML to the Power of System F Didier Le Botlan and Didier Rmy
- A Hoare Logic for Call-by-Value Functional Yann Regis-Gianas1
- Type Inference for Records in a Natural Extension of ML
- Nordic Journal of Computing A Versatile Constraint-Based Type Inference System
- A ConstraintBased Presentation and Generalization of Rows Francois Pottier
- Modeling Abstract Types in Modules with Open Existential Types
- An overview of C#ml Francois Pottier 1
- de r eche r che INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
- ESE DE DOCTORAT pr'esent'ee `a
- A 3-Part Type Inference Engine Fran cois Pottier
- Functional Translation of a Calculus of Capabilities Arthur Chargueraud
- Mmoire d'habilitation diriger des recherches en informatique
- A Fresh Look at Programming with Names and Binders Nicolas Pouillard Franois Pottier
- Big Brother Manual version 2.0.4
- Information Flow Inference for ML Fran cois Pottier
- A Simple View of TypeSecure Information Flow in the Calculus Franois Pottier
- A Systematic Approach to Static Access Control Fran cois Pottier
- Information Flow Inference for ML Fran cois Pottier
- Polymorphic Typed Defunctionalization Francois Pottier #
- E DE RECHERCHE INRIAROCQUENCOURT
- Numbering Matters: FirstOrder Canonical Forms for SecondOrder Recursive Nadji Gauthier
- Functional Translation of a Calculus of Capabilities Arthur Chargueraud
- A ConstraintBased Presentation and Generalization of Rows Francois Pottier
- Programming Objects with MLART An extension to ML with Abstract and Record
- Simplifying subtyping constraints Francois Pottier
- Information Flow Inference for ML FRANC OIS POTTIER and VINCENT SIMONET
- Notes du cours de DEA Typage et programmation
- Towards e#cient, typed LR parsers Francois Pottier 1 and Yann RegisGianas 2
- Static Name Control for FreshML Francois Pottier
- An Extension of HM(X) with Bounded Existential and Universal DataTypes Vincent Simonet #
- Information Flow Inference For Free Franois Pottier
- Typing Record Concatenation for Free Didier R'emy
- de r eche r che INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET AUTOMATIQUE
- A ConstraintBased Approach to Guarded Algebraic Data Types
- Type inference with structural subtyping: A faithful formalization of an efficient
- E DE RECHERCHE INRIAROCQUENCOURT
- A Semantic Foundation for Hidden State Jan Schwinghammer1
- Typing Termination Higher-Order Concurrent Imperative Language (*)
- Static Name Control for FreshML Francois Pottier
- To appear in J. Functional Programming 1 FUNCT I ONAL PEARL
- Ecient representation of extensible records Didier R emy
- JOIN(X): Constraint-Based Type Inference for the Join-Calculus
- In Search of a Program Generator to Implement Generic Transformations for Highperformance
- JOIN(X): Constraint-Based Type Inference for the Join-Calculus
- de recherche INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
- Stratified Type Inference For Generalized Algebraic Data Types Francois Pottier Yann Regis-Gianas
- E DE RECHERCHE INRIAROCQUENCOURT
- Syntactic Theories and the Algebra of Record Terms Recently, many type systems for records have been proposed. For most of them, the types
- A Hoare Logic for CallbyValue Functional Yann RegisGianas 1 and Francois Pottier 2
- Projective ML Didier R'emy
- Type inference and simplification for recursively constrained types Francois Pottier
- A modern eye on ML type inference --Old techniques and recent developments --
- A Framework for Type Inference with Subtyping Francois Pottier \Lambda
- Towards efficient, typed LR parsers Francois Pottier 1
- Inheritance in the Join Calculus Cedric Fournet
- A Simple View of TypeSecure Information Flow in the Calculus Franois Pottier
- A Fresh Look at Programming with Names and Binders Nicolas Pouillard Franois Pottier
- Objective ML: A simple objectoriented extension of ML
- A case study of typechecking with constrained types: Typing record concatenation
- TIP'02 Preliminary Version Syntactic Type Soundness for HM(X)
- Subtyping Recursive Types modulo Associative Commutative Products
- Stratified Type Inference For Generalized Algebraic Data Types Francois Pottier Yann RegisGianas
- The Essence of Monotonic State Alexandre Pilkiewicz Franois Pottier
- A Typed Store-Passing Translation for General References Francois Pottier
- A Typed Store-Passing Translation for General References Francois Pottier
- FUNCTIONAL PEARL Lazy Least Fixed Points in ML
- Generalizing the higher-order frame and anti-frame rules Francois Pottier
- Hiding local state in direct style: a higher-order anti-frame rule
- A Constraint-Based Approach to Guarded Algebraic Data Types
- Subtyping Recursive Types modulo Associative Commutative Products
- Numbering Matters: First-Order Canonical Forms for Second-Order Recursive Nadji Gauthier
- Polymorphic Typed Defunctionalization Francois Pottier
- Math. Struct. in Comp. Science (1998), vol. 00, pp. 111 Copyright c Cambridge University Press Regular Bohm Trees
- presentee `a l'Universite Paris 7 Denis Diderot
- Static Name Control for FreshML Francois Pottier
- An overview of Cml Francois Pottier 1
- Big Brother Manual version 2.0.4
- Menhir Reference Manual (version 20110201)
- Cml Reference Manual (version 20061214)
- A Systematic Approach to Static Access Control Franois Pottier 1 , Christian Skalka 2 , and Scott Smith 2
- Optimizing Pattern Matching Fabrice Le Fessant, Luc Maranget
- Mmoire d'habilitation diriger des recherches en informatique
- Polymorphic Typed Defunctionalization and Concretization
- Simplifying subtyping constraints: a theory Fran cois Pottier
- Certification of a type inference tool for ML: DamasMilner within Coq Catherine Dubois \Lambda
- Implicit typing `a la ML for the joincalculus \Lambda C'edric Fournet y Cosimo Laneve z
- Polymorphic Typed Defunctionalization and Concretization
- A modern eye on ML type inference Old techniques and recent developments
- Finegrained Information Flow Analysis for a calculus with Sum Types Vincent Simonet
- Three comments on the anti-frame rule Francois Pottier
- Elimination of ghost variables in program logics Martin Hofmann and Mariela Pavlova
- Modular Verification of Security Protocol Code by Typing Karthikeyan Bhargavan Cedric Fournet Andrew D. Gordon
- Static Name Control for FreshML Francois Pottier
- Syntactic soundness proof of a type-and-capability system
- ZU064-05-FPR rubtmp411 February 20, 2012 18:19 Under consideration for publication in J. Functional Programming 1
- J. Functional Programming 1 (1): 1000, January 1993 c 1993 Cambridge University Press 1 FUNCTIONAL PEARLS
