Recent Conferences by G. Huet

June 25th, 2016

Teaching Foundations of Computation and Deduction through Literate Functional Programming and Type Theory Formalization. Keynote lecture, Formal Structures for Computation and Deduction (FSCD 2016). Talk (pdf).

April 28th, 2016

Programming Methodology and Type Theory. How 40 years of uncompromising research made concrete the Chalmers futuristic vision into the Software Engineering paradigm of Programs correct by construction. Meeting in honor of Bengt Nordström, Marstrand. Sildes (pdf).

November 6th, 2015

Caml with Gérard Huet. Software Engineering Daily interview podcast.

November 4th, 2015

The Sanskrit Heritage Platform.
Abstract. We present a short demonstration of the Sanskrit Heritage Platform, a set of inter-connected Web services using functional programming. It is an exemple of Numerical Humanities for Cultural Heritage management, based on Computational Linguistics technology. Its core component is the Zen toolkit, a small library for computational linguistics using a relational programming methodology. The Zen library is very small (4000 lines of pure functional programs). It may be presented as an executable course in the technology, using a literate programming presentation of the code itself. The full platform is a more consequent software endeavor (40K lines in 100 modules). Nevertheless, its full source can be issued in the same manner as a complete readable document explaining the linguistic processes in terms understandable by a Sanskrit grammarian. The lexicon itself is available as a Hypertext document presenting Sanskrit meanings in the cultural context of ancient India. This platform is free open source software, and has interfaces with a community of related interoperable platforms.
Software and Digital Humanities Workshop, Institut d'Etudes avancées, Hôtel de Lauzun, Paris.

October 16th, 2015

Mathématiques et Sanskrit. Séminaire d'histoire des mathématiques, Institut Henri Poincaé. Texte (pdf).

January 22th, 2015

Littérature logicielle: des programmes informatiques agréables à lire, aptes à être publiés tels quels, et à servir de support à des cours exécutables. Séminaire Codes Sources, Laboratoire d'Informatique de l'Université Paris 6. Slides (pdf).

November 20th, 2014

From lexical trees to effective Eilenberg machines: a tour of mathematical structures for computational linguistics. Mathematics Department, University of Calcutta.

November 11th, 2014

From lexical trees to effective Eilenberg machines: a tour of mathematical structures for computational linguistics. Data Analytics Seminar, IIT Kharagpur.

November 4th-7th 2014

Lectures on Constructive Computation Theory. Computer Science Department, IIT Kharagpur.

October 20th-24th 2014

Lectures on Zen toolkit. Sanskrit Studies Department, University of Hyderabad.

October 16th 2014

Sanskrit signs and Paninian scripts. Pondicherry Workshop on Panini and the Paninians, Institut Français de Pondichéry.

August 25th, 2014

Sanskrit Linguistics Web Services. Demonstration (joint with Pr Amba Kulkarni) at COLING 2014, Dublin. Abstract (pdf).

Febuary 8th, 2014

Semi-automatic analysis of Navyanyāya compounds. Special session on "Recent Developments in Sanskrit Computational Linguistics" at the 30th Round Table of South Asian Language Analysis (SALA), University of Hyderabad. [Presentation by co-author S. R. Arjuna] Slides (pdf).

January 23th, 2014

30 Years of Research and Development around Coq. SIGPLAN Software Systems Award session, 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) San Diego, USA.

January 16th, 2014

From lexical trees to effective Eilenberg machines: the Zen toolkit for computational linguistics.
Abstract. The Zen toolkit is a library in the functional programming language OCaml, oriented towards computational linguistics tasks. Its main data structure is a generic notion of decorated lexical tree, spanning the spectrum between lexicon structures and finite machines transition graphs. Zipper technology allows fast update of such structures in an applicative manner, while the sharing functor yields their optimal compression. A notion of differential word permits crisp representation of morphology as an editing distance. A reactive engine drives non-deterministic search in a fair and efficient manner. These simple concepts generalize to a general notion of relational programming with effective Eilenberg machines. We shall demonstrate the effectiveness of this technology for Sanskrit segmentation.
Department of linguistics, Stanford University. Slides (pdf).

December 17th, 2013

Préhistoire de Caml au projet Formel avec Guy Cousineau. Journée Caml, IRILL, Paris.

November 28th, 2013

Computational Linguistics: the Zen attitude II. Department of Sanskrit Studies, University of Hyderabad.

