The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gérard P. Huet: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gérard P. Huet
    Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems. [Citation Graph (15, 0)][DBLP]
    J. ACM, 1980, v:27, n:4, pp:797-821 [Journal]
  2. Gérard P. Huet, Bernard Lang
    Proving and Applying Program Transformations Expressed with Second-Order Patterns. [Citation Graph (1, 0)][DBLP]
    Acta Inf., 1978, v:11, n:, pp:31-55 [Journal]
  3. Gérard P. Huet
    Deduction and Computation. [Citation Graph (0, 0)][DBLP]
    Advanced Course: Fundamentals of Artificial Intelligence, 1985, pp:38-74 [Conf]
  4. Gérard P. Huet
    Automata Mista. [Citation Graph (0, 0)][DBLP]
    Verification: Theory and Practice, 2003, pp:359-372 [Conf]
  5. Gérard P. Huet, Jean-Jacques Lévy
    Computations in Orthogonal Rewriting Systems, I. [Citation Graph (0, 0)][DBLP]
    Computational Logic - Essays in Honor of Alan Robinson, 1991, pp:395-414 [Conf]
  6. Gérard P. Huet, Jean-Jacques Lévy
    Computations in Orthogonal Rewriting Systems, II. [Citation Graph (0, 0)][DBLP]
    Computational Logic - Essays in Honor of Alan Robinson, 1991, pp:415-443 [Conf]
  7. Gérard P. Huet, Benoît Razet
    The Reactive Engine for Modular Transducers. [Citation Graph (0, 0)][DBLP]
    Essays Dedicated to Joseph A. Goguen, 2006, pp:355-374 [Conf]
  8. François Fages, Gérard P. Huet
    Complete Sets of Unifiers and Matchers in Equational Theories. [Citation Graph (0, 0)][DBLP]
    CAAP, 1983, pp:205-220 [Conf]
  9. Gérard P. Huet
    Mechanizing Constructive Proofs (Abstract). [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:403- [Conf]
  10. Gérard P. Huet
    Theorem Proving Systems of the Formel Project. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:687-688 [Conf]
  11. Gérard P. Huet
    Design Issues for a Computer-aided Environment for Constructive Mathematics (Abstract). [Citation Graph (0, 0)][DBLP]
    DISCO, 1990, pp:55- [Conf]
  12. Gérard P. Huet
    In Defense of Programming Languages Design. [Citation Graph (0, 0)][DBLP]
    ECAI, 1982, pp:19-27 [Conf]
  13. Thierry Coquand, Gérard P. Huet
    Constructions: A Higher Order Proof System for Mechanizing Mathematics. [Citation Graph (0, 0)][DBLP]
    European Conference on Computer Algebra (1), 1985, pp:151-184 [Conf]
  14. Gérard P. Huet
    Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:30-45 [Conf]
  15. Gérard P. Huet, Jean-Marie Hullot
    Proofs by Induction in Equational Theories with Constructors [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:96-107 [Conf]
  16. Gérard P. Huet
    The Calculus of Constructions: State of the Art. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1987, pp:372- [Conf]
  17. Gérard P. Huet
    The Gallina Specification language: A Case Study. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:229-240 [Conf]
  18. Gérard P. Huet
    A Mechanization of Type Theory. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1973, pp:139-146 [Conf]
  19. Jacques Pitrat, Erik Sandewall, Wolfgang Bibel, Gérard P. Huet, Hans-Hellmut Nagel, M. Somalivco
    Artificial Intelligence in Western Europe. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1977, pp:955-969 [Conf]
  20. Gérard P. Huet
    unification in typed lambda calculus. [Citation Graph (0, 0)][DBLP]
    Lambda-Calculus and Computer Science Theory, 1975, pp:192-212 [Conf]
  21. Gérard P. Huet
    Cartesian closed Categories and Lambda- calculus. [Citation Graph (0, 0)][DBLP]
    Combinators and Functional Programming Languages, 1985, pp:123-135 [Conf]
  22. Thierry Coquand, Gérard P. Huet
    Concepts mathématiques et informatiques formalisés dans le calcul des constructions. [Citation Graph (0, 0)][DBLP]
    Logic Colloquium, 1985, pp:123-146 [Conf]
  23. Gérard P. Huet
    Zen and the Art of Symbolic Computing: Light and Fast Applicative Algorithms for Computational Linguistics. [Citation Graph (0, 0)][DBLP]
    PADL, 2003, pp:17-18 [Conf]
  24. Gérard P. Huet
    Design Proof Assistant (Abstract). [Citation Graph (0, 0)][DBLP]
    RTA, 1996, pp:153- [Conf]
  25. Gérard P. Huet, Henri Laulhère
    Finite-State Transducers as Regular Böhm Trees. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:604-610 [Conf]
  26. Gérard P. Huet
    Induction Principles Formalized in the Calculus of Constructions. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:276-286 [Conf]
  27. Gérard P. Huet
    Higher Order Unification 30 Years Later. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2002, pp:3-12 [Conf]
  28. Gérard P. Huet
    From an Informal Textual Lexicon to a Well-Structured Lexical Database: An Experiment in Data Reverse Engineering. [Citation Graph (0, 0)][DBLP]
    WCRE, 2001, pp:127-135 [Conf]
  29. Thierry Coquand, Gérard P. Huet
    The Calculus of Constructions [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1988, v:76, n:2/3, pp:95-120 [Journal]
  30. Gérard P. Huet
    The Undecidability of Unification in Third Order Logic [Citation Graph (0, 0)][DBLP]
    Information and Control, 1973, v:22, n:3, pp:257-267 [Journal]
  31. Gérard P. Huet
    An Algorithm to Generate the Basis of Solutions to Homogeneous Linear Diophantine Equations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1978, v:7, n:3, pp:144-147 [Journal]
  32. Gérard P. Huet
    A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1981, v:23, n:1, pp:11-21 [Journal]
  33. Gérard P. Huet, Jean-Marie Hullot
    Proofs by Induction in Equational Theories with Constructors. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1982, v:25, n:2, pp:239-266 [Journal]
  34. Gérard P. Huet
    Special issue on 'Logical frameworks and metalanguages'. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:2, pp:257-260 [Journal]
  35. Gérard P. Huet
    Residual Theory in lambda-Calculus: A Formal Development. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1994, v:4, n:3, pp:371-394 [Journal]
  36. Gérard P. Huet
    The Zipper. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1997, v:7, n:5, pp:549-554 [Journal]
  37. Gérard P. Huet
    A functional toolkit for morphological and phonological processing, application to a Sanskrit tagger. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2005, v:15, n:4, pp:573-614 [Journal]
  38. Thierry Coquand, Gérard P. Huet
    A Selected Bibliography on Constructive Mathematics, Intuitionistic Type Theory and Higher Order Deduction. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1985, v:1, n:3, pp:323-328 [Journal]
  39. Gérard P. Huet
    Regular Böhm trees. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1998, v:8, n:6, pp:671-680 [Journal]
  40. François Fages, Gérard P. Huet
    Complete Sets of Unifiers and Matchers in Equational Theories. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:43, n:, pp:189-200 [Journal]
  41. Gérard P. Huet
    Srl Yantra Geometry. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:609-628 [Journal]
  42. Gérard P. Huet
    A Unification Algorithm for Typed lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1975, v:1, n:1, pp:27-57 [Journal]
  43. Gérard P. Huet
    An Analysis of Böhm's Theorem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:121, n:1&2, pp:145-167 [Journal]

  44. Constructive category theory. [Citation Graph (, )][DBLP]


  45. Shallow syntax analysis in Sanskrit guided by semantic nets constraints. [Citation Graph (, )][DBLP]


  46. Formal Structure of Sanskrit Text: Requirements Analysis for a Mechanical Sanskrit Processor. [Citation Graph (, )][DBLP]


Search in 0.079secs, Finished in 0.081secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002