Garrigue, Jacques - Graduate School of Mathematics, Nagoya University

• Le sous-typage d'OCaml Jacques Garrigue
• A Certified Implementation of ML with Structural Polymorphism
• Objective Label 2.04: User's Manual Jacques Garrigue
• Path Resolution for Nested Recursive Modules Jacques Garrigue
• Objective Label 2.04: User's Manual Jacques Garrigue
• PARIS RESEARCH LABORATORY d i g i t a l
• The Transformation Calculus and its Typing
• Unions de variants polymorphes abstraits Romain Bardou
• Relaxing the Value Restriction Jacques Garrigue
• LabelSelective Calculus Syntax and Confluence y
• ''#$%*),+&('/31.02)45 Introducing Stateful Objects in a Transformation Calculus
• Recursive ObjectOriented Modules Keiko Nakata 1 Akira Ito 2 Jacques Garrigue 1
• Simple Type Inference for Structural Polymorphism Jacques Garrigue
• Objective Caml 3.12 Jacques Garrigue ( )
• Code reuse through polymorphic variants Jacques Garrigue
• Programming with Polymorphic Variants Jacques Garrigue
• Information and Computation 155, 13400169 (1999) Article ID inco.1999.2830, available online at http://www.idealibrary.com
• Doctor Thesis LABELSELECTIVE LAMBDACALCULI
• A Label-Selective Lambda-Calculus with Optional and its Compilation Method
• The Typed Polymorphic LabelSelective Calculus Jacques Garrigue
• The Transformation Calculus Jacques Garrigue
• Typing deep pattern-matching in presence of polymorphic variants Jacques Garrigue y
• Union de variants abstraits Jacques Garrigue
• Simple Type Inference for Structural Polymorphism y Jacques Garrigue
• Labeled and optional arguments for Objective Caml Jacques Garrigue y
• Extending ML with SemiExplicit HigherOrder Polymorphism
• Private Row Types: Abstracting the Unnamed Jacques Garrigue
• Recursive Modules for Programming Keiko Nakata
• Path resolution for recursive nested modules is undecidable
• Simpoulet: an attempt at proving environmental bisimulations in Coq
• First-class modules and composable signatures in Objective Caml 3.12 Alain Frisch Jacques Garrigue
• Path resolution for recursive nested modules is undecidable
• Structural Types, Recursive Modules, and the Expression Problem
• Recursive Object-Oriented Modules Keiko Nakata1
• Typing deep pattern-matching in presence of polymorphic variants Jacques Garrigue
• Relaxing the Value Restriction Jacques Garrigue
• Simple Type Inference for Structural Polymorphism Jacques Garrigue
• Programming with Polymorphic Variants Jacques Garrigue
• First-class modules and composable signatures in Objective Caml 3.12
• Information and Computation 155, 13400169 (1999) Article ID inco.1999.2830, available online at http://www.idealibrary.com
• A Label-Selective Lambda-Calculus with Optional and its Compilation Method
• Soundness and principality of type inference for structural polymorphism
• Objective Caml NG=8 7??dO@$H%*%V%8%'%/%H;X8~$NJ#
• Code reuse through polymorphic variants Jacques Garrigue
• Doctor Thesis LABELSELECTIVE LAMBDACALCULI
• Objective Caml Jacques Garrigue
• Objective Caml $K$h$k %W%m%0%i%_%s%0
• Adding GADTs to OCaml the direct approach
• Engineering does help: a parameterized proof of soundness for structural
• A Certified Implementation of ML with Structural Polymorphism
• The Transformation Calculus Jacques Garrigue
• Labeled and optional arguments for Objective Caml* Jacques Garriguey
• A Certified Interpreter for ML with Structural Polymorphism Jacques Garrigue
• DYNAMIC BINDING AND LEXICAL BINDING IN A TRANSFORMATION CALCULUS
• Proving OCaml's type system? Jacques Garrigue
• Simple Type Inference for Structural Polymorphism y Jacques Garrigue
• Label-Selective ~-Calculus Syntax and Confluence
• Adding GADTs to OCaml: the direct approach Jacques Garrigue Jacques Le Normand
• The Transformation Calculus Jacques Garrigue
• Adding GADTs to OCaml the direct approach
• Doctor Thesis LABEL-SELECTIVE LAMBDA-CALCULI
• The Transformation Calculus Jacques Garrigue
• A Certified Implementation of ML with Structural Polymorphism and Recursive Types