November 26th, 2013

Computational Linguistics: the Zen attitude I. Department of Sanskrit Studies, University of Hyderabad.

November 13th, 2013

Fondements de l'informatique, à la croisée des mathématiques, de la logique et de la linguistique. Colloque sur L'enseignement philosophique et les sciences: nouvelles perspectives, Fondation del Duca, Paris.

June 13th, 2013

Sanskrit shallow parsing. Seminar on Sanskrit syntax and discourse structures, Université Paris Diderot.

June 4th, 2013

Design of a lean interface for Sanskrit corpus annotation. Workshop on Linguistics and Computation, Chalmers University, Göteborg, Sweden.

April 5th, 2013

Cultural Heritage in the digital age: challenges and research problems. India-France Workshop in ICST "Challenges in overcoming complexity, from big data to cyber-physical systems", New Delhi, India.

October 4th, 2012

Eilenberg machines embedded as Web services for computational linguistics. Séminaire "Demi-heure de sciences", Inria Rocquencourt. Video.

June 30th, 2012

Saṅgaṇakīyaṃsaṃskṛtam. Journée du sanskrit, Maison de l'Inde, Cité Universitaire, Paris (avec Amba Kulkarni).

April 16th, 2012

What I learned from LCF. Conference in Honor of Robin Milner, Edinburgh, Scotland. Video.

April 5th, 2012

The Sanskrit Heritage engine. Séminaire, Laboratoire d'Histoire des Théories Linguistiques, Université Paris Diderot.
Abstract. The Sanskrit Heritage engine is a software platform combining a lexicon usable both as a hyper-text Sanskrit dictionary for human users and as a morphological generator for inflected forms, a text segmenter based on finite-state technology, and a shallow parser based on semantic roles analysis. The global architecture of this platform is that of interconnected web services allowing interaction with digital libraries and other external resources.

January 6th, 2012

Departing from Paa.nini for good reasons. 15th World Sanskrit Conference, New Delhi, India.
Abstract available electronically as pdf.

December 23rd, 2011

The Sanskrit Heritage platform. Workshop on Sanskrit Computational Linguistics, Velyanad, Kerala, India.

October 22nd, 2011

Relational Programming. Workshop on Proofs and Programs in honor of Christine Paulin-Mohring. Chalmers University, Göteborg, Sweden.

September 17th, 2011

Computational linguistics for Sanskrit: presentation of the Sanskrit Heritage platform.
Abstract. We present the current status of a computerized platform for processing Sanskrit text. It consists in a structured lexical database, the Sanskrit Heritage Dictionary (currently 21000 entries, of which 580 verbal roots, generating ~8 lakh forms), and a set of interconnected Web services allowing kṛdānta generation, inflected forms generation, lemmatization, sandhi viccheda, morphological tagging, and shallow parsing. The talk will demonstrate the system on characteristic examples, will discuss the software architecture and its limitations, and will survey ongoing cooperative work with the Sanskrit Studies Department of the University of Hyderabad and the Sanskrit Library effort.
EFEO, Pondicherry.

July 7th, 2011

Discours de réception du Grand Prix Inria. Collège de France.

March 4th, 2011

Quelques réflexions sur la recherche vue comme un système dynamique. Réunion des responsables scientifiques INRIA, Paris.

February 21st, 2011

The functional calculus and its applications to algorithms, proofs, and linguistics. IIT Delhi. Slides (pdf).

February 2nd, 2011

Gustave, ses pompes et ses œuvres. Colloque anniversaire en l'honneur de Gérard Berry et Jean-Jacques Lévy, Gérardmer. Slides (pdf).

January 14th, 2010

Demonstration of a Sanskrit Computational Linguistics Platform. Tata Institute of Fundamental Research, Mumbai.

December 23rd, 2009

Architecture design of the Sanskrit Reader. National Workshop on Sanskrit and Computers: Getting Equipped to Face New Challenges. Sanskrit Studies Department, University of Hyderabad.

December 21st, 2009

Using Computational Linguistics Technology for Sanskrit Understanding. National Workshop on Sanskrit and Computers: Getting Equipped to Face New Challenges. Sanskrit Studies Department, University of Hyderabad.

December 11th, 2009

Sanskrit Segmentation. Special Center for Sanskrit Studies, Jawaharlal Nehru University, New Delhi.

December 11th, 2009

