#### Filter Results:

- Full text PDF available (20)

#### Publication Year

1986

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Gilles Dowek, Thérèse Hardin, Claude Kirchner
- Journal of Automated Reasoning
- 2003

Deduction modulo is a way to remove computational arguments from proofs by reasoning modulo a congruence on propositions. Such a technique, issued from automated theorem proving, is of general interest because it permits one to separate computations and deductions in a clean way. The first contribution of this paper is to define a sequent calculus modulo… (More)

- Gilles Dowek, Thérèse Hardin, Claude Kirchner
- Inf. Comput.
- 2000

Higher order uniication is equational uniication for-conversion. But it is not rst order equa-tional uniication, as substitution has to avoid capture. Thus the methods for equational uniication (such as narrowing) built upon grafting (i.e. substitution without renaming), cannot be used for higher order uniication, which needs speciic algorithms. Our goal in… (More)

- Pierre-Louis Curien, Thérèse Hardin, Jean-Jacques Lévy
- J. ACM
- 1996

Categorical combinators [Curien 1986/1993; Hardin 1989; Yokouchi 1989] and more recently λ&sgr;-calculus [Abadi 1991; Hardin and Le´vy 1989], have been introduced to provide an explicit treatment of substitutions in the λ-calculus. We reintroduce here the ingredients of these calculi in a self-contained and stepwise way, with a special… (More)

- Gilles Dowek, Thérèse Hardin, Claude Kirchner
- LICS
- 1995

Higher-order uniication is equational uniication for-conversion. But it is not rst-order equational uniication, as substitution has to avoid capture. In this paper higher-order uniication is reduced to rst-order equational uniication in a suitable theory: the-calculus of explicit substitutions.

- Thérèse Hardin
- Theor. Comput. Sci.
- 1989

The Strong Categorical Combinatory Logic (CCL, CCLpqSP), developed by Curien (1986) is, when typed and augmented with a rule defining a terminal object, a presentation of Cartesian Closed Categories. Furthermore, it is equationally equivalent to the Lambda-calculus with explicit couples and Surjective Pairing. Here we study the confluence properties of… (More)

- Gilles Dowek, Thérèse Hardin, Claude Kirchner, Frank Pfenning
- JICSLP
- 1996

Following the general method and related completeness results on using explicit substitutions to perform higher-order unification proposed in [5], we investigate in this paper the case of higher-order patterns as introduced by Miller. We show that our general algorithm specializes in a very convenient way to patterns. We also sketch an efficient… (More)

- Gilles Dowek, Thérèse Hardin, Claude Kirchner
- Mathematical Structures in Computer Science
- 2001

GILLES DOWEK, THERESE HARDIN and CLAUDE KIRCHNER Mathematical Structures in Computer Science / Volume 11 / Issue 01 / February 2001, pp 21 45 DOI: null, Published online: 07 March 2001 Link to this article: http://journals.cambridge.org/abstract_S0960129500003236 How to cite this article: GILLES DOWEK, THERESE HARDIN and CLAUDE KIRCHNER (2001). HOLλσ: an… (More)

- Thérèse Hardin, Luc Maranget
- J. Funct. Program.
- 1998

- Thérèse Hardin
- Applicable Algebra in Engineering, Communication…
- 1992

Some new calculi [1,12,7], referred to by the collective name of λσ- calculus, have been recently introduced to provide an explicit treatment of substitutions in the λ-calculus. They are term rewriting systems, with two sorts: substitution and term. The λ-terms are exactly the ground λσ-terms of sort term containing no substitutions and the β-reduction is… (More)

- Catherine Dubois, Thérèse Hardin, Véronique Donzeau-Gouge
- Trends in Functional Programming
- 2004