| 2012 | ||
|---|---|---|
| c30 | Pawan Goyal, Gérard P. Huet, Amba P. Kulkarni, Peter M. Scharf, Ralph Bunker: A Distributed Platform for Sanskrit Processing. COLING 2012: 1011-1028 | |
| 2011 | ||
| j18 | ||
| 2009 | ||
| e2 | Gérard P. Huet, Amba P. Kulkarni, Peter M. Scharf (Eds.): Sanskrit Computational Linguistics, First and Second International Symposia Rocquencourt, France, October 29-31, 2007 Providence, RI, USA, May 15-17, 2008 Revised Selected and Invited Papers. Lecture Notes in Computer Science 5402, Springer 2009, isbn 978-3-642-00154-3 | |
| e1 | Amba P. Kulkarni, Gérard P. Huet (Eds.): Sanskrit Computational Linguistics, Third International Symposium, Hyderabad, India, January 15-17, 2009. Proceedings. Lecture Notes in Computer Science 5406, Springer 2009, isbn 978-3-540-93884-2 | |
| 2008 | ||
| c29 | Gérard P. Huet: Formal Structure of Sanskrit Text: Requirements Analysis for a Mechanical Sanskrit Processor. Sanskrit Computational Linguistics 2008: 162-199 | |
| 2006 | ||
| c28 | Gérard P. Huet, Benoît Razet: The Reactive Engine for Modular Transducers. Essays Dedicated to Joseph A. Goguen 2006: 355-374 | |
| c27 | Gérard P. Huet: Shallow syntax analysis in Sanskrit guided by semantic nets constraints. IWRIDL 2006: 6 | |
| 2005 | ||
| j17 | Gérard P. Huet: A functional toolkit for morphological and phonological processing, application to a Sanskrit tagger. J. Funct. Program. 15(4): 573-614 (2005) | |
| 2003 | ||
| j16 | Gérard P. Huet: Special issue on 'Logical frameworks and metalanguages'. J. Funct. Program. 13(2): 257-260 (2003) | |
| c26 | ||
| c25 | Gérard P. Huet: Zen and the Art of Symbolic Computing: Light and Fast Applicative Algorithms for Computational Linguistics. PADL 2003: 17-18 | |
| 2002 | ||
| j15 | ||
| c24 | ||
| 2001 | ||
| c23 | Gérard P. Huet: From an Informal Textual Lexicon to a Well-Structured Lexical Database: An Experiment in Data Reverse Engineering. WCRE 2001: 127-135 | |
| 2000 | ||
| c22 | Gérard P. Huet, Amokrane Saïbi: Constructive category theory. Proof, Language, and Interaction 2000: 239-276 | |
| 1998 | ||
| j14 | Gérard P. Huet: Regular Böhm trees. Mathematical Structures in Computer Science 8(6): 671-680 (1998) | |
| 1997 | ||
| j13 | ||
| c21 | ||
| 1996 | ||
| c20 | ||
| 1994 | ||
| j12 | Gérard P. Huet: Residual Theory in lambda-Calculus: A Formal Development. J. Funct. Program. 4(3): 371-394 (1994) | |
| 1993 | ||
| j11 | ||
| 1992 | ||
| c19 | ||
| 1991 | ||
| c18 | Gérard P. Huet, Jean-Jacques Lévy: Computations in Orthogonal Rewriting Systems, I. Computational Logic - Essays in Honor of Alan Robinson 1991: 395-414 | |
| c17 | Gérard P. Huet, Jean-Jacques Lévy: Computations in Orthogonal Rewriting Systems, II. Computational Logic - Essays in Honor of Alan Robinson 1991: 415-443 | |
| 1990 | ||
| c16 | Gérard P. Huet: Design Issues for a Computer-aided Environment for Constructive Mathematics (Abstract). DISCO 1990: 55 | |
| 1988 | ||
| j10 | ||
| 1987 | ||
| c15 | ||
| c14 | Gérard P. Huet: Induction Principles Formalized in the Calculus of Constructions. TAPSOFT, Vol.1 1987: 276-286 | |
| 1986 | ||
| j9 | François Fages, Gérard P. Huet: Complete Sets of Unifiers and Matchers in Equational Theories. Theor. Comput. Sci. 43: 189-200 (1986) | |
| c13 | ||
| c12 | ||
| 1985 | ||
| j8 | Thierry Coquand, Gérard P. Huet: A Selected Bibliography on Constructive Mathematics, Intuitionistic Type Theory and Higher Order Deduction. J. Symb. Comput. 1(3): 323-328 (1985) | |
| c11 | Gérard P. Huet: Deduction and Computation. Advanced Course: Fundamentals of Artificial Intelligence 1985: 38-74 | |
| c10 | Thierry Coquand, Gérard P. Huet: Constructions: A Higher Order Proof System for Mechanizing Mathematics. European Conference on Computer Algebra (1) 1985: 151-184 | |
| c9 | Gérard P. Huet: Cartesian closed Categories and Lambda- calculus. Combinators and Functional Programming Languages 1985: 123-135 | |
| c8 | Thierry Coquand, Gérard P. Huet: Concepts mathématiques et informatiques formalisés dans le calcul des constructions. Logic Colloquium 1985: 123-146 | |
| 1983 | ||
| c7 | François Fages, Gérard P. Huet: Complete Sets of Unifiers and Matchers in Equational Theories. CAAP 1983: 205-220 | |
| 1982 | ||
| j7 | Gérard P. Huet, Jean-Marie Hullot: Proofs by Induction in Equational Theories with Constructors. J. Comput. Syst. Sci. 25(2): 239-266 (1982) | |
| c6 | ||
| 1981 | ||
| j6 | Gérard P. Huet: A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm. J. Comput. Syst. Sci. 23(1): 11-21 (1981) | |
| 1980 | ||
| j5 | Gérard P. Huet: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems. J. ACM 27(4): 797-821 (1980) | |
| c5 | Gérard P. Huet, Jean-Marie Hullot: Proofs by Induction in Equational Theories with Constructors. FOCS 1980: 96-107 | |
| 1978 | ||
| j4 | Gérard P. Huet, Bernard Lang: Proving and Applying Program Transformations Expressed with Second-Order Patterns. Acta Inf. 11: 31-55 (1978) | |
| j3 | Gérard P. Huet: An Algorithm to Generate the Basis of Solutions to Homogeneous Linear Diophantine Equations. Inf. Process. Lett. 7(3): 144-147 (1978) | |
| 1977 | ||
| c4 | Gérard P. Huet: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. FOCS 1977: 30-45 | |
| c3 | Jacques Pitrat, Erik Sandewall, Wolfgang Bibel, Gérard P. Huet, Hans-Hellmut Nagel, M. Somalivco: Artificial Intelligence in Western Europe. IJCAI 1977: 955-969 | |
| 1975 | ||
| j2 | Gérard P. Huet: A Unification Algorithm for Typed lambda-Calculus. Theor. Comput. Sci. 1(1): 27-57 (1975) | |
| c2 | Gérard P. Huet: unification in typed lambda calculus. Lambda-Calculus and Computer Science Theory 1975: 192-212 | |
| 1973 | ||
| j1 | Gérard P. Huet: The Undecidability of Unification in Third Order Logic. Information and Control 22(3): 257-267 (1973) | |
| c1 | ||
Colors in the list of coauthors
Last update Sun May 19 02:00:45 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page