Keynote speech. Euro-India ICT-Cooperation Conference, New Delhi. Slides (ppt).

December 10th, 2009

Relational Programming. Department of Computer Science, Jawaharlal Nehru University, New Delhi.

December 2nd, 2009

Le calcul fonctionnel et ses applications à la notation mathématique, aux algorithmes informatiques, aux preuves de la logique et à la modélisation linguistique. Séminaire du cours "Penser, modéliser et maîtriser le calcul informatique", Collège de France, Paris.
Texte de présentation.

November 17th, 2009

Langage, Logique, Vérité, et Moyens de connaissance justes. Comité national français d'histoire et de philosophie des sciences, Paris.

October 12th, 2009

Relational Programming. Department of Computer Science, University of Texas at Austin, USA.
Abstract. We present in this talk a new paradigm for relational programming, using a concept of "Effective Eilenberg Machines". Eilenberg machines were defined 35 years ago by Samuel Eilenberg as a generalisation of finite state automata, which has not so far attracted the attention we think it rightly deserves. An Eilenberg machine consists in two components. Its control component is similar to a non-deterministic finite state automaton, whose transitions are labeled with symbols from a set of action generators. Its computation component consists in a semantic attachment of actions generators to binary relations over some data domain. These relations are effectively presented as algorithms mapping a data value to a lazily computed stream of related data values. Such machines are doubly non-deterministic, and may be simulated by a sequential reactive engine which completely explores the state space. Various meta-theoretic properties lead to a variety of exploration strategies. For instance, an important family of Finite Eilenberg Machines enjoy an efficient simulation by a purely iterative bottom-up search. Effective Eilenberg Machines define a characteristic relation over their data domain, which may be used as semantic assignment for higher-level machines, leading to a concept of composition of modular machines. A high level language extending regular expressions permits the applicative description of the control component, compiling into finite-state automata. An equational semantics axiomatizes the machine actions within V. Pratt's action algebras, an equational variety which is a conservative extension of Kleene algebras. This conceptual apparatus has been developed as joint research with Benoît Razet.

October 10th, 2009

Sanskrit segmentation. South Asian Languages Analysis Roundtable XXVIII, Denton, Texas.

May 19th, 2009

Eilenberg machines, Constraint processing and Web services as software engineering paradigms for a natural language processing platform. Journées au vert du projet Signes, Saintes.

February 1st, 2009

Automates, transducteurs et machines d'Eilenberg applicatives dans la boîte à outils Zen. Applications au traitement de la langue. Journées Francophones des Langages Applicatifs, Saint-Quentin sur Isère, France.

January 17th, 2009

Demonstration of the Sanskrit Heritage Engine. Third International Symposium on Sanskrit Computational Linguistics, Hyderabad University.

December 23rd, 2008

Functional modeling of computational linguistics. MSR Labs, Bangalore, Inde.

December 20th, 2008

Eilenberg machines, the Zen toolkit, and applications to Sanskrit Computational Linguistics. Tutorial (jointly with Benoît Razet), ICON-2008, Pune, Maharashtra, Inde.

December 2nd, 2008

Équilibre entre les processus génératifs et les processus analytiques: exemple d'un compromis dans la conception d'un système de compréhension du sanskrit. Laboratoire d'histoire des théories linguistiques, Université Paris Diderot Paris 7.

November 13th, 2008

Machines d'Eilenberg, bibliothèque Zen, et applications au traitement informatique du sanskrit. Séminaire du Laboratoire d'Informatique de Nantes (LINA).

August 14th, 2008

A Syntax-Semantics Interface for Sanskrit Using Constraint Processing of Semantic Roles. Invited lecture, Constraints and Language Processing Workshop (CSLP2008), ESSLLI, Hamburg.

June 6th, 2008

Technologie Zen de machines d'état fini et applications au traitement de la langue naturelle. Exalead Society, Paris.

May 20th, 2008

Formal structure of Sanskrit text: Requirements analysis for a mechanical Sanskrit processor. 2nd International Symposium on Sanskrit Computational Linguistics, Brown University, Providence.

Jan 21st, 2008

Experience with Indo-French collaboration in ICT R&D. Kick-off meeting, Euro-India project. Copenhagen Business School.

Jan 3rd, 2008

An overview of the Zen Computational Linguistics toolkit. NLP Winter School 2008, IIIT Hyderabad.

Dec 21st, 2007

