Concepts Mathématiques et Informatiques Formalisés dans le Calcul des Constructions

This publication has 26 references indexed in Scilit:

• Automatic synthesis of typed Λ-programs on term algebras
  Theoretical Computer Science, 1985
• An ideal model for recursive polymorphic types
  Published by Association for Computing Machinery (ACM) ,1984
• The Expressiveness of Simple and Second-Order Type Structures
  Journal of the ACM, 1983
• Polymorphic type inference
  Published by Association for Computing Machinery (ACM) ,1983
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
  Journal of the ACM, 1980
• A unification algorithm for typed λ-calculus
  Theoretical Computer Science, 1975
• Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
  Indagationes Mathematicae, 1972
• Resolution in type theory
  The Journal of Symbolic Logic, 1971
• The mathematical language AUTOMATH, its usage, and some of its extensions
  Published by Springer Nature ,1970
• The next 700 programming languages
  Communications of the ACM, 1966