| 2009 |
| 48 | EE | Gérard P. Huet,
Amba P. Kulkarni,
Peter M. Scharf:
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
Springer 2009 |
| 47 | EE | Amba P. Kulkarni,
Gérard P. Huet:
Sanskrit Computational Linguistics, Third International Symposium, Hyderabad, India, January 15-17, 2009. Proceedings
Springer 2009 |
| 2008 |
| 46 | EE | Gérard P. Huet:
Formal Structure of Sanskrit Text: Requirements Analysis for a Mechanical Sanskrit Processor.
Sanskrit Computational Linguistics 2008: 162-199 |
| 2006 |
| 45 | EE | Gérard P. Huet,
Benoît Razet:
The Reactive Engine for Modular Transducers.
Essays Dedicated to Joseph A. Goguen 2006: 355-374 |
| 44 | EE | Gérard P. Huet:
Shallow syntax analysis in Sanskrit guided by semantic nets constraints.
IWRIDL 2006: 6 |
| 2005 |
| 43 | EE | 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 |
| 42 | EE | Gérard P. Huet:
Zen and the Art of Symbolic Computing: Light and Fast Applicative Algorithms for Computational Linguistics.
PADL 2003: 17-18 |
| 41 | EE | Gérard P. Huet:
Automata Mista.
Verification: Theory and Practice 2003: 359-372 |
| 40 | EE | Gérard P. Huet:
Special issue on 'Logical frameworks and metalanguages'.
J. Funct. Program. 13(2): 257-260 (2003) |
| 2002 |
| 39 | EE | Gérard P. Huet:
Higher Order Unification 30 Years Later.
TPHOLs 2002: 3-12 |
| 38 | EE | Gérard P. Huet:
Srl Yantra Geometry.
Theor. Comput. Sci. 281(1-2): 609-628 (2002) |
| 2001 |
| 37 | EE | 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 |
| 36 | | Gérard P. Huet,
Amokrane Saïbi:
Constructive category theory.
Proof, Language, and Interaction 2000: 239-276 |
| 1998 |
| 35 | | Gérard P. Huet:
Regular Böhm trees.
Mathematical Structures in Computer Science 8(6): 671-680 (1998) |
| 1997 |
| 34 | | Gérard P. Huet,
Henri Laulhère:
Finite-State Transducers as Regular Böhm Trees.
TACS 1997: 604-610 |
| 33 | | Gérard P. Huet:
The Zipper.
J. Funct. Program. 7(5): 549-554 (1997) |
| 1996 |
| 32 | | Gérard P. Huet:
Design Proof Assistant (Abstract).
RTA 1996: 153 |
| 1994 |
| 31 | | Gérard P. Huet:
Residual Theory in lambda-Calculus: A Formal Development.
J. Funct. Program. 4(3): 371-394 (1994) |
| 1993 |
| 30 | | Gérard P. Huet:
An Analysis of Böhm's Theorem.
Theor. Comput. Sci. 121(1&2): 145-167 (1993) |
| 1992 |
| 29 | | Gérard P. Huet:
The Gallina Specification language: A Case Study.
FSTTCS 1992: 229-240 |
| 1991 |
| 28 | | 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 |
| 27 | | 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 |
| 26 | | Gérard P. Huet:
Design Issues for a Computer-aided Environment for Constructive Mathematics (Abstract).
DISCO 1990: 55 |
| 1988 |
| 25 | | Thierry Coquand,
Gérard P. Huet:
The Calculus of Constructions
Inf. Comput. 76(2/3): 95-120 (1988) |
| 1987 |
| 24 | | Gérard P. Huet:
The Calculus of Constructions: State of the Art.
FSTTCS 1987: 372 |
| 23 | | Gérard P. Huet:
Induction Principles Formalized in the Calculus of Constructions.
TAPSOFT, Vol.1 1987: 276-286 |
| 1986 |
| 22 | | Gérard P. Huet:
Mechanizing Constructive Proofs (Abstract).
CADE 1986: 403 |
| 21 | | Gérard P. Huet:
Theorem Proving Systems of the Formel Project.
CADE 1986: 687-688 |
| 20 | | François Fages,
Gérard P. Huet:
Complete Sets of Unifiers and Matchers in Equational Theories.
Theor. Comput. Sci. 43: 189-200 (1986) |
| 1985 |
| 19 | | Gérard P. Huet:
Deduction and Computation.
Advanced Course: Fundamentals of Artificial Intelligence 1985: 38-74 |
| 18 | | Gérard P. Huet:
Cartesian closed Categories and Lambda- calculus.
Combinators and Functional Programming Languages 1985: 123-135 |
| 17 | | Thierry Coquand,
Gérard P. Huet:
Constructions: A Higher Order Proof System for Mechanizing Mathematics.
European Conference on Computer Algebra (1) 1985: 151-184 |
| 16 | | Thierry Coquand,
Gérard P. Huet:
Concepts mathématiques et informatiques formalisés dans le calcul des constructions.
Logic Colloquium 1985: 123-146 |
| 15 | | 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) |
| 1983 |
| 14 | | François Fages,
Gérard P. Huet:
Complete Sets of Unifiers and Matchers in Equational Theories.
CAAP 1983: 205-220 |
| 1982 |
| 13 | | Gérard P. Huet:
In Defense of Programming Languages Design.
ECAI 1982: 19-27 |
| 12 | | Gérard P. Huet,
Jean-Marie Hullot:
Proofs by Induction in Equational Theories with Constructors.
J. Comput. Syst. Sci. 25(2): 239-266 (1982) |
| 1981 |
| 11 | | 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 |
| 10 | | Gérard P. Huet,
Jean-Marie Hullot:
Proofs by Induction in Equational Theories with Constructors
FOCS 1980: 96-107 |
| 9 | EE | 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) |
| 1978 |
| 8 | | Gérard P. Huet,
Bernard Lang:
Proving and Applying Program Transformations Expressed with Second-Order Patterns.
Acta Inf. 11: 31-55 (1978) |
| 7 | | 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 |
| 6 | | Gérard P. Huet:
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
FOCS 1977: 30-45 |
| 5 | | 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 |
| 4 | | Gérard P. Huet:
unification in typed lambda calculus.
Lambda-Calculus and Computer Science Theory 1975: 192-212 |
| 3 | | Gérard P. Huet:
A Unification Algorithm for Typed lambda-Calculus.
Theor. Comput. Sci. 1(1): 27-57 (1975) |
| 1973 |
| 2 | | Gérard P. Huet:
A Mechanization of Type Theory.
IJCAI 1973: 139-146 |
| 1 | | Gérard P. Huet:
The Undecidability of Unification in Third Order Logic
Information and Control 22(3): 257-267 (1973) |