Shallow syntax analysis in Sanskrit guided by semantic nets constraints. Google Labs, Bangalore, Karnataka.

Sept 24th, 2007

Design of a computational linguistics framework along applied mathematics principles. Department of Computer Science and Engineering, Chalmers University of Technology, Göteborg, Sweden.
Abstract. The author designed a platform for the analysis of the Sanskrit language using a number of tools, mixing a generative aspect (synthesizing linguistics resources) and an analytic aspect (solving symbolic constraints idealizing some semantic consistency of the analysed sentence). The talk will consist in a demonstration of this platform, followed by the discussion of a proposal for guiding the design of such linguistic assistants along general modeling principles inspired from applied mathematics. The generic view is that understanding natural language by computer ought to be viewed as solving the inverse problem of speech production, putting as a central investigation its parameters identification.

Sept 10th, 2007

Informatics in search of rigorous design principles. Colloquium in honor of Jean-Yves Girard.

June 22nd and 23rd, 2007

Colloquium in honor of Gérard Huet.

June 21st, 2007

Before JPJ: a prehistory of rewriting. Colloquium in honor of Jean-Pierre Jouannaud.

May 30th, 2007

Panini's karakas theory, an elegant interface between syntax and semantics. Journées au vert du projet Signes, Carcans.

January 12th, 2007

From Software Engineering to Certifying Software. Colloquium in memory of Gilles Kahn, Maison des Arts et Métiers, Paris.

December 22nd, 2006

Internet Technology as User Interface of Computational Linguistics Tools for Digital Library Management. Third International Conference on Distributed Computing and Internet Technology (ICDCIT 2006), Bhubaneshwar, India.

December 14th, 2006

Shallow syntax analysis in Sanskrit guided by semantic nets constraints. International Workshop On Research Issues in Digital Libraries (IWRIDL 2006), Calcutta, Inde. Abstract.

July 11th, 2006

Parsing Sanskrit by Computer. 13th World Sanskrit Conference, Edinburgh. Abstract.

April 27th, 2006

Vérité Mathématique, cohérence logique et vérification informatique. Conférence M.U.R.S., cycle "Qu'est-ce que la vérité scientifique ?", Palais de la découverte, Paris. Available electronically as doc file.

April 20th, 2006

Analyse syntaxique superficielle guidée par des contraintes d'accord et de gouvernement. Application au sanskrit. Séminaire TAL de Nancy. Résumé.

March 24th, 2006

Mathematics, Linguistics, and Types. Journée IHPST: Théories modernes des types, Paris Programme. Slides.

Dec 20th, 2005

Natural language processing using functional programming: Example of a Sanskrit processing platform. KIIT, Bhubaneshwar, Orissa.

May 21st, 2005

A Computational Linguistics Platform for Sanskrit. Journée ATALA: Traitement automatique des langues anciennes, Paris. Démo.

April 29th, 2005

Design of a Computational Linguistics Platform for Sanskrit. Invited Conference, Logical Aspects of Computational Linguistics (LACL), Bordeaux.

April 26th, 2005

Design of a Computational Linguistics Platform. Robin Milner lecture, Informatics Jamboree, University of Edinburgh, U.K. Abstract.

April 13th, 2005

Rewriting before RTA. Invited talk, Rewriting Theory and Applications (RTA'05), Nara, Japan.

November 23rd, 2004

Des Lambdas et des Aums. Conférence en l'honneur du Pr Martin-Löf, Marseille Luminy.

October 5th, 2004

Transducteurs d'état fini applicatifs et traitement des langues naturelles. Colloquium CMAT-CMAP-STIX, Centre de mathématiques, Ecole Polytechnique, Palaiseau.

September 6th, 2004

Lessons in Non-determinism. Invited Talk, 20th International Conference on Logic Programming (ICLP), St Malo. I wore my professor's hat this time.

August 29th, 2004

Design of a Lexical Database for Sanskrit. Workshop on Enhancing and Using Electronic Dictionaries, Coling 2004, Geneva.

August 27th, 2004

Functionality theory applied to Informatics, Logic and Linguistics. Session on New mathematics for new challenges, EuroScience Forum 2004, Stockholm.

August 19th, 2004

Splitting the Entropy Gordian Knot. Evening Lecture, ESSLLI, Nancy. Abstract available here.

May 21st, 2004

Computational Linguistics from Zen to AuM. Lecture, Chalmers University, Göteborg. PDF slides available here.

March 16th, 2004

De Zen à Aum. Séminaire LIMSI, Orsay. Slides available as pdf document.

February 5th, 2004

La théorie de la fonctionnalité à la croisée des chemins entre Informatique, Logique et Linguistique. Colloquium, Sophia-Antipolis. Slides available as pdf document.

December 20th, 2003

Towards Computational Processing of Sanskrit. International Conference on Natural Language Processing (ICON-2003), Mysore, Karnataka, India. Slides available as pdf document.

July 16th, 2003

Lexicon-directed Segmentation and Tagging of Sanskrit. XIIth World Sanskrit Conference, Helsinki, Finland. Slides available as pdf document.

July 1st, 2003

Automata Mista. Festchrift in honor of Zohar Manna, Taormina, Sicily. Slides available as pdf document.

May 12th, 2003

Automates mixtes. Groupe de travail automates, LaBRI, Bordeaux. Slides available as pdf document.

January 14th, 2003

Zen and the Art of Symbolic Computing: Light and Fast Applicative Algorithms for Computational Linguistics. Invited lecture, Practical Aspects of Declarative Programming (PADL), New Orleans, Louisiana. Slides available as pdf document.

December 14th, 2002

The Zen Computational Linguistics Toolkit: Lexicon Structures and Morphology computations using a modular functional programming language. Tutorial, Language Engineering Conference LEC'2002, Hyderabad. Slides available as pdf document.

September 17th, 2002

Défis scientifiques du traitement informatique de la langue. Conférence de rentrée, ENS Cachan. Slides available as pdf document.

August 22nd, 2002

Higher-order Unification, 30 years later. Invited lecture, Theorem Proving in Higher Order Logic Conference, Hampton, Virginia. Extended abstract available as ps file. Slides available as pdf document.

August 5th-9th, 2002

The Zen Computational Linguistics Toolkit. Course, ESSLLI, Trento, Italy. Course notes available as PS text, as PDF,text, or as HTML document. Slides available as PS and PDF.

April 10th, 2002

Representation Issues for Symbolic Computation. Invited lecture, Workshop on 35 years of Automath, Heriot-Watt University, Edinburgh. Postscript slides available here.

October 12th, 2001

Lexiques, automates et coroutines : quelques outils de programmation fonctionnelle, appliqués à une plate-forme de linguistique computationnelle. Groupe de travail sur les automates du LIAFA, Université Paris 7.

October 9th, 2001

Computational Tools for Sanskrit. Workshop on Computational Linguistics in South Asian Languages, XXIth South Asian Languages Analysis Roundtable, University of Konstanz. Powerpoint slides available here.

October 5th, 2001

From an informal textual lexicon to a well-structured lexical database: An experiment in data reverse engineering IEEE Working Conference on Reverse Engineering. (WCRE'2001), Stuttgart. Powerpoint slides available here.

September 2001

Lexiques, Automates et Coroutines - ML appliqué au TAL. Séminaire Cristal, INRIA Rocquencourt. Postscript slides available here.

May 31st, 2001

25 Years of Formal Method and Tools at INRIA: An Overview. Faculty of Engineering 90th Anniversary Distinguished Lecture, The University of Hong Kong. Powerpoint slides available here.

May 2000

Architecture of an ML Lexicographic Database Processor. Lecture, Chalmers University, Göteborg. PDF slides available here.


July 28th, 1996

The next 700 Proof Assistants. Invited Lecture, Federated Logic Conference FLoC'96. This lecture is famous for having introduced the zipper concept and for the strong reactions this presentation evinced. Since some of the material in the talk was never published, specially regarding the use of Regular Böhm Trees for sequent calculus implementation, I offer here the slides of the talk. The slide that provoked the scandal is the one between slide 14 and slide 15. I rest my case.

This event marked the end of my active research period into logic and the mechanization of mathematics. A few months afterwards I took a managerial position at INRIA's Direction Générale as Head of International Relations. When I returned to the lab in the next century, I started my work in Computational Linguistics.

June 16th, 1987

Canonical basis of commuting diagrams - Application to the mechanical synthesis of coherence conditions . By some miracle, the 1987 slides survived, and a fac-simile is available as a pdf document. This lecture is famous for having infuriated William Lawvere beyond control. It marked the end of my interest for category theory and its psychopaths.

Last update: April 29th, 2016